An efficient parallel repetition theorem for Arthur-Merlin games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 420-429

  Pass, Rafael ^a   Venkitasubramaniam, Muthuramakrishnan ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Arthur Merlin games; Computationally sound arguments; Parallel repetition; Proofs of knowledge; Public coin protocols

Indexed keywords

ARTHUR-MERLIN GAMES; COMPUTATIONALLY-SOUND ARGUMENTS; PARALLEL REPETITION; PROOFS OF KNOWLEDGE; PUBLIC-COIN PROTOCOLS;

COMPUTATIONAL METHODS; ERROR ANALYSIS; GAME THEORY;

THEOREM PROVING;

EID: 35448969719     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250853     Document Type: Conference Paper

References (25)

1. L. Babai and S. Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. JCSS, Vol. 36, pages 254-276, 1988.
2. M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols? In 38th FOGS, pages 374-383, 1997.
3. M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO '92, pages 390-420, 1993.
4. M. Blum. How to prove a Theorem So No One Else Can Claim It. Proc. of the International Congress of Mathematicians, Berkeley, California, USA, pages 1444-1451, 1986.
5. G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988.
6. Preliminary version by Brassard and Crépeau in 27th FOCS, 1986.
7. R. Canetti and S. Halevi and M. Steiner. Hardness Amplification of Weakly Verifiable Puzzles. In 2nd TCC, Springer LNCS 3876, pages 17-33, 2005.
8. O. Goldreich and R. Impagliazzo and L. A. Levin and R. Venkatesan and D. Zuckerman. Security Preserving Amplification of Hardness. In 31th FOCS, pages 318-326, 1990.
9. M. Ben-or and S. Goldwasser and J. Kilian and A. Wigderson. Multi Prover Interactive Proofs: How to Remove Intractability. In 20th STOC, pages 113-131, 1988.
10. U. Feige and A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. In J. Cryptology, 1(2), pages 77-94, 1988.
11. U. Feige and J. Kilian. Two prover protocols: low error at affordable rates. In 26th STOC, pages 172-183, 1994.
12. L. Fortnow and J. Rompel and M. Sipser. On the power of multi-prover interactive protocols. In Theor. Comput. Sci., 134(2), pages 545-557, 1994.
13. U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In Crypto89, Springer LNCS 435, pages. 526-544, 1989.
14. O. Goldreich. Foundations of Cryptography - Basic Tools. Cambridge University Press, 2001.
15. O. Goldreich and H. Krawczyk. On the composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, Vol. 25(1), pages 169-192, 1996.
16. S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, Vol. 28, No 2, pages 270-299, 1984.
17. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In STOC 85, pages 291-304, 1985.
18. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Jour. on Computing, Vol. 18(1), pp. 186-208, 1989.
19. S. Goldwasser, S. Micali and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM Jour. on Computing, Vol. 17, No. 2, pp. 281-308, 1988.
20. S. Goklwasser, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38(1), pp. 691-729, 1991.
21. K. Pietrzak and D. Wikström. Parallel Repetition of Computationally Sound Protocols Revisited. To appear in TCC 2007.
22. R. Richardson and J. Kilián. On the Concurrent Composition of Zero-Knowledge Proofs. Eurocrypt 99, Springer LNCS 1592, pages 415-431, 1999.
23. R. Raz. A parallel repetition theorem. In 27th STOC, pages 447-456, 1995.
24. M. Tompa, H. Woll. Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. In 28th FOCS, pages 472-482, 1987.
25. A. Yao. Theory and Applications of Trapdoor Functions. In 23th FOCS, pages 80-91, 1982.