Attacks on privacy and deFinetti's theorem

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 127-138

  Kifer, Daniel ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACKGROUND KNOWLEDGE; INDEPENDENT MODEL; MACHINE-LEARNING; SANITIZATION; SENSITIVE ATTRIBUTE;

LEARNING SYSTEMS;

DATABASE SYSTEMS;

EID: 70849111568     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559861     Document Type: Conference Paper

References (50)

1. Charu C. Aggarwal, Jian Pei, and Bo Zhang. On privacy preservation against adversarial data mining. In KDD, 2006.
2. Gagan Aggarwal, Tomas Feder, Krishnaram Kenthapadi, Rina Panigrahy, Dilys Thomas, and Ahn Zhu. Achieving anonymity via clustering in a metric space. In PODS, 2006.
3. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007.
4. F. Bacchus, A. J. Grove, J. Y. Halpern, and D. Koller. From statistics to beliefs. In AAAI, 1992.
5. Lars Backstrom, Cynthia Dwork, and Jon Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW, 2007.
6. Michael Barbaro and Tom Zeller. A face is exposed for AOL searcher no. 4417749. New York Times, August 9 2006.
7. Roberto Bayardo and Rakesh Agrawal. Data privacy through optimal k-anonymity. In ICDE, 2005.
8. Yvonne M. Bishop, Stephen E. Fienberg, and Paul W. Holland. Discrete Multivariate Analysis: Theory and Practice. Springer, 2007.
9. Bee-Chung Chen, Lei Chen, David Musicant, and Raghu Ramakrishnan. Learning from aggregate views. In ICDE, 2006.
10. Bee-Chung Chen, Kristen LeFevre, and Raghu Ramakrishnan. PrivacySkyline: Privacy with multidimensional adversarial knowledge. In VLDB, 2007.
11. Nilesh N. Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
12. Nando de Freitas and Hendrik Kück. Learning about individuals from group statistics. In UAI, pages 332-339, 2005.
13. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39(1):1-38, 1977.
14. Persi Diaconis and David Freedman. De fnetti's generalizations of exchangeability. In Richard C. Jefrey, editor, Studies in Inductive Logic and Probability, Volume II, pages 233-249. University of California Press, 1980.
15. Pedro Domingos and Michael Pazzani. On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning, 29(2-3):103-130, 1997.
16. Wenliang Du, Zhouxuan Teng, and Zutao Zhu. Privacy-maxent: integrating background knowledge in privacy quantification. In SIGMOD, 2008.
17. Cynthia Dwork. Diferential privacy. In ICALP, 2006.
18. Fernando Esponda, Elena S. Ackley, Paul Helman, Haixia Jia, and Stephanie Forrest. Protecting data privacy through hard-to-reverse negative databases. International Journal of Information Security, 6(6):403-415, 2007.
19. Alexandre Evfimievski, Johannes Gehrke, and Ramakrishnan Srikant. Limiting privacy breaches in privacy-preserving data mining. In PODS, 2003.
20. Chengfang Fang and Ee-Chien Chang. Information leakage in optimal anonymized and diversifed data. In Information Hiding, 2008.
21. Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, and Adam Smith. Composition attacks and auxiliary information in data privacy. In KDD, 2008.
22. Gabrial Ghinita, Panagoiotis Karras, Panos Kalnis, and Nikos Mamoulis. Fast data anonymization with low information loss. In VLDB, 2007.
23. Michael Hay, Gerome Miklau, David Jensen, Don Towsley, and Philipp Weis. Resisting structural re-identifecation in anonymized social networks. In VLDB, 2008.
24. Zhengli Huang, Wenliang Du, and Biao Chen. Deriving private information from randomized data. In SIGMOD, June 2004.
25. George H. John and Pat Langley. Estimating continuous distributions in bayesian classifiers. In UAI, 1995.
26. Hillol Kargupta, Souptik Datta, Qi Wang, and Krishnamoorthy Sivakumar. On the privacy preserving properties of random data perturbation techniques. In ICDM, 2003.
27. Daniel Kifer and Johannes Gehrke. Injecting utility into anonymized datasets. In SIGMOD, 2006.
28. Donald E. Knuth. The art of computer programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional, Boston, MA, USA, 3rd edition, 1997.
29. Ravi Kumar, Jasmine Novak, Bo Pang, and Andrew Tomkins. On anonymizing query logs via token-based hashing. In WWW, 2007.
30. Laks V. S. Lakshmanan, Raymond T. Ng, and Ganesh Ramesh. To do or not to do: the dilemma of disclosing anonymized data. In SIGMOD, 2005.
31. Kristen LeFevre, David DeWitt, and Raghu Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD, 2005.
32. Kristen LeFevre, David DeWitt, and Raghu Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE, 2006.
33. N. Li, T. Li, and S. Venkatasubramanian. t-Closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, 2007.
34. Tiancheng Li and Ninghui Li. Injector: Mining background knowledge for data anonymization. In ICDE, 2008.
35. Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, and Muthuramakrishnan Venkitasubramaniam. ℓ-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data, 1(1), 2007.
36. David Martin, Daniel Kifer, Ashwin Machanavajjhala, Johannes Gehrke, and Joseph Halpern. Worst case background knowledge for privacy preserving data publishing. In ICDE, 2007.
37. Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. In SIGMOD, 2004.
38. Krishnamurty Muralidhar and Rathindra Sarathy. Security of random data perturbation methods. ACM Transactions on Database Systems, 24(4):487-493, 1999.
39. Arvind Narayanan and Vitaly Shmatikov. How to break anonymity of the netix prize dataset. http://arxiv.org/abs/cs/0610105, 2006.
40. Arvind Narayanan and Vitaly Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy (SP), 2008.
41. Novi Quadrianto, Alex J. Smola, Tibério S. Caetano, and Quoc V. Le. Estimating labels from label proportions. In ICML, pages 776-783, 2008.
42. Vibhor Rastogi, Dan Suciu, and Sungho Hong. The boundary between privacy and utility in data publishing. In VLDB, 2007.
43. Jason Rennie, Lawrence Shih, Jaime Teevan, and David R. Karger. Tackling the poor assumptions of naive bayes text classifiers. In ICML, 2003.
44. Christian P. Robert and George Casella. Monte Carlo Statistical Methods. Springer-Verlag, New York, 2005.
45. Mark J. Schervish. Theory of Statistics. Springer, 1995.
46. Latanya Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557-570, 2002.
47. L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 1979.
48. Raymond Wong, Ada Fu, Ke Wang, and Jian Pei. Minimality attack in privacy preserving data publishing. In VLDB, 2007.
49. Xiaokui Xiao and Yufei Tao. Anatomy: Simple and effective privacy preservation. In VLDB, 2006.
50. Hui Xiong, Michael Steinbach, and Vipin Kumar. Privacy leakage in multi-relational databases: a semi-supervised learning perspective. VLDB Journal, 15(4):388-402, 2006.