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

Rafael Pass; Muthuramakrishnan Venkitasubramaniam

doi:10.1145/2382559.2382561

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

Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Article number	10
Journal	ACM Transactions on Computation Theory
Volume	4
Issue number	4
DOIs	https://doi.org/10.1145/2382559.2382561
State	Published - Nov 2012
Externally published	Yes

Keywords

Interactive proofs
Parallel-repetition
Public-coin protocols
Soundness error

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1145/2382559.2382561

Cite this

@article{a483251008214608ba653527edac7650,

title = "A parallel repetition theorem for constant-round Arthur-Merlin Proofs",

abstract = "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).",

keywords = "Interactive proofs, Parallel-repetition, Public-coin protocols, Soundness error",

author = "Rafael Pass and Muthuramakrishnan Venkitasubramaniam",

year = "2012",

month = nov,

doi = "10.1145/2382559.2382561",

language = "الإنجليزيّة",

volume = "4",

journal = "ACM Transactions on Computation Theory",

issn = "1942-3454",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

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

AU - Pass, Rafael

AU - Venkitasubramaniam, Muthuramakrishnan

PY - 2012/11

Y1 - 2012/11

N2 - 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).

AB - 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).

KW - Interactive proofs

KW - Parallel-repetition

KW - Public-coin protocols

KW - Soundness error

UR - http://www.scopus.com/inward/record.url?scp=84870692566&partnerID=8YFLogxK

U2 - 10.1145/2382559.2382561

DO - 10.1145/2382559.2382561

M3 - مقالة

SN - 1942-3454

VL - 4

JO - ACM Transactions on Computation Theory

JF - ACM Transactions on Computation Theory

IS - 4

M1 - 10

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this