On Doubly-Efficient Interactive Proof Systems

An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier???s strategy can be implemented in almost-linear time. Such proof systems make the benefits of interactive proof system available to real-life agents who are restricted to polynomial-time computation. On Doubly-Efficient Interactive Proof Systems surveys some of the known results regarding doubly-efficient interactive proof systems. It starts by presenting two simple constructions for t-no-CLIQUE, where the first construction offers the benefit of being generalized to any ???locally characterizable??? set, and the second construction offers the benefit of preserving the combinatorial flavor of the problem. It then turns to two more general constructions of doubly-efficient interactive proof system: the proof system for sets having (uniform) bounded-depth circuits and the proof system for sets that are recognized in polynomial-time and small space. T e presentation of the GKR construction is complete and is somewhat different from the original presentation. A brief overview is provided for the RRR construction.

[1]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[2]  R. Raz,et al.  How to delegate computations: the power of no-signaling proofs , 2014, Electron. Colloquium Comput. Complex..

[3]  Prashant Nalini Vasudevan,et al.  Average-case fine-grained hardness , 2017, Electron. Colloquium Comput. Complex..

[4]  Oded Goldreich.  On the doubly-efficient interactive proof systems of GKR , 2017, Electron. Colloquium Comput. Complex..

[5]  Guy N. Rothblum,et al.  Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets , 2017, ITCS.

[6]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[7]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[8]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[9]  Or Meir,et al.  IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..

[10]  Ryan Williams,et al.  Losing Weight by Gaining Edges , 2013, ESA.

[11]  Salil Vadhan.  On transformation of interactive proofs that preserve the prover's complexity , 2000, STOC '00.

[12]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[14]  Russell Impagliazzo,et al.  Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility , 2016, Electron. Colloquium Comput. Complex..

[15]  Guy N. Rothblum,et al.  Constant-Round Interactive Proofs for Delegating Computation , 2016, Electron. Colloquium Comput. Complex..

[16]  Ron Rothblum,et al.  Efficient Batch Verification for UP , 2018, Electron. Colloquium Comput. Complex..

[17]  Moni Naor,et al.  Does parallel repetition lower the error in computationally sound protocols? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[18]  Justin Thaler,et al.  Semi-Streaming Algorithms for Annotated Graph Streams , 2014, Electron. Colloquium Comput. Complex..

[19]  Yael Tauman Kalai,et al.  Non-interactive delegation and batch NP verification from standard computational assumptions , 2017, STOC.

[20]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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

[22]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.

[23]  Avi Wigderson,et al.  On interactive proofs with a laconic prover , 2001, computational complexity.

[24]  Richard Ryan Williams,et al.  Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation , 2016, CCC.

[25]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[26]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[27]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

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

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

[30]  Virginia Vassilevska Williams,et al.  Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.

[31]  R. Cramer,et al.  Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .

[32]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[33]  Amir Abboud,et al.  If the Current Clique Algorithms are Optimal, So is Valiant's Parser , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[34]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[35]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

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

[37]  Yael Tauman Kalai,et al.  Delegation for bounded space , 2013, STOC '13.

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

[39]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[40]  Guy N. Rothblum,et al.  Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[41]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[42]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

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

[44]  Andreas Björklund,et al.  How proofs are prepared at Camelot , 2016, ArXiv.

[45]  Silvio Micali,et al.  Computationally Sound Proofs , 2000, SIAM J. Comput..

[46]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..