Abstract
Constant-round zero-knowledge proof systems for every language in \(\mathcal{N}\mathcal{P}\) are presented, assuming the existence of a collection of claw-free functions. In particular, it follows that such proof systems exist assuming the intractability of either the Discrete Logarithm Problem or the Factoring Problem for Blum integers.
Article PDF
Similar content being viewed by others
References
M. Blum, Coin Flipping by Phone, Sigact News, Vol. 15, No. 1, 1983.
M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Its Applications, Proc. 20th STOC,pp. 103–112, 1988.
J. Boyar, M. Krentel, and S. Kurtz, A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs, J. Cryptology, Vol. 2, pp. 63–76, 1990.
G. Brassard, D. Chaum, and C. Crépeau, Minimum Disclosure Proofs of Knowledge, J. Comput. System Sci., Vol. 37, No. 2, pp. 156–189, 1988.
G. Brassard, C. Crépeau, and M. Yung, Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols, Theoret. Comput. Sci., Vol. 84, pp. 23–52, 1991.
U. Feige and A. Shamir, Zero-Knowledge Proofs of Knowledge in Two Rounds, Advance in Cryptology—Crypto 89 (Proceedings), pp. 526–544, 1990.
O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, J. Cryptology, Vol. 6, pp. 21–53, 1993.
O. Goldreich and H. Krawcyzk, On the Composition of Zero-Knowledge Proof Systems, SIAM J. Comput., Vol. 25, No. 1, pp. 169–192, 1996.
O. Goldreich and L. A. Levin, Hard-Core Predicates for Any One-Way Function, Proc. 21st STOC, pp. 25–32, 1989.
O. Goldreich, S. Micali, and A. Wigderson, Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, J. Assoc. Comput. Mach., Vol. 38, No. 1, pp. 691–729, 1991.
S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput., Vol. 18, No. 1, pp. 186–208, 1989.
S. Goldwasser, S. Micali, and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks, SIAM J. Comput., Vol. 17, No. 2, pp. 281–308, 1988.
J. Hastad, Pseudorandom Generators Under Uniform Assumptions, Proc. 22nd STOC, pp. 395–404, 1990.
R. Impagliazzo, L. A. Levin, and M. Luby, Pseudorandom Generation from One-Way Functions, Proc. 21st STOC, pp. 12–24, 1989.
J. Kilian, A Note on Efficient Zero-Knowledge Proofs and Arguments, Proc. 24th STOC, pp. 723–732, 1992.
J. Kilian, On the Complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs, Proc. 35th FOCS, pp. 466–477, 1994.
M. Naor, Bit Commitment Using Pseudorandomness, J. Cryptology, Vol. 4, pp. 151–158, 1991.
Author information
Authors and Affiliations
Additional information
Communicated by Gilles Brassard
Rights and permissions
About this article
Cite this article
Goldreich, O., Kahan, A. How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology 9, 167–189 (1996). https://doi.org/10.1007/BF00208001
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00208001