Fully Parallelized Multi-Prover Protocols for NEXP-Time

A major open problem in the theory of multiprover protocols is to characterize the languages which can be accepted by fully parallelized protocols which achieve an exponentially low probability of cheating in a single round. The problem was motivated by the observation that the probability of cheating the n parallel executions of a multiprover protocol can be exponentially higher than the probability of cheating in n sequential executions of the same protocol. The problem is solved by proving that any language in NEXP-time has a fully parallelized multiprover protocol. By combining this result with a fully parallelized version of the protocol of M. Ben-Or et al. (ACM Symp. on Theory of Computing, 1988), a one-round perfect zero-knowledge protocol (under no cryptographic assumptions) can be obtained for every NEXPTIME language. >

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

[2]  Uriel Feige.  On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

[4]  Richard J. Lipton,et al.  PSPACE is provable by two provers in one round , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Adi Shamir,et al.  A One-Round, Two-Prover, Zero-Knowledge Protocol for NP , 1991, CRYPTO.

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

[7]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[8]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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

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