We then show that our proof technique directly yields tight ``Chernoff-type'' parallel-repetition theorems (where one considers a ``threshold'' verifier that accepts iff the prover manages to convince a certain fraction of the parallel verifiers, as opposed to all of them) for any public-coin interactive argument; previously, tight results were only known for either constant-round protocols, or when the gap between the threshold and the original error-probability is a constant.
Category / Keywords: foundations / parallel repetition, public coin, interactive arguments, computationally sound proofs, KL divergence Original Publication (in the same form): IACR-TCC-2015 Date: received 13 Jan 2015 Contact author: kmchung at iis sinica edu tw Available format(s): PDF | BibTeX Citation Version: 20150114:165217 (All versions of this report) Discussion forum: Show discussion | Start new discussion