Privacy, additional information, and communication
暂无分享,去创建一个
Reuven Bar-Yehuda | Eyal Kushilevitz | Benny Chor | B. Chor | E. Kushilevitz | A. Orlitsky | R. Bar-Yehuda
[1] Donald Beaver. Perfect Privacy For Two-Party Protocols , 1989, Distributed Computing And Cryptography.
[2] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[3] Eyal Kushilevitz,et al. Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[5] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[6] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[7] Martín Abadi,et al. On Hiding Information from an Oracle , 1987, Proceeding Structure in Complexity Theory.
[8] Eyal Kushilevitz,et al. A Zero-One Law for Boolean Privacy , 1991, SIAM J. Discret. Math..
[9] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.