{"page":"1 - 18","extern":1,"status":"public","publist_id":"3446","quality_controlled":0,"publisher":"Springer","intvolume":"      5978","abstract":[{"lang":"eng","text":"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."}],"year":"2010","alternative_title":["LNCS"],"_id":"3233","volume":5978,"date_updated":"2021-01-12T07:41:59Z","author":[{"last_name":"Håstad","full_name":"Håstad, Johan","first_name":"Johan"},{"full_name":"Pass, Rafael","last_name":"Pass","first_name":"Rafael"},{"first_name":"Douglas","full_name":"Wikström, Douglas","last_name":"Wikström"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z"}],"month":"03","doi":"10.1007/978-3-642-11799-2_1","title":"An efficient parallel repetition theorem","day":"26","date_created":"2018-12-11T12:02:10Z","publication_status":"published","date_published":"2010-03-26T00:00:00Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"type":"conference","citation":{"mla":"Håstad, Johan, et al. <i>An Efficient Parallel Repetition Theorem</i>. Vol. 5978, Springer, 2010, pp. 1–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>.","short":"J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp. 1–18.","ista":"Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 1–18.","ama":"Håstad J, Pass R, Wikström D, Pietrzak KZ. An efficient parallel repetition theorem. In: Vol 5978. Springer; 2010:1-18. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>","ieee":"J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel repetition theorem,” presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp. 1–18.","apa":"Håstad, J., Pass, R., Wikström, D., &#38; Pietrzak, K. Z. (2010). An efficient parallel repetition theorem (Vol. 5978, pp. 1–18). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>","chicago":"Håstad, Johan, Rafael Pass, Douglas Wikström, and Krzysztof Z Pietrzak. “An Efficient Parallel Repetition Theorem,” 5978:1–18. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>."}}