Rafael Pass
ABSTRACT
We show a parallel-repetition theorem for constant-round Arthur-Merlin Games, using an efficient reduction. As a consequence, we show that parallel repetition reduces the soundness-error at an optimal rate (up to a negligible factor) in constant-round public-coin argument systems, and constant-round public-coinproofs of knowledge. The former of these results resolves an open questionposed by Bellare, Impagliazzo and Naor (FOCS '97).
- {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. Google Scholar
Digital Library
- {2} M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols? In 38th FOCS, pages 374-383, 1997. Google ScholarDigital Library
- {3} M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO '92, pages 390-420, 1993. Google ScholarDigital Library
- {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.Google Scholar
- {5} G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988. Preliminary version by Brassard and Crépeau in 27th FOCS, 1986. Google ScholarDigital Library
- {6} R. Canetti and S. Halevi and M. Steiner. Hardness Amplification of Weakly Verifiable Puzzles. In 2nd TCC, Springer LNCS 3876, pages 17-33, 2005. Google ScholarDigital Library
- {7} 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.Google ScholarDigital Library
- {8} 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. Google ScholarDigital Library
- {9} U. Feige and A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. In J. Cryptology, 1(2), pages 77-94, 1988. Google ScholarDigital Library
- {10} U. Feige and J. Kilian. Two prover protocols: low error at affordable rates. In 26th STOC, pages 172-183, 1994. Google ScholarDigital Library
- {11} 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. Google ScholarDigital Library
- {12} U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In Crypto89, Springer LNCS 435, pages. 526-544, 1989. Google ScholarDigital Library
- {13} O. Goldreich. Foundations of Cryptography - Basic Tools. Cambridge University Press, 2001. Google ScholarDigital Library
- {14} O. Goldreich and H. Krawczyk. On the composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, Vol. 25(1), pages 169-192, 1996. Google ScholarDigital Library
- {15} S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, Vol. 28, No 2, pages 270-299, 1984.Google ScholarCross Ref
- {16} S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In STOC 85, pages 291-304, 1985. Google ScholarDigital Library
- {17} 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. Google ScholarDigital Library
- {18} 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. Google ScholarDigital Library
- {19} S. Goldwasser, 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. Google ScholarDigital Library
- {20} K. Pietrzak and D. Wikström. Parallel Repetition of Computationally Sound Protocols Revisited. To appear in TCC 2007. Google ScholarDigital Library
- {21} R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. Eurocrypt 99, Springer LNCS 1592, pages 415-431, 1999. Google ScholarDigital Library
- {22} R. Raz. A parallel repetition theorem. In 27th STOC, pages 447-456, 1995. Google ScholarDigital Library
- {23} M. Tompa, H. Woll. Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. In 28th FOCS, pages 472-482, 1987.Google ScholarDigital Library
- {24} A. Yao. Theory and Applications of Trapdoor Functions. In 23th FOCS, pages 80-91, 1982.Google ScholarCross Ref
Index Terms
- An efficient parallel repetition theorem for Arthur-Merlin games
Recommendations
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
We show a parallel-repetition theorem for constant-round Arthur-Merlin Proofs, using an efficient reduction. As a consequence, we show that parallel repetition reduces the soundness-error at an optimal rate (up to a negligible factor) in constant-round ...
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
In several settings, derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence of pseudorandom generators. This leaves open the question whether derandomization implies the circuit lower bounds that are ...
Generalized quantum arthur-merlin games
CCC '15: Proceedings of the 30th Conference on Computational ComplexityThis paper investigates the role of interaction and coins in quantum Arthur-Merlin games(also called public-coin quantum interactive proof systems). While the existing model restricts the messages from the verifier to be classical even in the quantum ...
Comments