Multi-prover interactive proofs: how to remove intractability assumptions
暂无分享,去创建一个
Avi Wigderson | Joe Kilian | Shafi Goldwasser | Michael Ben-Or | M. Ben-Or | S. Goldwasser | A. Wigderson | J. Kilian
[1] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[2] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[3] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[4] Clemens Lautemann,et al. BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..
[5] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[6] Oded Goldreich,et al. Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[7] Moti Yung,et al. A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[8] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[9] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[10] David A. Mix Barrington,et al. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.
[11] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[12] Gilles Brassard,et al. Zero-Knowledge Simulation of Boolean Circuits , 1986, CRYPTO.
[13] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[14] Oded Goldreich,et al. How to Solve any Protocol Problem - An Efficiency Improvement , 1987, CRYPTO.
[15] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[16] Oded Goldreich,et al. Interactive proof systems: Provers that never fail and random selection , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[17] Moshe Tennenholtz,et al. The Noisy Oracle Problem , 1988, CRYPTO.
[18] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.
[19] David A. Mix Barrington,et al. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ , 1989, J. Comput. Syst. Sci..