Abstract
We show that any 3-round protocol (in general, any bounded round protocol) in which the verifier sends only random bits, and which is zero-knowledge against an honest verifier can be transformed into a protocol that is zero-knowledge in general The transformation is based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung. No assumption is made on the computing power of prover or verifier, and the transformation therefore is valid in both the proof and argument model, and does not rely on any computational assumptions such as the existence of one-way permutations. The technique is also applicable to proofs of knowledge. The transformation preserves perfect and statistical zero-knowledge. As corollaries, we show first a generalization of a result by Damgård on construction of bit-commitments from zero-knowledge proofs. Other corollaries give results on non-interactive zero-knowledge, one-sided proof systems, and black-box simulation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blum, De Santis, Micali and Persiano: Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol.20, no.6, 1991.
G. Brassard, D. Chaum and C. Crépeau: Minimum Disclosure Proofs of Knowledge, JCSS.
Ben-Or, Goldreich, Goldwasser, Håstad, Killian, Micali and Rogaway: Everything Provable is Provable in Zero-Kowledge, Proc. of Crypto 88.
Bellare, Micali and Ostrovsky: The (true) Complexity of Statsitical Zero-Knowledge, STOC 90.
I. Damgård: On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs, Proc. of Crypto 89, Springer Verlag LNCS series.
Goldreich, Mansour and Sipser: Poofs that Never Fail and Random Selection, FOCS 87.
O. Goldreich, S. Micali and A. Wigderson: Proof that Yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design. Proc. of FOCS 86.
S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM J. Computing, Vol.18, pp.186–208, 1989.
Impagliazzo and Yung: Direct Minimum-Knowledge Computations, Crypto 87.
Naor, Ostrovsky, Venkatesan and Yung: Zero-Knowledge Arguments for NP can be based on General Complexity Assumptions, Proc. of Crypto 92, Springer Verlag LNCS series.
Ostrovsky, Venkatesan and Yung: Interactive Hashing Simplifies Zero-Knowledge Protocol Design, to appear in Proc. of EuroCrypt 93, Springer Verlag LNCS Series.
Ostrovsky and Wigderson: One-way functions are essntial for non-trivial zero-knowledge proofs, preliminary manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damgård, I.B. (1994). Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive