Abstract
We fill a gap in the theory of zero-knowledge protocols by presenting NP-arguments that achieve negligible error probability and computational zero-knowledge in four rounds of interaction, assuming only the existence of a one-way function. This result is optimal in the sense that four rounds and a one-way function are each individually necessary to achieve a negligible error zero-knowledge argument for NP.
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
M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. Advances in Cryptology — Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.
M. Bellare, S. Micali and R. Ostrovsky. Perfect Zero-Knowledge in Constant Rounds. Proceedings of the 22nd Annual Symposium on the Theory of Computing, ACM, 1990.
M. Bellare, S. Micali and R. Ostrovsky. The true complexity of statistical zero-Knowledge. Proceedings of the 22nd Annual Symposium on the Theory of Computing, ACM, 1990.
M. Bellare and M. Yung. Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation. Journal of Cryptology, Vol. 9, No. 1, pp. 149–166, Winter 1996.
M. Blum. Coin Flipping over the Telephone. IEEE COMPCON 1982, pp. 133–137.
M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-Interactive Zero-Knowledge Proof Systems. SIAM Journal on Computing, Vol. 20, No. 6, December 1991, pp. 1084–1118.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, Vol. 13, No. 4, pp. 850–864, November 1984.
G. Brassard and C. Crépeau. Non-transitive Transfer of Confidence: A perfect Zero-knowledge Interactive protocol for SAT and Beyond. Proceedings of the 27th Symposium on Foundations of Computer Science, IEEE, 1986.
G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. J. Computer and System Sciences, Vol. 37, 1988, pp. 156–189.
G. Brassard, C. Crépeau and M. Yung. Constant round perfect zero knowledge computationally convincing protocols. Theoretical Computer Science, Vol. 84, No. 1, 1991.
U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, Vol. 1, 1988, pp. 77–94.
U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. Proceedings of the 31st Symposium on Foundations of Computer Science, IEEE, 1990.
U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. Proceedings of the 22nd Annual Symposium on the Theory of Computing, ACM, 1990.
L. Fortnow. The Complexity of Perfect Zero-Knowledge. In Advances in Computing Research, Ed. S. Micali, Vol. 18, 1989.
O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology, Vol. 9, No. 3, 1996, pp. 167–190.
O. Goldreich and H. Krawczyk. On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing, Vol. 25, No. 1, pp. 169–192, 1996.
O. Goldreich, S. Micali and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero knowledge proof systems. Journal of the Association for Computing Machinery, Vol. 38, No. 1, July 1991.
O. Goldreich and Y. Oren. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, Vol. 7, No. 1, 1994, pp. 1–32.
S. Goldwasser and S. Micali. Probabilistic Encryption. J. Computer and System Sciences, Vol. 28, 1984, pp. 270–299.
S. Goldwasser, S. Micali and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. on Computing, Vol. 18, No. 1, pp. 186–208, February 1989.
J. Håstad, R. Impagliazzo, L. Levin and M. Luby. Construction of a pseudo-random generator from any one-way function. Mansucript. Earlier versions in STOC 89 and STOC 90.
R. Impagliazzo and M. Luby. One-way Functions are Essential for Complexity-Based Cryptography. Proceedings of the 30th Symposium on Foundations of Computer Science, IEEE, 1989.
R. Impagliazzo and M. Yung. Direct Minimum-Knowledge Computations. Advances in Cryptology — Crypto 87 Proceedings, Lecture Notes in Computer Science Vol. 293, C. Pomerance ed., Springer-Verlag, 1987.
T. Itoh and K. Sakurai. On the complexity of constant round ZKIP of possession of knowledge. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E76-A, No. 1, January 1993.
M. Naor. Bit Commitment using Pseudo-Randomness. Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
M. Naor, R. Ostrovsky, R. Venkatasan, M. Yung. Perfect zero knowledge arguments for NP can be based on general complexity assumptions. Advances in Cryptology — Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.
R. Ostrovsky and A. Wigderson. One-way functions are essential for non-trivial zero-knowledge. Proceedings of the Second Israel Symposium on Theory and Computing Systems, IEEE, 1993.
M. Tompa and H. Woll. Random Self-Reducibility and Zero-Knowledge Interactive-Proofs of Possession of Information. Proceedings of the 28th Symposium on Foundations of Computer Science, IEEE, 1987.
A. C. Yao. Theory and Applications of Trapdoor functions. Proceedings of the 23rd Symposium on Foundations of Computer Science, IEEE, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Jakobsson, M., Yung, M. (1997). Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive