Abstract
We show that, assuming the existence of collision-resistant hash functions, every language in NP has a constant-round public-coin zero-knowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak’s zero-knowledge argument (FOCS 2001), and has a non-black-box simulator. This result stands in sharp contrast with the recent result by Pass, Tseng and Wikstrom (Crypto 2010) showing that only languages in BPP have public-coin parallel zero-knowledge arguments with black-box simulators.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
B. Barak, How to go beyond the black-box simulation barrier, in FOCS ’01 (2001), pp. 106–115
B. Barak, O. Goldreich, Universal arguments and their applications, in Computational Complexity (2002), pp. 162–171
M. Blum, How to prove a theorem so no one else can claim it, in Proc. of the International Congress of Mathematicians (1986), pp. 1444–1451
C. Dwork, M. Naor, A. Sahai, Concurrent zero-knowledge. J. ACM 51(6), 851–898 (2004)
U. Feige, A. Shamir, Witness indistinguishable and witness hiding protocols, in STOC ’90 (1990), pp. 416–426
O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167–190 (1996)
O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169–192 (1996)
S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)
O. Goldreich, Foundations of Cryptography—Basic Tools. Cambridge University Press, Cambridge (2001)
O. Goldreich, Concurrent zero-knowledge with timing, revisited, in STOC ’02 (2002), pp. 332–340
O. Goldreich, Y. Oren, Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7, 1–32 (1994)
O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691–729 (1991)
J. Håstad, R. Impagliazzo, L. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 12–24 (1999)
J. Kilian, E. Petrank, Concurrent and resettable zero-knowledge in poly-loalgorithm rounds, in STOC ’01 (2001), pp. 560–569
S. Micali, Computationally sound proofs. SIAM J. Comput. 30(4), 1253–1298 (2000)
M. Naor, Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151–158 (1991)
R. Pass, A. Rosen, New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput. 38(2), 702–752 (2008)
R. Pass, W.-L.D. Tseng, D. Wikström, On the composition of public-coin zero-knowledge protocols, in CRYPTO ’09 (2009), pp. 160–176
M. Prabhakaran, A. Rosen, A. Sahai, Concurrent zero knowledge with logarithmic round-complexity, in FOCS ’02 (2002), pp. 366–375
R. Richardson, J. Kilian, On the concurrent composition of zero-knowledge proofs, in Eurocrypt ’99 (1999), pp. 415–432
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ran Canetti.
R. Pass’s work is supported in part by a Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF CAREER Award CCF-0746990, AFOSR Award FA9550-08-1-0197, BSF Grant 2006317.
A. Rosen’s work is supported in part by BSF grant No. 2006317.
W.-L.D. Tseng’s work is supported in part by a NSF graduate research fellowship.
Rights and permissions
About this article
Cite this article
Pass, R., Rosen, A. & Tseng, WL.D. Public-Coin Parallel Zero-Knowledge for NP. J Cryptol 26, 1–10 (2013). https://doi.org/10.1007/s00145-011-9110-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-011-9110-5