Sciweavers

35 search results - page 3 / 7
» An Efficient Parallel Repetition Theorem
Sort
View
FOCS
2008
IEEE
14 years 20 days 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
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
13 years 9 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
FOCS
2008
IEEE
14 years 20 days ago
Two Query PCP with Sub-Constant Error
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Dana Moshkovitz, Ran Raz
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 10 days 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»
14 years 12 days 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...