Abstract
It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are non-constant-round. Whether there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open problem. This paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round (black-box) zero-knowledge proofs of knowledge for the HC (hamiltonian cycle) problem. By the recent result of Katz, our second construction which relies on the existence of claw-free functions has optimal round complexity (5-round) assuming the polynomial hierarchy does not collapse.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof systems. SIAM J Comput, 1989, 18: 186–208
Goldreich O, Micali S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zeroknowledge proof systems. J ACM, 1991, 38: 691–729
Bellare M, Goldreich O. On defining proofs of knowledge. LNCS, 1992, 740: 390–420
Goldreich O. Foundations of Cryptography-Basic Tools. Cambridge: Cambridge University Press, 2001
Bellare M, Jakobsson M, Yung M. Round-optimal zero-knowledge arguments base on any one-way function. LNCS, 1997, 1233: 280–305
Feige U, Shamir A. Zero knowledge proofs of knowledge in two rounds. In: Proceedings of CRYPTO’89. Berlin: Springer-Verlag, 1989. 526–545
Barak B, Lindell Y. Strict polynomial-time in simulation and extraction. SIAM J Comput, 2004, 33: 783–818
Goldreich O, Oren Y. Definitions and properties of zero-knowledge proof systems. J Cryptol, 1994, 7: 1–32
Barak B, Lindell Y, Vadhan S. Lower bounds for non-black-box zero knowledge. J Comput Syst Sci, 2006, 72: 321–391
Goldreich O, Krawczyk H. On the composition of zero-knowledge proof systems. SIAM J Comput, 1996, 25: 169–192
Toshiya I, Kouichi S. On the complexity of constant round ZKIP of possession of knowledge. IEICE Trans Fund, 1993, E76-A: 31–39
Katz J. Which languages have 4-round zero-knowledge proofs. LNCS, 2008, 4948: 73–88
Goldreich O, Kahan A. How to construct constant-round zero-knowledge proof system for NP. J Cryptol, 1996, 9: 167–189
Rosen A. A note on constant-round zero-knowledge proofs for NP. LNCS, 2004, 2951: 191–202
Dodis Y, Reyzin L. On the power of claw-free permutations. LNCS, 2003, 2576: 55–73
Blum M. How to prove a theorem so no one else can claim it. In: Andrew M, Gleason, eds. Proceedings of the International Congress of Mathematicians. California: American Mathematical Society, 1986. 1444–1451
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, H., Feng, D., Li, B. et al. Round-optimal zero-knowledge proofs of knowledge for NP. Sci. China Inf. Sci. 55, 2473–2484 (2012). https://doi.org/10.1007/s11432-011-4379-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-011-4379-4