Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 1-47

  Canetti, Ran ^a   Kilian, Joe ^b   Petrank, Erez ^c   Rosen, Alon ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Yianilos Labs   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Concurrent zero knowledge; Cryptography; Interactive protocols; Lower bounds; Round complexity; Zero knowledge

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRYPTOGRAPHY; NETWORK PROTOCOLS; POLYNOMIALS;

BLACK-BOX CONCURRENT ZERO-KNOWLEDGE; BLACK-BOX SIMULATION; ZERO-KNOWLEDGE PROOF-SYSTEMS;

THEOREM PROVING;

EID: 0037605775     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701392949     Document Type: Article

References (29)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
2. B. Barak, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 106-115.
3. M. Bellare, R. Impagliazzo, and M. Naor, Does parallel repetition lower the error in computationally sound protocols?, in Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997, pp. 374-383.
4. M. Bellare, S. Micali, and R. Ostrovsky, Perfect zero-knowledge in constant rounds, in Proceedings of the 22nd ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 482-493.
5. C. Brassard, D. Chaum, and C. Crépeau, Minimum disclosure proofs of knowledge, J. Comput. System Sci., 37 (1988), pp.156-189.
6. G. Brassard, C. Crépeau, and M. Yung, Constant-round perfect zero-knowledge computationally convincing protocols, Theoret. Comput. Sci., 84 (1991), pp. 23-52.
7. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali, Resettable zero-knowledge, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 235-244.
8. R. Canetti, J. Kilian, E. Petrank, and A. Rosen, Black-box concurrent zero-knowledge requires Ω̃(log n) rounds, in Proceedings of the 33rd ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 570-579.
9. M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, J. Comput. System Sci., 22 (1981), pp. 265-279.
10. B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
11. I. Damgård, Efficient concurrent zero-knowledge in the auxiliary string model, in EuroCrypt2000, Lecture Notes in Comput. Sci. 1807, Springer-Verlag, New York, 2000, pp. 418-430.
12. C. Dwork, M. Naor, and A. Sahai, Concurrent zero-knowledge, in Proceedings of the 30th ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 409-418.
13. C. Dwork and A. Sahai, Concurrent zero-knowledge: Reducing the need for timing constraints, in Crypto98, Lecture Notes in Comput. Sci. 1462, Springer-Verlag, New York, 1998, pp. 442-457.
14. U. Feige, Alternative Models For Zero-Knowledge Interactive Proofs, Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel, 1990.
15. U. Feige and A. Shamir, Witness indistinguishability and witness hiding protocols, in Proceedings of the 22nd ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 416-426.
16. O. Goldreich, Foundations of Cryptography - Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
17. O. Goldreich and A. Kahan, How to construct constant-round zero-knowledge proof systems for NP, J. Cryptology, 9 (1996), pp. 167-189.
18. O. Goldreich and H. Krawczyk, On the composition of zero-knowledge proof systems, SIAM J. Comput., 25 (1996), pp. 169-192.
19. 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. ACM, 38 (1991), pp. 691-729.
20. O. Goldreich and Y. Oren, Definitions and properties of zero-knowledge proof systems, J. Cryptology, 7 (1994), pp. 1-32.
21. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput., 18 (1989), pp. 186-208.
22. S. Hada and T. Tanaka, On the existence of 3-round zero-knowledge protocols, in Crypto98, Lecture Notes in Comput. Sci. 1462, Springer-Verlag, New York, pp. 408-423.
23. J. Hastad, R. Impagliazzo, L.A. Levin, and M. Luby, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
24. A. Joffe, On a set of almost deterministic γ-independent random variables, Ann. Probab., 2 (1974), pp. 161-162.
25. J. Kilian and E. Petrank, Concurrent and resettable zero-knowledge in poly-logarithmic rounds, in Proceedings of the 33rd ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 560-569.
26. J. Kilian, E. Petrank, and C. Rackoff, Lower bounds for zero-knowledge on the internet, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 484-492.
27. M. Naor, Bit commitment using pseudorandomness, J. Cryptology, 4 (1991), pp. 151-158.
28. R. Richardson and J. Kilian, On the concurrent composition of zero-knowledge proofs, in EuroCrypt99, Lecture Notes in Comput. Sci. 1592, Springer-Verlag, New York, 1999, pp. 415-431.
29. A. Rosen, A note on the round-complexity of concurrent zero-knowledge, in Crypto2000, Lecture Notes in Comput. Sci. 1880, Springer-Verlag, New York, 2000, pp. 451-468.