The knowledge complexity of interactive proof-systems
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[3] Justin M. Reyneri,et al. Coin flipping by telephone , 1984, IEEE Trans. Inf. Theory.
[4] Christos H. Papadimitriou,et al. Communication complexity , 1982, STOC '82.
[5] Joseph Y. Halpern,et al. A logic to reason about likelihood , 1983, Artif. Intell..
[6] Silvio Micali,et al. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[7] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Ronald Fagin,et al. A Model-Theoretic Analysis of Knowledge: Preliminary Report , 1984, FOCS.
[9] Andrei Z. Broder,et al. Flipping coins in many pockets (Byzantine agreement on uniformly random values) , 1984, FOCS.
[10] Joseph Y. Halpern,et al. Knowledge and common knowledge in a distributed environment , 1984, JACM.
[11] Silvio Micali,et al. How to Construct Random Functions (Extended Abstract) , 1984, FOCS.
[12] Endre Szemerédi,et al. On the Complexity of Matrix Group Problems I , 1984, FOCS.
[13] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[14] 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).
[15] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[16] David Chaum,et al. Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.
[17] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[18] Gilles Brassard,et al. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[19] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[20] Ronald Fagin,et al. Belief, Awareness, and Limited Reasoning. , 1987, Artif. Intell..
[21] Martin Tompa,et al. Random self-reducibility and zero knowledge interactive proofs of possession of information , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[22] Stathis Zachos,et al. Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..
[23] Johan Håstad,et al. Perfect zero-knowledge languages can be recognized in two rounds , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[24] Yair Oren,et al. On the cunning power of cheating verifiers: Some observations about zero knowledge proofs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[25] Stathis Zachos,et al. Probabalistic Quantifiers vs. Distrustful Adversaries , 1987, FSTTCS.
[26] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[27] 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).