Abstract
Kushilevitz [1989] initiated the study of information-theoretic privacy within the context of communication complexity. Unfortunately, it has been shown that most interesting functions are not privately computable [Kushilevitz 1989, Brandt and Sandholm 2008]. The unattainability of perfect privacy for many functions motivated the study of approximate privacy. Feigenbaum et al. [2010a, 2010b] define notions of worst-case as well as average-case approximate privacy and present several interesting upper bounds as well as some open problems for further study. In this article, we obtain asymptotically tight bounds on the trade-offs between both the worst-case and average-case approximate privacy of protocols and their communication cost for Vickrey auctions.
Further, we relate the notion of average-case approximate privacy to other measures based on information cost of protocols. This enables us to prove exponential lower bounds on the subjective approximate privacy of protocols for computing the Intersection function, independent of its communication cost. This proves a conjecture of Feigenbaum et al. [2010a].
- Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, and Alon Orlitsky. 1993. Privacy, additional information, and communication. IEEE Trans. Inf. Theory 39, 6, 55--65. Google Scholar
Digital Library
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2004. An information statistics approach to data stream and communication complexity. J. Comput. System Sci. 68, 4, 702--732. DOI:http://dx.doi.org/10.1016/j.jcss.2003.11.006. Google Scholar
Digital Library
- Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. 2010. How to compress interactive communication. In Proceedings of the 42nd ACM Symposium on Theory of Computing. DOI:http://dx.doi.org/10.1145/1806689.1806701. Google Scholar
Digital Library
- Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1--10. Google Scholar
Digital Library
- Felix Brandt and Tuomas Sandholm. 2008. On the existence of unconditionally privacy-preserving auction protocols. ACM Trans. Inform. Syst. Secur. 11, 2, 1--21. DOI:http://dx.doi.org/10.1145/1330332.1330338. Google Scholar
Digital Library
- Mark Braverman. 2011. Interactive information complexity. In Electronic Colloquium on Computational Complexity, Report No. 123.Google Scholar
- Amit Chakrabarti, Anthony Wirth, Andrew Yao, and Yaoyun Shi. 2001. Informational complexity and the direct sum problem for simultaneous message complexity. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. 270--278. DOI:http://dx.doi.org/10.1109/SFCS.2001.959901. Google Scholar
Digital Library
- Benny Chor and Eyal Kushilevitz. 1989. A zero-one law for boolean privacy (extended abstract). In Proceedings of the 21st Annual ACM Symposium on the Theory of Computing. 62--72. Google Scholar
Digital Library
- Benny Chor, Mihály Geréb-Graus, and Eyal Kushilevitz. 1994. On the structure of the privacy hierarchy. J. Cryptol. 7, 1, 53--60. DOI:http://dx.doi.org/10.1007/BF00195209. Google Scholar
Digital Library
- Marco Comi, Bhaskar Dasgupta, Michael Schapira, and Venkatakumar Srinivasan. 2011. On communication protocols that compute almost privately. In Proceedings of the Symposium on Algorithmic Game Theory. 44--56. Google Scholar
Digital Library
- Thomas M. Cover and Joy A. Thomas. 1991. Elements of Information Theory. Wiley-Interscience, New York. NY. Google Scholar
Digital Library
- Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. 2010a. Approximate privacy: Foundations and quantification. In Proceedings of the 11th Conference on Electronic Commerce. 167--178. DOI:http://dx.doi.org/10.1145/1807342.1807369. Google Scholar
Digital Library
- Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. 2010b. Approximate privacy: PARs for set problems. DIMACS Tech. rep. 2010-01, 1--34. http://dimacs.rutgers.edu/~adj/Research/type.html.Google Scholar
- Hartmut Klauck. 2002. On quantum and approximate privacy. In Proceedings of the 19th Annual Symposium on Theoretical Aspects (STACS’02). Google Scholar
Digital Library
- Eyal Kushilevitz. 1989. Privacy and communication complexity. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. 416--421. DOI:http://dx.doi.org/10.1109/SFCS.1989.63512. Google Scholar
Digital Library
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press. Google Scholar
Digital Library
- Andrew Chi-chih Yao. 1979. Some complexity questions related to distributive computing. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing. 209--213. Google Scholar
Digital Library
- Andrew Chi-chih Yao. 1982. Protocols for secure computations. In Proceedings of the 23rd Annual Foundations of Computer Science. 160--164. Google Scholar
Digital Library
Index Terms
The Hardness of Being Private
Recommendations
The Hardness of Being Private
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)In 1989 Kushilevitz initiated the study of iinformation-theoretic privacy within the context of communication complexity. Unfortunately, it has been shown that most interesting functions are not privately computable. The unattainability of perfect ...
Private coresets
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computingA coreset of a point set P is a small weighted set of points that captures some geometric properties of $P$. Coresets have found use in a vast host of geometric settings. We forge a link between coresets, and differentially private sanitizations that ...
Average-case hardness of NP from exponential worst-case hardness assumptions
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingA long-standing and central open question in the theory of average-case complexity is to base average-case hardness of NP on worst-case hardness of NP. A frontier question along this line is to prove that PH is hard on average if UP requires (sub-)...






Comments