2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 13-18

A. Shamir , Dept. of Appl. Math., Wiezmann Inst. of Sci., Rehovot, Israel

D. Lapidot , Dept. of Appl. Math., Wiezmann Inst. of Sci., Rehovot, Israel

ABSTRACT

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.

INDEX TERMS

one-round perfect zero-knowledge protocol, fully parallelized multi prover protocols, NEXP-time, parallel executions, language

CITATION

A. Shamir,
D. Lapidot,
"Fully parallelized multi prover protocols for NEXP-time",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 13-18, 1991, doi:10.1109/SFCS.1991.185342