Responsive round complexity and concurrent zero-knowledge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2248, Issue , 2001, Pages 422-441

  Cohen, Tzafrir ^a   Kilian, Joe ^b   Petrank, Erez ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Yianilos Labs   (United States)

Author keywords

Concurrent zero knowledge; Cryptographic protocols; Zero knowledge

Indexed keywords

SECURITY OF DATA;

COMMUNICATION ROUNDS; COMMUNICATION TIME; COMPLEXITY MEASURES; CRYPTOGRAPHIC PROTOCOLS; ROUND COMPLEXITY; ZERO KNOWLEDGE; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

CRYPTOGRAPHY;

EID: 35248865962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_25     Document Type: Conference Paper

References (25)

1. Boaz Barak: How to Go Beyond The Black-Box Simulation Barrier. To appear in IEEE, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, October, 2001.
2. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. JCSS 37 (1988) 156–189
3. Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. Record 99-22, Theory of Cryptography Library (1999) received October 25th, 1999. Supercedes Theory of Cryptography Library Record 99-15.
4. Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In ACM, ed.: Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21–23, [2000], New York, NY, USA, ACM Press (2000) 235–244 see also [3].
5. Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Concurrent zero-knowledge requires ˜Ω (log n) rounds. In: Proceedings of the thirty third annual ACM Symposium on Theory of Computing, ACM Press (2001)
6. Crescenzo, G.D., Ostrovsky, R.: On concurrent zero-knowledge with preprocessing. In Wiener, M., ed.: Advances in Cryptology – CRYPTO’ 99. Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, Berlin Germany (1999) 485–502
7. Damgård, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In Preneel, B., ed.: Advances in Cryptology – EUROCRYPT’ 2000. Lecture Notes in Computer Science, Brugge, Belgium, Springer-Verlag, Berlin Germany (2000) 418–430
8. Damgård Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In Stinson, D.R., ed.: Proc. CRYPTO 93, Springer (1994) 250–265 Lecture Notes in Computer Science No. 773.
9. Dwork, C., Naor, M.: Zaps and their applications. In IEEE, ed.: Proceedings of the 41st Annual Symposium on Foundations of Computer Science: proceedings: 12–14 November, 2000, Redondo Beach, California, IEEE Computer Society Press (2000) 283–293
10. Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In ACM, ed.: Proceedings of the thirtieth annual ACM Symposium on Theory of Computing: Dallas, Texas, May 23–26, 1998, New York, NY, USA, ACM Press (1998) 409–418
11. Dwork, C., Sahai, A.: Concurrent zero-knowledge: Reducing the need for timing constraints. Lecture Notes in Computer Science 1462 (1998) 442–457
12. Feige, U.: Alternative models for zero knowledge interactive proofs. PhD thesis, Weizmann Institute of science (1990)
13. Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In ACM, ed.: Proceedings of the twenty-second annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 14–16, 1990, New York, NY, USA, ACM Press (1990) 416–426
14. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology: the journal of the International Association for Cryptologic Research 9 (1996) 167–189
15. Goldreich, O., Krawczyk, H.: On the composition of Zero-Knowledge Proof systems. SICOMP 25 (1996) 169–192
16. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive systems. SIAM Journal of Computing 18 (1989) 186–208
17. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: ACM Symposium on Theory of Computing (STOC’85), Baltimore, USA, ACM Press (1985) 291–304
18. Kilian, J., Petrank, E.: Concurrent zero-knowledge in poly-logarithmic rounds. In: Proceedings of the thirty third annual ACM Symposium on Theory of Computing, ACM Press (2001)
19. Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the Internet. In IEEE, ed.: 39th Annual Symposium on Foundations of Computer Science: proceedings: November 8–11, 1998, Palo Alto, California, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, IEEE Computer Society Press (1998) 484–492
20. Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4 (1991) 151–158
21. Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21th Annual Symposium on Theory of Computing (STOC), ACM Press (1988) 33–43
22. Goldreich, O.: Foundation of cryptography — fragments of a book. Available from the Electronic Colloquium on Computational Complexity (ECCC) http://www.eccc.uni-trier.de/eccc/, February 1995. (1995)
23. Oren, Y.: On the cunning powers of cheating verifiers: Some observations about zero knowledge proofs. In Chandra, A.K., ed.: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, IEEE Computer Society Press (1987) 462–471
24. Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. Lecture Notes in Computer Science 1592 (1999) 415–431
25. Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: CRYPTO: Proceedings of Crypto. (2000)