ABSTRACT
The "direct product code" of a function f gives its values on all k-tuples (f(x1),...,f(xk)). This basic construct underlies "hardness amplification" in cryptography, circuit complexity and PCPs. Goldreich and Safra [12] pioneered its local testing and its PCP application. A recent result by Dinur and Goldenberg [5] enabled for the first time testing proximity to this important code in the "list-decoding" regime. In particular, they give a 2-query test which works for polynomially small success probability 1/kα, and show that no such test works below success probability 1/k. Our main result is a 3-query test which works for exponentially small success probability exp(-kα). Our techniques (based on recent simplified decoding algorithms for the same code [15]) also allow us to considerably simplify the analysis of the 2-query test of [5]. We then show how to derandomize their test, achieving a code of polynomial rate, independent of k, and success probability 1/kα. Finally we show the applicability of the new tests to PCPs. Starting with a 2-query PCP over an alphabet Σ and with soundness error 1-δ, Rao [19] (building on Raz's (k-fold) parallel repetition theorem [20] and Holenstein's proof [13]) obtains a new 2-query PCP over the alphabet Σk with soundness error exp(-δ2 k). Our techniques yield a 2-query PCP with soundness error exp(-δ √k). Our PCP construction turns out to be essentially the same as the miss-match proof system defined and analyzed by Feige and Kilian [8], but with simpler analysis and exponentially better soundness error.
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. JACM, 45(3):501--555, 1998. Google ScholarDigital Library
- S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. JACM, 45(1):70--122, 1998. Google ScholarDigital Library
- I. Dinur. The PCP theorem by gap amplification. JACM, 54(3), 2007. Google ScholarDigital Library
- I. Dinur. PCPs with small soundness error. ACM SIGACT News, 2008. Google ScholarDigital Library
- I. Dinur and E. Goldenberg. Locally testing direct products in the low error range. In FOCS'08. Google ScholarDigital Library
- I. Dinur and O. Reingold. Assignment testers: Towards a combinatorial proof of the PCP theorem. SICOMP, 36(4):975--1024, 2006. Google ScholarDigital Library
- F. Ergun, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan. Spot-checkers. JCSS, 60(3):717--751, 2000. Google ScholarDigital Library
- U. Feige and J. Kilian. Two-prover protocols -- low error at affordable rates. SICOMP, 30(1):324--346, 2000. Google ScholarDigital Library
- U. Feige and O. Verbitsky. Error reduction by parallel repetition -- A negative result. Combinatorica, 22(4):461--478, 2002. Google ScholarDigital Library
- O. Goldreich and L.A. Levin. A hard-core predicate for all one-way functions. In STOC'89, pages 25--32, 1989. Google ScholarDigital Library
- O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-Lemma. ECCC, TR95-050, 1995.Google Scholar
- O. Goldreich and S. Safra. A combinatorial consistency lemma with application to proving the PCP theorem. SICOMP, 29(4):1132--1154, 2000. Google ScholarDigital Library
- T. Holenstein. Parallel repetition: Simplifications and the no-signaling case. In STOC'07, pages 411--419, 2007. Google ScholarDigital Library
- R. Impagliazzo, R. Jaiswal, and V. Kabanets. Approximately list-decoding direct product codes and uniform hardness amplification. In FOCS'06, pages 187--196, 2006. Google ScholarDigital Library
- R. Impagliazzo, R. Jaiswal, V. Kabanets, and A. Wigderson. Uniform direct-product theorems: Simplified, optimized, and derandomized. In STOC'08, pages 579--588, 2008. Google ScholarDigital Library
- R. Impagliazzo and A. Wigderson. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In STOC'97, pages 220--229, 1997. Google ScholarDigital Library
- L.A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357--363, 1987. Google ScholarDigital Library
- D. Moshkovitz and R. Raz. Two query PCP with sub-constant error. In FOCS'08, 2008. Google ScholarDigital Library
- A. Rao. Parallel repetition in projection games and a concentration bound. In STOC'08, pages 1--10, 2008. Google ScholarDigital Library
- R. Raz. A parallel repetition theorem. SICOMP, 27(3):763--803, 1998. Google ScholarDigital Library
- R. Raz. A counterexample to strong parallel repetition. In FOCS'08, 2008. Google ScholarDigital Library
- L. Trevisan. List-decoding using the XOR lemma. In FOCS'03, pages 126--135, 2003. Google ScholarDigital Library
- O. Verbitsky. Towards the parallel repetition conjecture. TCS, 157(2):277--282, 1996. Google ScholarDigital Library
- A.C. Yao. Theory and applications of trapdoor functions. In FOCS'82, pages 80--91, 1982. Google ScholarCross Ref
Index Terms
- New direct-product testers and 2-query PCPs
Recommendations
Towards a proof of the 2-to-1 games conjecture?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe present a polynomial time reduction from gap-3LIN to label cover with 2-to-1 constraints. In the “yes” case the fraction of satisfied constraints is at least 1 −ε, and in the “no” case we show that this fraction is at most ε, assuming a certain (new) ...
Composition of low-error 2-query PCPs using decodable PCPs
Property testingThe main result of this paper is a generic composition theorem for low error two-query probabilistically checkable proofs (PCPs). Prior to this work, composition of PCPs was well-understood only in the constant error regime. Existing composition methods ...
New Direct-Product Testers and 2-Query PCPs
† Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)The “direct-product code” of a function $f$ gives its values on all $k$-tuples $(f(x_1),\dots, f(x_k))$. This basic construct underlies “hardness amplification” in cryptography, circuit complexity, and probabilistically checkable proofs (PCPs). Goldreich and ...
Comments