Is privacy compatible with truthfulness?

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2013, Pages 67-86

  Xiao, David ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

differential privacy; mechanism design

Indexed keywords

COMPUTATIONALLY EFFICIENT; DIFFERENTIAL PRIVACIES; MECHANISM DESIGN; NUMERICAL COSTS; OPTIMALITY; PRIVACY PRESERVING DATA MINING; RELEASE MECHANISM; SOCIAL WELFARE; TRUTHFUL MECHANISMS; VCG MECHANISM;

COMPUTER SCIENCE; GAME THEORY; MACHINE DESIGN; OPTIMIZATION;

DATABASE SYSTEMS;

EID: 84873340810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2422436.2422448     Document Type: Conference Paper

References (35)

1. Noga Alon, Michal Feldman, Ariel D. Procaccia, and Moshe Tennenholtz. Strategyproof approximation of the minimax on networks. Mathematics of Operations Research, 35(3):513-526, 2010.
2. Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank Mcsherry, and Kunal Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. In Proc. of 26th PODS, pages 273-282, 2007.
3. Avrim Blum, Katrina Ligett, and Aaron Roth. A learning theory approach to non-interactive database privacy. In Proc. 40'th STOC, pages 609-618, 2008.
4. Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, and Salil P. Vadhan. Truthful mechanisms for agents that value privacy. CoRR, abs/1111.5472, 2011.
5. T. Dalenius. Towards a methodology for statistical disclosure control. Statistik Tidskrift, 5:429-444, 1977.
6. Anindya De. Lower bounds in differential privacy. In TCC, pages 321-338, 2012.
7. Irit Dinur and Kobbi Nissim. Revealing information while preserving privacy. In In PODS, pages 202-210. ACM Press, 2003.
8. Cynthia Dwork. Differential privacy. In In Proc. ICALP, pages 1-12. Springer, 2006.
9. Cynthia Dwork. Differential privacy: A survey of results. In Manindra Agrawal, Dingzhu Du, Zhenhua Duan, and Angsheng Li, editors, Theory and Applications of Models of Computation, volume 4978 of Lecture Notes in Computer Science, pages 1-19. Springer Berlin / Heidelberg, 2008.
10. Cynthia Dwork, Krishnaram Kenthapadi, Frank Mcsherry, and Moni Naor. Our data, ourselves: Privacy via distributed noise generation. In In EUROCRYPT, pages 486-503. Springer, 2006.
11. Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, and Adam Smith. Calibrating noise to sensitivity in private data analysis. In In Proc. of the 3rd TCC, pages 265-284. Springer, 2006.
12. Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil Vadhan. On the complexity of differentially private data release: Efficient algorithms and hardness results. In Proc. 41'st STOC, STOC '09, pages 381-390. ACM, 2009.
13. Cynthia Dwork, Guy N. Rothblum, and Salil P. Vadhan. Boosting and differential privacy. In FOCS, pages 51-60, 2010.
14. Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira. Approximate privacy: foundations and quantification (extended abstract). In Proc. 11th EC, EC '10, pages 167-178, New York, NY, USA, 2010. ACM.
15. Dan Feldman, Amos Fiat, Haim Kaplan, and Kobbi Nissim. Private coresets. In Proc. 41st STOC, STOC '09, pages 361-370, New York, NY, USA, 2009. ACM.
16. I. Fellegi. On the question of statistical confidentiality. J. of the Amer. Stat. Assoc., 67:7-18, 1972.
17. Lisa K. Fleischer and Yu-Han Lyu. Approximately optimal auctions for selling privacy when costs are correlated with data. In Proceedings of the 13th ACM Conference on Electronic Commerce, EC '12, pages 568-585, New York, NY, USA, 2012. ACM.
18. Arpita Ghosh and Aaron Roth. Selling privacy at auction. In Proc. 12th EC, EC '11, pages 199-208, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0261-6.
19. Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan. Universally utility-maximizing privacy mechanisms. In Proc. 41'st STOC, STOC '09, pages 351-360. ACM, 2009.
20. Moritz Hardt. A Study of Privacy and Fairness in Sensitive Data Analysis. PhD thesis, Princeton University, 2011.
21. Moritz Hardt and Guy N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Proc. 51'st FOCS, pages 61-70, Washington, DC, USA, 2010. IEEE Computer Society. doi: 10.1109/FOCS.2010.85.
22. Moritz Hardt and Kunal Talwar. On the geometry of differential privacy. In Proc. 42nd STOC, pages 705-714, New York, NY, USA, 2010. ACM. ISBN 978-1-4503-0050-6. doi: 10.1145/1806689.1806786.
23. Zhiyi Huang and Sampath Kannan. The exponential mechanism for social welfare: Private, truthful, and nearly optimal. In Proc. FOCS '12, 2012. To appear. Available at http://arxiv.org/abs/1204.1255.
24. Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? In Proc. 49th FOCS, pages 531-540, Washington, DC, USA, 2008. IEEE.
25. Katrina Ligett and Aaron Roth. Take it or leave it: Running a survey when privacy comes at a cost. CoRR, abs/1202.4741, 2012.
26. Pinyan Lu, Xiaorui Sun, Yajun Wang, and Zeyuan Allen Zhu. Asymptotically optimal strategy-proof mechanisms for two-facility games. In Proceedings of the 11th ACM conference on Electronic commerce, EC '10, pages 315-324. ACM, 2010.
27. Frank McSherry and Kunal Talwar. Mechanism design via differential privacy. In Proceedings of the 48th Annual Symposium on Foundations of Computer Science. Citeseer, 2007.
28. H. Moulin. On strategy-proofness and single peakedness. Public Choice, 35:437-455, 1980.
29. Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. Smooth sensitivity and sampling in private data analysis. In Proc. 39th STOC, pages 75-84, 2007.
30. Kobbi Nissim, Claudio Orlandi, and Rann Smorodinsky. Privacy-aware mechanism design. In Proceedings of the 13th ACM Conference on Electronic Commerce, EC '12, pages 774-789, New York, NY, USA, 2012. ACM.
31. Kobbi Nissim, Rann Smorodinsky, and Moshe Tennenholtz. Approximately optimal mechanism design via differential privacy. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS '12, pages 203-213, New York, NY, USA, 2012. ACM. ISBN 978-1-4503-1115-1.
32. Aaron Roth and Grant Schoenebeck. Conducting truthful surveys, cheaply. In Proceedings of the 13th ACM Conference on Electronic Commerce, EC '12, pages 826-843, New York, NY, USA, 2012. ACM.
33. J. Schummer and R. V. Vohra. Mechanism design without money. In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 10, pages 243-266. Cambridge University Press, 2007.
34. M. R. Spiegel. Theory and Problems of Probability and Statistics. McGraw-Hill, 1992.
35. David Xiao. Is privacy compatible with truthfulness? Cryptology ePrint Archive, Report 2011/005, 2011. http://eprint.iacr.org/.