Concurrent zero knowledge with logarithmic round-complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 366-375

  Prabhakaran, Manoj ^a   Rosen, Alon ^b   Sahai, Amit ^a  

^a PRINCETON UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LANGUAGES; RANDOM PROCESSES; THEOREM PROVING;

CONCURRENT ZERO KNOWLEDGE; LOGARITHMIC ROUND-COMPLEXITY;

NETWORK PROTOCOLS;

EID: 0036957024     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. B. Barak. How to go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. M. Blum. How to prove a Theorem So No One Else Can Claim It. Proc. of the International Congress of Mathematicians, Berkeley, California, USA, pages 1444-1451, 1986.
3. G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988.
4. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resetable Zero-Knowledge. In 32nd STOC, pages 235-244, 2000.
5. R. Canetti, J. Kilian, E. Petrank and A. Rosen, Black-Box Concurrent Zero-Knowledge Requires Ω̃(log n) Rounds. In 33rd STOC, pages 570-579 2001.
6. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
7. C. Dwork, and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Crypto98, Springer LNCS 1462, pages 442-457, 1998.
8. U. Feige. Ph.D. thesis, Alternative Models for Zero Knowledge Interactive Proofs. Weizmann Institute of Science, 1990.
9. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416-426, 1990.
10. O. Goldreich. Concurrent Zero-Knowledge with Timing - Revisited. To appear, in 34th STOC, 2002.
11. O. Goldreich. Foundation of Cryptography - Basic Tools. Cambridge University Press, 2001.
12. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. Computing, Vol. 25, No. 1, pages 169-192, 1996.
13. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38, No. 1, pp. 691-729, 1991.
14. 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.
15. S. Goldwasser, S. Micali and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM J. Comput., Vol. 17, No. 2, pp. 281-308, 1988.
16. J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. SIAM Jour. on Computing, Vol. 28 (4), pages 1364-1396, 1999.
17. J. Kilian. Personal Communication
18. J. Kilian and E. Petrank. Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds. In 33rd STOC, pages 560-569, 2001.
19. J. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
20. M. Naor. Bit Commitment using Pseudorandomness. Jour. of Cryptology, Vol. 4, pages 151-158, 1991.
21. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt99, Springer LNCS 1592, pages 415-431, 1999.
22. A. Rosen. A note on the round-complexity of Concurrent Zero-Knowledge. In Crypto2000, Springer LNCS 1880, pages 451-468, 2000.