Post-quantum security proof for multi-output interactive hashing
Original title: A Post-Quantum Interactive Hashing Theorem
The note gives a post-quantum security proof for multi-output interactive hashing with arbitrary relations.
Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung, is a building block in cryptographic protocols including perfectly hiding commitments and statistical zero-knowledge arguments. The paper provides a post-quantum security proof for its multi-output generalization used in constructions from one-way functions and permutations. This strengthens prior results by proving security in the post-quantum setting.
- Post-quantum security proof for multi-output interactive hashing
- Building block for statistical zero-knowledge arguments for NP
- Construction from arbitrary one-way functions
- Enhances commitments from one-way permutations
- OVY93 protocol generalization
From the original article
1 min read at arxiv.orgInteractive 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].
By Céline Chevalier · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.