The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols

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

Volumn 3152, Issue , 2004, Pages 273-289

  Bellare, Mihir ^a   Palacio, Adriana ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

STANDARD ASSUMPTIONS; ZERO KNOWLEDGE; ZERO-KNOWLEDGE PROTOCOLS;

CRIME;

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

References (16)

1. B. BARAK. How to go beyond the black-box simulation barrier. Proceedings of the 42nd Symposium on Foundations of Computer Science, IEEE, 2001.
2. M. BELLARE. A note on negligible functions. Journal of Cryptology, Vol. 15, No. 4, pp. 271-284, June 2002.
3. M. BELLARE AND S. MICALI. Non-interactive oblivious transfer and applications. Advances in Cryptology - CRYPTO '89, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
4. M. BELLARE AND A. PALACIO. The Knowledge-of-Exponent assumptions and 3-round zero-knowledge protocols. Full version of the current paper, available via http://www-cse.ucsd.edu/users/mihir.
5. M. BLUM. How to prove a theorem so no one else can claim it. Proceedings of the International Congress of Mathematicians, pp. 1444-1451, 1986.
6. G. BRASSARD, D. CHAUM AND G. CRÉPEAU. Minimum disclosure proofs of knowledge. J. Computer and System Sciences, Vol. 37, No. 2, pp. 156-189, October 1988.
7. I. DAMGÅRD. Towards practical public-key cryptosystems provably-secure against chosen-ciphertext attacks. Advances in Cryptology - CRYPTO '91, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991.
8. A. FIAT AND A. SHAMIR. How to prove yourself: Practical solutions to identification and signature problems. Advances in Cryptology - CRYPTO '86, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
9. O. GOLDREICH AND H. KRAWCZYK. On the Composition of Zero Knowledge Proof Systems. SIAM J. on Computing, Vol. 25, No. 1, pp. 169-192, 1996.
10. S. GOLDWASSER, S. MICALI AND C. RACKOFF. The knowledge complexity of interactive proof systems. SIAM Journal of Computing, Vol. 18, No. 1, pp. 186-208, February 1989.
11. S. HADA AND T. TANAKA. On the existence of 3-round zero-knowledge protocols. Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998. [Preliminary version of [12].]
12. S. HADA AND T. TANAKA. On the existence of 3-round zero-knowledge protocols. Cryptology ePrint Archive: Report 1999/009, March 1999. http://eprint.iacr. org/1999/009/. [Final version of [11].]
13. M. LEPINSKI. On the existence of 3-round zero-knowledge proofs. SM Thesis, MIT, June 2002. http://theory.les.mit.edu/~cis/theses/lepinski-masters. ps.
14. M. LEPINSKI AND S. MICALI. On the existence of 3-round zero-knowledge proof systems. MIT LCS Technical Memo. 616, April 2001. http://www.lcs.mit.edu/ publications/pubs/pdf/MIT-LCS-TM-616.pdf.
15. M. NAOR. On cryptographic assumptions and challenges. Invited paper and talk, Advances in Cryptology - CRYPTO '03, Lecture Notes in Computer Science Vol. 2729, D. Boneh ed., Springer-Verlag, 2003.
16. K. SAKURAI AND T. ITOH. On the discrepancy between serial and parallel of zeroknowledge protocols. Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992.