A parallel repetition theorem for constant-round Arthur-Merlin Proofs

Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Research output: Contribution to journalArticlepeer-review


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 public-coin argument systems, and constant-round public-coin proofs of knowledge. The first of these results resolves an open question posed by Bellare, Impagliazzo, and Naor (FOCS'97).

Original languageEnglish
Article number10
JournalACM Transactions on Computation Theory
Issue number4
StatePublished - Nov 2012
Externally publishedYes


  • Interactive proofs
  • Parallel-repetition
  • Public-coin protocols
  • Soundness error

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'A parallel repetition theorem for constant-round Arthur-Merlin Proofs'. Together they form a unique fingerprint.

Cite this