An Efficient Parallel Repetition Theorem.

Bibliographic Details
Title: An Efficient Parallel Repetition Theorem.
Authors: Håstad, Johan, Pass, Rafael, Wikström, Douglas, Pietrzak, Krzysztof
Source: Theory of Cryptography (9783642117985); 2010, p1-18, 18p
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. [ABSTRACT FROM AUTHOR]
Copyright of Theory of Cryptography (9783642117985) is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/978-3-642-11799-2_1
Database: Complementary Index