Approximate privacy: Foundations and quantification

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2010, Pages 167-178

  Feigenbaum, Joan ^a   Jaggard, Aaron D ^b   Schapira, Michael ^a,c  

^a Yale University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

approximate privacy; bisection auction

Indexed keywords

APPROXIMATION RATIOS; AVERAGE-CASE; DAILY LIVES; DISJOINTNESS; MILLIONAIRES PROBLEM; NETWORKED ENVIRONMENTS; PUBLIC GOODS; SENSITIVE DATAS; SET INTERSECTION; VICKREY AUCTION;

ELECTRONIC COMMERCE;

EID: 77954754217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807342.1807369     Document Type: Conference Paper

References (22)

1. Moshe Babaioff, Liad Blumrosen, Moni Naor, and Michael Schapira. Informational overhead of incentive compatibility. In Proceedings of the ACM Conference on Electronic Commerce, pages 88-97, 2008.
2. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, and Alon Orlitsky. Privacy, additional information, and communication. IEEE Transactions on Information Theory, 39(6):55-65, 1993.
3. Amos Beimel, Paz Carmi, Kobbi Nissim, and Enav Weinreb. Private approximation of search problems. In Proceedings of the ACM Symposium on Theory of Computing, pages 119-128, 2006.
4. Liad Blumrosen and Noam Nisan. Auctions with severely bounded communications. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 406-415, 2002.
5. Felix Brandt and Tuomas Sandholm. On the existence of unconditionally privacy-preserving auction protocols. ACM Trans. Inf. Syst. Secur., 11(2):1-21, 2008.
6. Benny Chor and Eyal Kushilevitz. A zero-one law for boolean privacy. SIAM J. Discrete Math, 4(1):36-47, 1991.
7. Cynthia Dwork. Differential privacy. In Proceedings of the International Colloquium on Automata, Languages and Programming, pages 1-12, 2006.
8. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, and Rebecca N. Wright. Secure multiparty computation of approximations. ACM Transactions on Algorithms, 2(3):435-472, 2006.
9. Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. Approximate privacy: Foundations and quantification. DIMACS technical report 2009-14 and arXiv:0910.5714, 2009.
10. Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. Approximate privacy: PARs for set problems. DIMACS technical report 2010-01 and arXiv:1001.3388, 2010.
11. Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan. Universally utility-maximizing privacy mechanisms. In Proceedings of the ACM Symposium on Theory of Computing, pages 351-360, 2009.
12. Elena Grigorieva, P. Jean-Jacques Herings, and Rudolf Müller. The communication complexity of private value single-item auctions. Oper. Res. Lett., 34(5):491-498, 2006.
13. Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, and Dries Vermeulen. The private value single item bisection auction. Economic Theory, 30(1):107-118, January 2007.
14. Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, and Kobbi Nissim. Private approximation of NP-hard functions. In Proceedings of the ACM Symposium on Theory of Computing, pages 550-559, 2001.
15. Eyal Kushilevitz. Privacy and communication complexity. SIAM J. Discrete Math., 5(2):273-284, 1992.
16. Eyal Kushilevitz and Noam Nisan. Communication Complexity. Cambridge University Press, 1997.
17. S. Muthukrishnan. Challenges in Designing Ad Exchanges. Talk at the NSF Workshop on Research Issues at the Interface of Computer Science and Economics, Cornell University, September 2009.
18. Moni Naor, Benny Pinkas, and Reuben Sumner. Privacy preserving auctions and mechanism design. In Proceedings of the ACM Conference on Electronic Commerce, pages 129-139, 1999.
19. Noam Nisan. Introduction to mechanism design (for computer scientists). In Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007.
20. William Vickrey. Counterspeculation, auctions and competitive sealed tenders. J. of Finance, 16(1):8-37, 1961.
21. Andrew C. Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the ACM Symposium on Theory of Computing, pages 209-213, 1979.
22. Andrew C. Yao. Protocols for secure computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.