TY - GEN
T1 - An efficient parallel repetition theorem for Arthur-Merlin games
AU - Pass, Rafael
AU - Venkitasubramaniam, Muthuramakrishnan
PY - 2007
Y1 - 2007
N2 - 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).
AB - 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).
KW - Arthur-Merlin games
KW - Computationally-sound arguments
KW - Parallel repetition
KW - Proofs of knowledge
KW - Public-coin protocols
UR - http://www.scopus.com/inward/record.url?scp=35448969719&partnerID=8YFLogxK
U2 - 10.1145/1250790.1250853
DO - 10.1145/1250790.1250853
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:35448969719
SN - 1595936319
SN - 9781595936318
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 420
EP - 429
BT - STOC'07
T2 - STOC'07: 39th Annual ACM Symposium on Theory of Computing
Y2 - 11 June 2007 through 13 June 2007
ER -