K-concealment: An alternative model of k-type anonymity

Transactions on Data Privacy

Volumn 5, Issue 1, 2012, Pages 189-222

  Tassa, Tamir ^a   Mazza, Arnon ^a   Gionis, Aristides ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b YAHOO RESEARCH   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

K-ANONYMITY; SECURITY MEASURE; SENSITIVE INFORMATIONS;

ALGORITHMS;

MATHEMATICAL MODELS;

EID: 84863609453     PISSN: 18885063     EISSN: 20131631     Source Type: Journal    
DOI: None     Document Type: Article

References (49)

1. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu. Achieving anonymity via clustering. In ACM-SIGMOD Symposium on Principles of Database Systems (PODS), pages 153-162, 2006.
2. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Approximation algorithms for k-anonymity. Journal of Privacy Technology, 2005.
3. G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the kth-ranked element. In EUROCRYPT, pages 40-55, 2004.
4. R. Agrawal and R. Srikant. Privacy-preserving data mining. In ACM-SIGMOD International Conference on Management of Data (SIGMOD), pages 439-450, 2000.
5. M. Barbaro and T. Zeller. A face is exposed for AOL searcher no. 4417749. New York Times, 2006.
6. R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In International Conference on Data Engineering (ICDE), pages 217-228, 2005.
7. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: The SuLQ framework. In ACM-SIGMOD Symposium on Principles of Database Systems (PODS), pages 128-138, 2005.
8. B. Bollob́as. Graph Theory: An Introductory Course. Springer-Verlag, 1979.
9. L. Burnett, K. Barlow-Stewart, A. Proos, and H. Aizenberg. The" GeneTrustee": A universal identification system that ensures privacy and confidentiality for human genetic databases. Journal of Law and Medicine, 10(4):506, 2003.
10. J. Cai, A. Pavan, and D. Sivakumar. On the hardness of permanent. In Symposium on Theoretical Aspects of Computer Science (STACS), pages 90-99, 1999.
11. J. Cheriyan and K. Mehlhorn. Algorithms for dense graphs and networks on the random access computer. Algorithmica, 15:521-549, 1996.
12. T. Dalenius. Towards a methodology for statistical disclosure control. Statistik Tidskrift, 15:429-444, 1977.
13. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In ACM-SIGMOD Symposium on Principles of Database Systems (PODS), pages 211-222, 2003.
14. U. Feige and C. Lund. On the hardness of computing the permanent of random matrices. In ACM Symposium on Theory of Computing (STOC), pages 643-654, 1992.
15. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
16. B. Fung, K. Wang, R. Chen, and P. Yu. Privacy-preserving data publishing: A survey of recent developments. ACM Computing Surveys (CSUR), 42(4):1-53, 2010.
17. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In ACM Symposium on Theory of Computing (STOC), pages 32-42, 1991.
18. P. Gemmell and M. Sudan. Highly resilient correctors for polynomials. Inf. Process. Lett., 43:169-174, 1992.
19. A. Gionis, A. Mazza, and T. Tassa. k-Anonymization revisited. In International Conference on Data Engineering (ICDE), pages 744-753, 2008.
20. A. Gionis and T. Tassa. k-Anonymization with minimal loss of information. IEEE Transactions on Knowledge and Data Engineering, 21:206-219, 2009.
21. J. Goldberger and T. Tassa. Efficient anonymizations with enhanced utility. Transactions on Data Privacy, 3:149-175, 2010.
22. V. Iyengar. Transforming data to satisfy privacy constraints. In ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), pages 279-288, 2002.
23. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51:671-697, 2004.
24. B. Kenig and T. Tassa. A practical approximation algorithm for optimal k-anonymity. Data Mining and Knowledge Discovery, 2012.
25. A. Kerckhoffs. La cryptographie militaire. Journal des sciences militaires, 9:5-83,161-191, 1883.
26. D. Kifer and J. Gehrke. Injecting utility into anonymized datasets. In ACM-SIGMOD International Conference on Management of Data (SIGMOD), pages 217-228, 2006.
27. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Auditing boolean attributes. Journal of Computer and System Sciences, 6:244-253, 2003.
28. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: efficient full-domain k-anonymity. In ACM-SIGMOD International Conference on Management of Data (SIGMOD), pages 49-60, 2005.
29. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In International Conference on Data Engineering (ICDE), page 25, 2006.
30. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and ℓ-diversity. In ICDE, pages 106-115, 2007.
31. R. Lipton. New directions in testing. Distributed Computing and Cryptography, Vol. 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 191-202, 1991.
32. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-Diversity: Privacy beyond k-anonymity. In International Conference on Data Engineering (ICDE), page 24, 2006.
33. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In ACM-SIGMOD Symposium on Principles of Database Systems (PODS), pages 223-228, 2004.
34. M. E. Nergiz and C. Clifton. Thoughts on k-anonymization. Data Knowl. Eng., 63(3):622-645, 2007.
35. H. Park and K. Shim. Approximate algorithms for k-anonymity. In ACM-SIGMOD Conference, pages 67-78, 2007.
36. H. Ryser. Combinatorial Mathematics. Carus Mathematical Monograph No. 14, Math. Assoc. of America, 1963.
37. P. Samarati. Protecting respondent's privacy in microdata release. IEEE Transactions on Knowledge and Data Engineering, 13:1010-1027, 2001.
38. P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information. In ACM-SIGMOD Symposium on Principles of Database Systems (PODS), page 188, 1998.
39. L. Sweeney. k-Anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557-570, 2002.
40. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
41. S. Toda. On the computational power of PP and ⊕P. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 514-519, 1989.
42. T. Truta, A. Campan, and P. Meyer. Generating microdata with p-sensitive k-anonymity property. In Secure Data Management (SDM), pages 124-141, 2007.
43. J. Vaidya, Y. M. Zhu, and C. Clifton. Privacy preserving data mining. Springer-Verlag, 2006.
44. L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
45. S. Vinterbo. Privacy: a machine learning view. IEEE Transactions on Knowledge and Data Engineering, 16:939-948, 2004.
46. R. Wong, A. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In International Conference on Very Large Data Bases (VLDB), pages 543-554, 2007.
47. R. Wong, J. Li, A. Fu, and K. Wang. (α, k)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 754-759, 2006.
48. X. Xiao and Y. Tao. Anatomy: Simple and effective privacy preservation. In International Conference on Very Large Data Bases (VLDB), pages 139-150, 2006.
49. L. Zhang, S. Jajodia, and A. Brodsky. Information disclosure under realistic assumptions: privacy versus optimality. In ACM Conference on Computer and Communications Security, pages 573-583, 2007.