Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 26 min ago
PreprintCC BY 4.0arXiv

A Post-Quantum Interactive Hashing Theorem

  • Céline Chevalier
  • Laurent Holin
  • Quoc-Huy Vu
Open at sourcePDFDOICite

Abstract

Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung [OVY93], is a building block in many cryptographic protocols, including perfectly hiding commitments from one-way permutations [NOVY92]. Its multi-output generalization is a key ingredient in constructions of statistical zero-knowledge arguments for NP and statistically hiding commitments from arbitrary one-way functions [NOV06,HR07]. In this note, we give a post-quantum security proof for this multi-output interactive hashing protocol with arbitrary relations.

Related

  1. Quantum Hashing with QKD States
    A. V. Vasiliev, I. G. Zinnatullin
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Optical Quantum Memory Processing for Quantum Hashing
    S. A. Moiseev, M. M. Minnegaliev
    arXivPreprintCC BY 4.0Full textOptics & photonicsQuantum physics & quantum informationarXiv
  3. Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
    Kenta Kasai
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. On the Failure Probability of Quantum Leftover Hashing with Bad Seeds
    Asker Friis Bach, Isabel Moreno Babuglia, Jonatan Bohr Brask
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  5. EasyHybrid: An Interactive Graphical Environment for Quantum, Classical and Hybrid Simulations with pDynamo3
    José Fernando Ruggiero Bachega, Gustavo Hagen, Carlos Sequeiros-Borja +4
    Journal of Chemical Information and ModelingPeer-reviewedCC BY 4.0Full textAtomic, molecular & optical physicsHAL

Cite

BibTeXRIS
BibTeX
@misc{chevalier2026postquantum,
  title = {{A Post-Quantum Interactive Hashing Theorem}},
  author = {Céline Chevalier and Laurent Holin and Quoc-Huy Vu},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.06124},
  eprint = {2611.06124},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.06124},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A Post-Quantum Interactive Hashing Theorem
AU  - Céline Chevalier
AU  - Laurent Holin
AU  - Quoc-Huy Vu
PY  - 2026
DA  - 2026/11/04
PB  - arXiv
DO  - 10.48550/arxiv.2611.06124
UR  - https://arxiv.org/abs/2611.06124
AB  - Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung [OVY93], is a building block in many cryptographic protocols, including perfectly hiding commitments from one-way permutations [NOVY92]. Its multi-output generalization is a key ingredient in constructions of statistical zero-knowledge arguments for NP and statistically hiding commitments from arbitrary one-way functions [NOV06,HR07]. In this note, we give a post-quantum security proof for this multi-output interactive hashing protocol with arbitrary relations.
ER  -