--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Johan foaf_name: Håstad, Johan foaf_surname: Håstad - foaf_Person: foaf_givenName: Rafael foaf_name: Pass, Rafael foaf_surname: Pass - foaf_Person: foaf_givenName: Douglas foaf_name: Wikström, Douglas foaf_surname: Wikström - foaf_Person: foaf_givenName: Krzysztof Z foaf_name: Krzysztof Pietrzak foaf_surname: Pietrzak foaf_workInfoHomepage: http://www.librecat.org/personId=3E04A7AA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9139-1654 bibo_doi: 10.1007/978-3-642-11799-2_1 bibo_volume: 5978 dct_date: 2010^xs_gYear dct_publisher: Springer@ dct_title: An efficient parallel repetition theorem@ ...