Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)
DOI:
https://doi.org/10.7146/brics.v1i39.21604Abstract
In Crypto93, Damgård showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the honest verifier can be transformed into a protocol (for the same problem) that is zero-knowledge in general. His transformation was based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung, and thus the resulting protocol had very large round-complexity.Downloads
Published
1994-11-30
How to Cite
Damgård, I. B., Goldreich, O., & Wigderson, A. (1994). Hashing Functions can Simplify Zero-Knowledge Protocol Design (too). BRICS Report Series, 1(39). https://doi.org/10.7146/brics.v1i39.21604
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.