19 search results - page 2 / 4 » A Parallel Repetition Theorem for Any Interactive Argument |
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
APPROX
2009
Springer
14 years 2 days ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
ECCC
2010
13 years 5 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...