Sciweavers

Share
ECCC
2008
99views more  ECCC 2008»
9 years 10 months ago
Parallel Repetition in Projection Games and a Concentration Bound
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
Anup Rao
ECCC
2010
82views more  ECCC 2010»
9 years 10 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
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...
Ran Raz
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
10 years 2 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
10 years 2 months ago
Derandomized Parallel Repetition Theorems for Free Games
—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...
Ronen Shaltiel
COCOON
2010
Springer
10 years 3 months ago
A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
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...
Ricky Rosen
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
10 years 4 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
10 years 4 months ago
Chernoff-Type Direct Product Theorems
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...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
COCO
2007
Springer
84views Algorithms» more  COCO 2007»
10 years 4 months ago
Understanding Parallel Repetition Requires Understanding Foams
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
Uriel Feige, Guy Kindler, Ryan O'Donnell
FOCS
2008
IEEE
10 years 5 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
Ran Raz
FOCS
2009
IEEE
10 years 5 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner
books