An efficient parallel repetition theorem

Johan Håstad; Rafael Pass; Douglas Wikström; Krzysztof Pietrzak

doi:10.1007/978-3-642-11799-2_1

An efficient parallel repetition theorem

Johan Håstad^*, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

30 Scopus citations

Abstract

We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.

Original language	English
Title of host publication	Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings
Pages	1-18
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-11799-2_1
State	Published - 2010
Externally published	Yes
Event	7th Theory of Cryptography Conference, TCC 2010 - Zurich, Switzerland Duration: 9 Feb 2010 → 11 Feb 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5978 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th Theory of Cryptography Conference, TCC 2010
Country/Territory	Switzerland
City	Zurich
Period	9/02/10 → 11/02/10

Access to Document

10.1007/978-3-642-11799-2_1

Cite this

Håstad, J., Pass, R., Wikström, D., & Pietrzak, K. (2010). An efficient parallel repetition theorem. In Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings (pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS). https://doi.org/10.1007/978-3-642-11799-2_1

@inproceedings{f618abf2742a4352ac2a0cfae7336fc1,

title = "An efficient parallel repetition theorem",

abstract = "We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.",

author = "Johan H{\aa}stad and Rafael Pass and Douglas Wikstr{\"o}m and Krzysztof Pietrzak",

year = "2010",

doi = "10.1007/978-3-642-11799-2_1",

language = "אנגלית",

isbn = "3642117988",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1--18",

booktitle = "Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings",

note = "7th Theory of Cryptography Conference, TCC 2010 ; Conference date: 09-02-2010 Through 11-02-2010",

}

Håstad, J, Pass, R, Wikström, D & Pietrzak, K 2010, An efficient parallel repetition theorem. in Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5978 LNCS, pp. 1-18, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 9/02/10. https://doi.org/10.1007/978-3-642-11799-2_1

An efficient parallel repetition theorem. / Håstad, Johan; Pass, Rafael; Wikström, Douglas et al.
Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. 2010. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient parallel repetition theorem

AU - Håstad, Johan

AU - Pass, Rafael

AU - Wikström, Douglas

AU - Pietrzak, Krzysztof

PY - 2010

Y1 - 2010

N2 - We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.

AB - We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.

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

U2 - 10.1007/978-3-642-11799-2_1

DO - 10.1007/978-3-642-11799-2_1

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77949610580

SN - 3642117988

SN - 9783642117985

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings

T2 - 7th Theory of Cryptography Conference, TCC 2010

Y2 - 9 February 2010 through 11 February 2010

ER -

An efficient parallel repetition theorem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this