Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model

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

Volumn 3152, Issue , 2004, Pages 237-253

  Di Crescenzo, Giovanni ^a   Persiano, Giuseppe ^c   Visconti, Ivan ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

ARGUMENT SYSTEMS; BLACK BOXES; CLASSICAL MODEL; ONE-TIME; PUBLIC KEYS; PUBLIC-KEY MODEL; THE STANDARD MODEL; ZERO KNOWLEDGE;

ARTIFICIAL INTELLIGENCE;

EID: 26444467380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_15     Document Type: Article

References (19)

1. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM J. on Computing 18 (1989) 185-208
2. Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC '98), 409-418
3. Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC '00), 235-244
4. Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent ZeroKnowledge Requires w (log n) Rounds. In: Proceedings of the 33st ACM Symposium on Theory of Computing (STOC '01), 570-579
5. Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proceeding of the 42nd Symposium on Foundations of Computer Science, (FOCS '01), 106-115
6. Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-Interactive Zero-Knowledge. SIAM J. on Computing 20 (1991) 1084-1118
7. Micali, S., Reyzin, L.: Soundness in the Public-Key Model. In: Advances in Cryptology - Crypto '01. Volume 2139 of Lecture Notes in Computer Science. Springer-Verlag, 542-565
8. Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-Sound ZeroZnowledge and its Applications. In: Proceeding of the 42nd Symposium on Foundations of Computer Science, (FOGS '01), 116-125
9. Micali, S., Reyzin, L.: Min-round Resettable Zero-Knowledge in the Public-key Model. In: Advances in Cryptology - Eurocrypt '01. Volume 2045 of Lecture Notes in Computer Science. Springer-Verlag (2001) 373-393
10. Zhao, Y., Deng, X., Lee, C., Zhu, H.: Resettable Zero-Knowledge in the Weak Public-Key Model. In: Advances in Cryptology - Eurocrypt '03. Volume 2045 of Lecture Notes in Computer Science. Springer-Verlag (2003) 123-139
11. Goldreich, O.: Concurrent Zero-Knowledge with Timing, Revisited. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC '02), ACM (2002) 332-340
12. Di Crescenzo, G., Ostrovsky, R.: On Concurrent Zero-Knowledge with Preprocessing. In: Advances in Cryptology - Crypto '99. Volume 1666 of Lecture Notes in Computer Science. Springer-Verlag (1999) 485-502
13. Damgard, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Advances in Cryptology - Eurocrypt '00. Volume 1807 of Lecture Notes in Computer Science. Springer-Verlag (2000) 418-430
14. Goldwasser, S., Micali, S.: Probabilistic encryption. J. of Comp. and Sys. Sei. 28 (1984) 270-299
15. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Advances in Cryptology - Crypto '84. Volume 196 of Lecture Notes in Computer Science. Springer Verlag (1984) 10-18
16. Feige, U., Lapidot, D., Shamir, A.: Multiple Non-Interactive Zero Knowledge Proofs Under General Assumptions. SIAM J. on Computing 29 (1999) 1-28
17. Pass, R.: Simulation in Quasi-Polynomial Time and Its Applications to Protocol Composition. In: Advances in Cryptology - Eurocrypt '03. Volume 2045 of Lecture Notes in Computer Science. Springer-Verlag (2003) 160-176
18. Rompel, J.: One-Way Functions are Necessary and Sufficient for Digital Signatures. In: Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC '90). (1990) 12-19
19. Dwork, C., Naor, M.: Zaps and their applications. In: IEEE Symposium on Foundations of Computer Science. (2000) 283-293