Fully parallelized multi prover protocols for NEXP-time
暂无分享,去创建一个
[1] 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.
[2] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[3] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[4] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[5] 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.
[6] Adi Shamir,et al. A One-Round, Two-Prover, Zero-Knowledge Protocol for NP , 1991, CRYPTO.