Some Applications of Coding Theory in Computational Complexity

Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable error-correcting codes, and their applications to complexity theory and to cryptography. Locally decodable codes are error-correcting codes with sub-linear time error-correcting algorithms. They are related to private information retrieval (a type of cryptographic protocol), and they are used in average-case complexity and to construct \hard-core predicates" for one-way permutations. Locally testable codes are error-correcting codes with sub-linear time error-detection algorithms, and they are the combinatorial core of probabilistically checkable proofs.

[1]  William I. Gasarch,et al.  A Survey on Private Information Retrieval (Column: Computational Complexity) , 2004, Bull. EATCS.

[2]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[4]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[5]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[6]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[7]  Emanuele Viola,et al.  Hardness vs. randomness within alternating time , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[8]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[9]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[10]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[11]  D. Spielman,et al.  Computationally efficient error-correcting codes and holographic proofs , 1995 .

[12]  Yuval Ishai,et al.  Improved upper bounds on information-theoretic private information retrieval (extended abstract) , 1999, STOC '99.

[13]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[14]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[15]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[16]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[17]  Venkatesan Guruswami,et al.  List decoding algorithms for certain concatenated codes , 2000, STOC '00.

[18]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[19]  Luca Trevisan,et al.  Lower bounds for linear locally decodable codes and private information retrieval , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[20]  Michael G. Taylor.  Reliable information storage in memories designed from unreliable components , 1968 .

[21]  Luca Trevisan,et al.  On Worst-Case to Average-Case Reductions for NP Problems , 2005, Electron. Colloquium Comput. Complex..

[22]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[23]  N. Zierler,et al.  A Class of Error-Correcting Codes in $p^m $ Symbols , 1961 .

[24]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[25]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[26]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[27]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[28]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[29]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[30]  Venkatesan Guruswami,et al.  Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[31]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[32]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[33]  Omer Reingold,et al.  Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[34]  Eli Ben-Sasson,et al.  Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.

[35]  R. Impagliazzo,et al.  P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .

[36]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[37]  Yuval Ishai,et al.  Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[38]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[39]  E. Gilbert.  A comparison of signalling alphabets , 1952 .

[40]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[41]  Madhu Sudan.  List decoding: algorithms and applications , 2000, SIGA.

[42]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[43]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[44]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[45]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[46]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[47]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[48]  Leonid A. Levin,et al.  One way functions and pseudorandom generators , 1987, Comb..

[49]  Venkatesan Guruswami,et al.  Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.

[50]  Martín Abadi,et al.  On hiding information from an oracle , 1987, STOC '87.

[51]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[52]  Martín Abadi,et al.  On hiding information from an oracle , 1987, J. Comput. Syst. Sci..

[53]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[54]  Yuval Ishai,et al.  Information-Theoretic Private Information Retrieval: A Unied Construction (Extended Abstract) , 2001 .

[55]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[56]  Eli Ben-Sasson,et al.  Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[57]  Madhu Sudan,et al.  Small PCPs with low query complexity , 2000, computational complexity.

[58]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[59]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[60]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[61]  Venkatesan Guruswami,et al.  List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.

[62]  Luca Trevisan,et al.  List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[63]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[64]  Venkatesan Guruswami,et al.  Linear time encodable and list decodable codes , 2003, STOC '03.

[65]  Ronitt Rubinfeld,et al.  Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[66]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[67]  Claude E. Shannon,et al.  A Mathematical Theory of Communications , 1948 .

[68]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[69]  William Gasarch.  A Survey on Private Information Retrieval , 2004 .

[70]  Sanjeev Arora,et al.  The approximability of NP-hard problems , 1998, STOC '98.

[71]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[72]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[73]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[74]  Oded Goldreich,et al.  Locally testable codes and PCPs of almost-linear length , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[75]  Madhu Sudan.  Coding Theory: Tutorial and Survey , 2001, FOCS 2001.

[76]  Eli Ben-Sasson,et al.  Bounds on 2-Query Codeword Testing , 2003, RANDOM-APPROX.

[77]  Lance Fortnow,et al.  On the Power of Multi-Prover Interactive Protocols , 1994, Theor. Comput. Sci..

[78]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[79]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[80]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[81]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[82]  Yuval Ishai,et al.  Improved upper bounds on information-theoretic private information retrieval , 1999, STOC 1999.

[83]  Yuval Ishai,et al.  Information-Theoretic Private Information Retrieval: A Unified Construction , 2001, ICALP.

[84]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[85]  Andris Ambainis,et al.  On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .

[86]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[87]  Oded Goldreich,et al.  A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem , 1997, SIAM J. Comput..

[88]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[89]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[90]  Oded Goldreich.  Foundations of Cryptography: Volume 1 , 2006 .

[91]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[92]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[93]  Joan Feigenbaum,et al.  Lower bounds on random-self-reducibility , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[94]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[95]  Kenji Obata,et al.  Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes , 2002, RANDOM.

[96]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[97]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[98]  Elizabeth D Mann.  Private access to distributed information , 1998 .

[99]  Omer Reingold,et al.  Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[100]  Joan Feigenbaum,et al.  On the random-self-reducibility of complete sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[101]  Richard J. Lipton,et al.  Efficient Checking of Computations , 1990, STACS.

[102]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[103]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[104]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.