Round-optimal zero-knowledge proofs of knowledge for NP

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.

[1]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[2]  Yehuda Lindell,et al.  Strict polynomial-time in simulation and extraction , 2002, STOC '02.

[3]  Oded Goldreich,et al.  Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.

[4]  Moti Yung,et al.  Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols , 1991, Theor. Comput. Sci..

[5]  Moni Naor,et al.  On Cryptographic Assumptions and Challenges , 2003, CRYPTO.

[6]  Alon Rosen,et al.  A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.

[7]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[8]  Manuel Blum,et al.  How to Prove a Theorem So No One Else Can Claim It , 2010 .

[9]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[10]  Hugo Krawczyk,et al.  On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.

[11]  Mihir Bellare,et al.  On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge , 2006, IACR Cryptol. ePrint Arch..

[12]  Oded Goldreich.  Foundations of Cryptography: Index , 2001 .

[13]  Markus Jakobsson,et al.  Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function , 1997, EUROCRYPT.

[14]  Yehuda Lindell,et al.  Lower bounds for non-black-box zero knowledge , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[15]  Boaz Barak,et al.  Non-black-box Techniques in Cryptography , 2006, CSR.

[16]  Kouichi Sakurai,et al.  On the Complexity of Constant Round ZKIP of Possession of Knowledge , 1991, ASIACRYPT.

[17]  Yevgeniy Dodis,et al.  On the Power of Claw-Free Permutations , 2002, SCN.

[18]  Li HongDa,et al.  Existence of 3-round zero-knowledge proof systems for NP , 2008 .

[19]  Oded Goldreich,et al.  How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.

[20]  Jonathan Katz.  Which Languages Have 4-Round Zero-Knowledge Proofs? , 2008, TCC.

[21]  Mihir Bellare,et al.  On Defining Proofs of Knowledge , 1992, CRYPTO.

[22]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[23]  Adi Shamir,et al.  Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.

[24]  Boaz Barak,et al.  How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.