Efficient zero-knowledge proofs of knowledge without intractability assumptions

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

Volumn 1751, Issue , 2000, Pages 354-373

  Cramer, Ronald ^a   Damgård, Ivan ^b   Mackenzie, Philip ^c  

^a ETH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CHROMIUM COMPOUNDS;

DISCRETE LOGARITHMS; MONOTONE FUNCTIONS; ONE-WAY GROUP HOMOMORPHISMS; PERFECT ZERO-KNOWLEDGE; ZERO KNOWLEDGE; ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84957802212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46588-1_24     Document Type: Conference Paper

References (26)

1. Mihir Bellare and Oded Goldreich. On defining proofs of knowledge. In Advances in Cryptology—CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 390-420. Springer-Verlag, 1993, 16-20 August 1992.
2. László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, and Avi Wigderson. Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 603-611, Philadelphia, Pennsylvania, 22-24 May 1996.
3. BJY97. M. Bellare, M. Jakobsson, and M. Yung. Round-optimal zero-knowledge arguments based on any one-way function. In Advances in Cryptology— EUROCRYPT 97, volume 1233 of Lecture Notes in Computer Science, pages 280-305. Springer-Verlag, 1997.
4. Mihir Bellare, Silvio Micali, and Rafail Ostrovsky. Perfect zero-knowledge in constant rounds. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 482-493, Baltimore, Maryland, 14-16 May 1990.
5. R. Cramer and I. Damgård. Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? In Hugo Krawczyk, editor, Advances in Cryptology—CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 424-441. Springer-Verlag, 17-21 August 1998.
6. Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology—CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer-Verlag, 21-25 August 1994.
7. R. Cramer. Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, CWI & Univ. of Amsterdam, November 1996.
8. Advances in Cryptology—CRYPTO '89, volume 435 of Lecture Notes in Computer Science. Springer-Verlag, 1990, 20-24 August 1989.
9. Advances in Cryptology—CRYPTO '93, volume 773 of Lecture Notes in Computer Science. Springer-Verlag, 22-26 August 1993.
10. Ivan Bjerre Damgård. On the existence of bit commitment schemes and zero-knowledge proofs. In CRYPTO'89 [CRY89], pages 17-27.
11. Ivan B. Damgård. Interactive hashing can simplify zero-knowledge protocol design without computational assumptions (extended abstract). In CRYPTO'93 [CRY93], pages 100-109.
12. I. Damgård and B. Pfitzmann. Sequential iteration of interactive arguments. journal version of ICALP'98 paper.
13. Y. Frankel, P. D. MacKenzie, and M. Yung. Robust efficient distributed rsa-key generation. In STOC'98 [STO98], pages 663-672.
14. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In CRYPTO'89 [CRY89], pages 526-545.
15. Oded Goldreich and Ariel Kahan. How to construct constant-round zero-knowledge proof systems for np. Journal of Cryptology, 9(3):167-189, Summer 1996.
16. GK96b. Oded Goldreich and Hugo Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal on Computing, 25(1):169-192, February 1996.
17. Gol95. Oded Goldreich. Foundations of cryptography (fragments of a book), February 1995.
18. GQ88. Louis Claude Guillou and Jean-Jacques Quisquater. A “paradoxical” indentity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology—CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 216-231. Springer-Verlag, 1990, 21-25 August 1988.
19. GRR98. R. Genarro, M. O. Rabin, and Tal Rabin. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pages -, 1998.
20. O. Goldreich, Amit Sahai, and Salil Vadhan. Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In STOC'98 [STO98], pages 399-408.
21. M. Karchmer and A. Wigderson. Characterizing non-deterministic circuit size. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 532-540, San Diego, California, 16-18 May 1993.
22. C. P. Schnorr. Efficient identification and signatures for smart cards. In CRYPTO'89 [CRY89], pages 239-252.
23. A. De Santis, G. Di Crescenzo, and G. Persiano. Secret sharing and perfect zero knowledge. In CRYPTO'93 [CRY93], pages 73-84.
24. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, and Moti Yung. On monotone formula closure of SZK. In 35th Annual Symposium on Foundations of Computer Science, pages 454-465, Santa Fe, New Mexico, 20-22 November 1994. IEEE.
25. SKS91. Takeshi Saito, Kaoru Kurosawa, and Kouichi Sakurai. 4 Move perfect ZKIP of knowledge with no assumption. In Hideki Imai, Ronald L. Rivest, and Tsutomu Matsumoto, editors, Advances in Cryptology—ASIACRYPT '91, volume 739 of Lecture Notes in Computer Science, pages 321-330, Fujiyoshida, Japan, 11-14 November 1991. Springer-Verlag. Published 1993.
26. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, Texas, 23-26 May 1998.