Multi-prover encoding schemes and three-prover proof systems

Suppose two provers agree in a polynomial p and want to reveal a single value y=p(x) to a verifier where m is chosen arbitrarily by the verifier. Whereas honest provers should be able to agree on any polynomial p the verifier wants to be sure that with any (cheating) pair of provers the value y he receives is a polynomial function of x. We formalize this question and introduce multi-prover (quasi-)encoding schemes to solve it. Multi-prover quasi-encoding schemes are used to develop new interactive proof techniques. The main result of M. Bellare et al. (1993) is the existence of one-round four-prover interactive proof system for any language an NP achieving any constant error probability with O(log n) random bits and poly(log log n) answer-sizes. We improve this result in two respects. First we decrease the number of provers to three, and then we decrease the answer-size to a constant. Reduction of each parameter de critical for applications. When the error-probability is required to approach zero, our technique is efficient in the number of random bits and in the answer size.<<ETX>>

[1]  László Babai,et al.  Transparent Proofs and Limits to Approximation , 1994 .

[2]  Richard J. Lipton,et al.  On Games of Incomplete Information , 1992, Theor. Comput. Sci..

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

[4]  Mihir Bellare,et al.  The complexity of approximating a nonlinear program , 1995, Math. Program..

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

[6]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[7]  Jacques Stern,et al.  The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

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

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

[11]  Uriel Feige,et al.  Two prover protocols: low error at affordable rates , 1994, STOC '94.

[12]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[13]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[14]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[15]  Richard J. Lipton,et al.  Playing Games of Incomplete Information , 1990, Symposium on Theoretical Aspects of Computer Science.