Interactive Proofs with Space Bounded Provers
暂无分享,去创建一个
[1] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[2] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[3] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[4] Manuel Blum,et al. Program Result Checking against Adaptive Programs and in Cryptographic Settings , 1989, Distributed Computing And Cryptography.
[5] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[6] L. Fortnow,et al. On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[7] Manuel Blum,et al. Designing programs that check their work , 1989, STOC '89.
[8] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[9] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[10] Avi Wigderson,et al. Efficient Identification Schemes Using Two Prover Interactive Proofs , 1989, CRYPTO.
[11] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[12] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.