On round-efficient argument systems

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 140-152

  Wee, Hoeteck ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; POLYNOMIALS;

ARGUMENT SYSTEMS; COMMUNICATION COMPLEXITY; INTERACTIVE PROOF SYSTEMS;

INTERACTIVE COMPUTER SYSTEMS;

EID: 26444588107     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_12     Document Type: Conference Paper

References (23)

1. [Bar01] Boaz Barak. How to go beyond the black-box simulation barrier. In Proc. 42nd FOCS, 2001.
2. [Bar04] Boaz Barak. Non-Black-Box Techniques in Cryptography. Ph.D., Weizmann Institute of Science, January 2004.
3. [BCC88] Gilles Brassard, David Chaum, and Claude Crepeau. Minimum disclosure proofs of knowledge. JCSS, 37(2):156-189, 1988.
4. [BG02] Boaz Barak and Oded Goldreich. Universal arguments and their applications. In Proc. CCC '02, 2002.
5. [BIN97] Mihir Bellare, Russell Impagliazzo, and Moni Naor. Does parallel repetition lower the error in computationally sound protocols? In Proc. 38th FOCS, 1997.
6. [BLV04] Boaz Barak, Yehuda Lindell, and Salil Vadhan. Lower bounds for non-black-box zero knowledge. Cryptology ePrint Archive, Report 2004/226, 2004. Extended abstract in Proc. 44th FOCS, 2003.
7. [BM88] László Babai and Shlomo Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class. JCSS, 36(2):254-276, 1988.
8. [BP04] Boaz Barak and Rafael Pass. On the possibility of one-message weak zeroknowledge. In Proc. 1st TCC, 2004.
9. [CGH98] Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. In Proc. 30th STOC, 1998.
10. +04] Cynthia Dwork, Michael Langberg, Moni Naor, Kobbi Nissim, and Omer Reingold. Succint proofs for NP and spooky interactions, manuscript, 2004.
11. [DN00] Cynthia Dwork and Moni Naor. Zaps and their applications. In Proc. 41st FOCS, 2000.
12. [DNRS03] Cynthia Dwork, Moni Naor, Omer Reingold, and Larry Stockmeyer. Magic functions. JACM, 50(6):852-921, 2003.
13. [FLS99] Uriel Feige, Dror Lapidot, and Adi Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SICOMP, 29(1): 1-28, 1999.
14. [For89] Lance Fortnow. The complexity of perfect zero-knowledge. Advances in Computing Research, 5:429-442, 1989.
15. [FS86] Amos Fiat and Adi Shamir. How to prove to yourself: practical solutions to identification and signature problems. In Proc. Crypto '86, 1986.
16. [GH98] Oded Goldreich and Johan Håstad. On the complexity of interactive proofs with bounded communication. IPL, 67(4):205-214, 1998.
17. [GK03] Shaft Goldwasser and Yael Tauman Kalai. On the (in)security of the Fiat-Shamir paradigm. In Proc. 44th FOcS, 2003.
18. [GO94] Oded Goldreich and Yair Oren. Definitions and properties of zeroknowledge proof systems. J. Cryptology, 7(1): 1-32, 1994.
19. [Gol01] Oded Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
20. [GT00] Rosario Gennaro and Luca Trevisan. Lower bounds on efficiency of generic cryptographic constructions. In Proc. 41st FOCS, 2000.
21. [Kil92] Joe Kilian. A note on efficient zero-knowledge proofs and arguments. In Proc. 24th STOC, 1992.
22. [KP98] Joe Kilian and Erez Petrank. An efficient noninteractive zero-knowledge proof system for NP with general assumptions. J. Cryptology, 11(1): 1-27, 1998.
23. [Mic00] Silvio Micali. Computationally sound proofs. SICOMP, 30(4): 1253-1298, 2000.