TY - CONF
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.
AU - Håstad, Johan
AU - Pass, Rafael
AU - Wikström, Douglas
AU - Krzysztof Pietrzak
ID - 3233
TI - An efficient parallel repetition theorem
VL - 5978
ER -