The Hardness of Being Private
暂无分享,去创建一个
Toniann Pitassi | Stephen A. Cook | Arkadev Chattopadhyay | Michal Koucký | Anil Ada | Lila Fontes | S. Cook | T. Pitassi | M. Koucký | A. Chattopadhyay | Anil Ada | Lila Fontes
[1] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[2] Eyal Kushilevitz,et al. On the structure of the privacy hierarchy , 2004, Journal of Cryptology.
[3] Mark Braverman. Interactive information complexity , 2012, STOC '12.
[4] Eyal Kushilevitz,et al. A Zero-One Law for Boolean Privacy (extended abstract) , 1989, STOC 1989.
[5] Xi Chen,et al. How to compress interactive communication , 2010, STOC '10.
[6] Eyal Kushilevitz,et al. Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] A. Razborov. Communication Complexity , 2011 .
[8] Andrew Chi-Chih Yao,et al. Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] Hartmut Klauck. Quantum and Approximate Privacy , 2003, Theory of Computing Systems.
[10] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[11] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[12] Toniann Pitassi,et al. The Hardness of Being Private , 2012, Computational Complexity Conference.
[13] Joan Feigenbaum,et al. Approximate Privacy: PARs for Set Problems , 2010, ArXiv.
[14] Joan Feigenbaum,et al. Approximate privacy: foundations and quantification (extended abstract) , 2010, EC '10.
[15] Joan Feigenbaum,et al. Approximate Privacy: Foundations and Quantification , 2009, TALG.
[16] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[17] Felix Brandt,et al. On the Existence of Unconditionally Privacy-Preserving Auction Protocols , 2008, TSEC.
[18] Eyal Kushilevitz,et al. Communication Complexity: Index of Notation , 1996 .
[19] Ravi Sandhu,et al. ACM Transactions on Information and System Security: Editorial , 2005 .
[20] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[21] Bhaskar DasGupta,et al. On communication protocols that compute almost privately , 2012, Theor. Comput. Sci..
[22] Reuven Bar-Yehuda,et al. Privacy, additional information and communication , 1993, IEEE Trans. Inf. Theory.
[23] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.