Min-round resettable zero-knowledge in the public-key model

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

Volumn 2045, Issue , 2001, Pages 373-393

  Micali, Silvio ^a   Reyzin, Leonid ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

POLYNOMIAL NUMBER; PUBLIC KEYS; PUBLIC-KEY MODEL; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 84945120267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44987-6_23     Document Type: Conference Paper

References (28)

1. G. Brassard, D. Chaum, and C. Crepeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2):156–189, 1988.
2. M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zeroknowledge. SIAM Journal on Computing, 20(6):1084–1118, December 1991.
3. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 103-112, 1988.
4. G. Brassard, editor. Advances in Cryptology—CRYPTO ’89, volume 435 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
5. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable zeroknowledge. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000. Updated version available at the Cryptology ePrint Archive, record 1999/022, http://eprint.iacr.org/.
6. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Black-box concurrent zero-knowledge requires Ω(log n) rounds. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 6–8 July 2001.
7. I. Damgard. Efficient concurrent zero-knowledge in the auxiliary string model. In Bart Preneel, ed., Advances in Cryptology—EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, Springer-Verlag, 2000.
8. A. De Santis, G. Di Crescenzo, and G. Persiano. Necessary and sufficient assumptions for non-interactive zero-knowledge proofs of knowledge for all np relations. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Automata Languages and Programming: 27th International Colloquim (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 451–462. Springer-Verlag, July 9–15 2000.
9. C. Dwork, M. Naor, and A. Sahai. Concurrent zero knowledge. In 30th Annual ACM Symposium on Theory of Computing, 1998.
10. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd Annual Symposium on Foundations of Computer Science, 1992.
11. I. B. Damgard, T. P. Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. Journal of Cryptology, 10(3):163–194, Summer 1997.
12. C. Dwork and A. Sahai. Concurrent zero-knowledge: Reducing the need for timing constraints. In H. Krawczyk, ed., Advances in Cryptology—CRYPTO ’98, volume 1462 of Lecture Notes in Computer Science, 1998.
13. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1):1–28, 1999.
14. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In Brassard [Bra89], pages 526-545.
15. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, October 1986.
16. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal on Computing, 25(1):169–192, February 1996.
17. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281–308, April 1988.
18. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18:186–208, 1989.
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. Journal of the ACM, 38(1):691–729, 1991.
20. J. Hastad, R. Impagliazzo, L.A. Levin, and M. Luby. Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364–1396, 1999.
21. S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In Neal Koblitz, editor, Advances in Cryptology—CRYPTO ’96, volume 1109of Lecture Notes in Computer Science, pages 201-215. Springer-Verlag, 18–22 August 1996.
22. J. Kilian and E. Petrank. Concurrent zero-knowledge in polylogarithmic rounds. Technical Report 2000/013, Cryptology ePrint Archive, http://eprint.iacr.org, 2000.
23. J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero-knowledge on the Internet. In 39th Annual Symposium on Foundations of Computer Science, pages 484-492, Los Alamitos, California, November 1998. IEEE.
24. R. C. Merkle. A certified digital signature. In Brassard [Bra89], pages 218-238.
25. Silvio Micali. CS proofs. SIAM Journal on Computing, to appear.
26. S. Micali and L. Reyzin. Soundness in the public-key model. Unpublished manuscript, 2001.
27. Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458-467, Miami Beach, Florida, 20–22 October 1997. IEEE.
28. R. Richardson and J. Kilian. On the concurrent composition of zeroknowledge proofs. In Jacques Stern, editor, Advances in Cryptology-EUROCRYPT ’99, volume 1592 of Lecture Notes in Computer Science, pages 415-431. Springer-Verlag, 2–6 May 1999.