The hardness and approximation algorithms for L-diversity

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 135-146

  Xiao, Xiaokui ^a   Yi, Ke ^b   Tao, Yufei ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; INFORMATION LOSS; K-ANONYMITY; MICRODATA; NON-TRIVIAL; NP-HARD; PRIVACY PRESERVING; PRIVACY PRINCIPLE; REAL DATA SETS; T-CLOSENESS; THEORETICAL STUDY; WORST CASE;

DATA PRIVACY; DATABASE SYSTEMS; HEURISTIC ALGORITHMS; TECHNOLOGY;

APPROXIMATION ALGORITHMS;

EID: 77952257230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739060     Document Type: Conference Paper

References (52)

1. N. R. Adam and J. C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4):515-556, 1989. (Pubitemid 20658272)
2. C. C. Aggarwal. On k-anonymity and the curse of dimensionality. In VLDB, pages 901-909, 2005.
3. C. C. Aggarwal and P. S. Yu. A condensation approach to privacy preserving data mining. In EDBT, pages 183-199, 2004.
4. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu. Achieving anonymity via clustering. In PODS, pages 153-162, 2006.
5. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Anonymizing tables. In ICDT, pages 246-258, 2005.
6. R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD, pages 439-450, 2000.
7. R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE, pages 217-228, 2005.
8. E. Bertino, C. Bettini, E. Ferrari, and P. Samarati. An access control model supporting periodicity constraints and temporal reasoning. TODS, 23(3):231-285, 1998.
9. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In PODS, pages 128-138, 2005.
10. B.-C. Chen, R. Ramakrishnan, and K. LeFevre. Privacy skyline: Privacy with multidimensional adversarial knowledge. In VLDB, pages 770-781, 2007.
11. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 2001.
12. Department of Health and Human Services Office for Civil Rights, USA. Hipaa administrative simplification regulation text. 2006.
13. Y. Du, T. Xia, Y. Tao, D. Zhang, and F. Zhu. On multidimensional k-anonymity with local recoding generalization. In ICDE, pages 1422-1424, 2007.
14. A. V. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS, pages 211-222, 2003.
15. B. C. M. Fung, K. Wang, and P. S. Yu. Top-down specialization for information and privacy preservation. In ICDE, pages 205-216, 2005.
16. G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis. Fast data anonymization with low information loss. In VLDB, pages 758-769, 2007.
17. E. Hazan, S. Safra, and O. Schwartz. On the hardness of approximating k-dimensional matching. Electronic Colloquium on Computational Complexity (ECCC), 10(20), 2003.
18. A. Hundepool and L. Willenborg. μ- and τ-argus: Software for statistical disclosure control. In International Seminar on Statistical Confidentiality, 1996.
19. T. Iwuchukwu and J. F. Naughton. K-anonymization as spatial indexing: Toward scalable and incremental anonymization. In VLDB, pages 746-757, 2007.
20. V. Iyengar. Transforming data to satisfy privacy constraints. In SIGKDD, pages 279-288, 2002.
21. W. Jiang and C. Clifton. A secure distributed framework for achieving k-anonymity. The VLDB Journal, 15(4):316-333, 2006.
22. R. M. Karp. Reducibility among combinatorial problems. R. E. Miller and J. W. Thatcher (editors): Complexity of Computer Computations, pages 85-103, 1972.
23. D. Kifer and J. Gehrke. Injecting utility into anonymized datasets. In SIGMOD, pages 217-228, 2006.
24. H. Kuhn. The hungarian method for the assignment problem. Naval Res. Logist. Q., 2:83-97, 1955.
25. S. Kullback and R. A. Leibler. On information and sufficiency. Annals of Mathematical Statistics, 22:79-86, 2003.
26. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD, pages 49-60, 2005.
27. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE, 2006.
28. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Workload-aware anonymization. In KDD, pages 277-286, 2006.
29. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, pages 106-115, 2007.
30. J. Liu and K. Wang. On optimal anonymization for ℓ+-diversity. In ICDE, 2010.
31. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. TKDD, 1, 2007.
32. D. J. Martin, D. Kifer, A. Machanavajjhala, J. Gehrke, and J. Y. Halpern. Worst-case background knowledge for privacy preserving data publishing. In ICDE, pages 126-135, 2007.
33. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS, pages 223-228, 2004.
34. M. E. Nergiz, M. Atzori, and C. Clifton. Hiding the presence of individuals from shared databases. In SIGMOD, pages 665-676, 2007.
35. H. Park and K. Shim. Approximate algorithms for k-anonymity. In SIGMOD, pages 67-78, 2007.
36. V. Rastogi, S. Hong, and D. Suciu. The boundary between privacy and utility in data publishing. In VLDB, pages 531-542, 2007.
37. S. Ruggles, M. Sobek, T. Alexander, C. A. Fitch, R. Goeken, P. K. Hall, M. King, and C. Ronnander. Integrated public use microdata series: Version 3.0 [machine-readable database]. 2004. http://ipums.org.
38. P. Samarati. Protecting respondents' identities in microdata release. TKDE, 13(6):1010-1027, 2001.
39. SAS Institute. SAS/STAT 9.2 User's Guide. SAS Publishing, 1 edition, 2008.
40. SPSS Inc. SPSS 16.0 Base User's Guide. SPSS Inc., 2 edition, 2007.
41. Stata Corporation. Stata User's Guide Release 8.0. Stata Press, 1 edition, 2003.
42. L. Sweeney. Datafly: A system for providing anonymity in medical data. In DBSec, pages 356-381, 1997.
43. L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness, and Knowlege-Based Systems, 10(5):557-570, 2002.
44. K. Wang, P. S. Yu, and S. Chakraborty. Bottom-up generalization: A data mining solution to privacy protection. In ICDM, pages 249-256, 2004.
45. R. C.-W.Wong, A. W.-C. Fu, K. Wang, and J. Pei. Minimality attack in privacy preserving data publishing. In VLDB, pages 543-554, 2007.
46. R. C.-W.Wong, J. Li, A. W.-C. Fu, and K. Wang. (alpha, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In SIGKDD, pages 754-759, 2006.
47. X. Xiao and Y. Tao. Anatomy: Simple and effective privacy preservation. In VLDB, pages 139-150, 2006.
48. X. Xiao and Y. Tao. Personalized privacy preservation. In SIGMOD, pages 229-240, 2006.
49. X. Xiao and Y. Tao. m-invariance: Towards privacy preserving re-publication of dynamic datasets. In SIGMOD, pages 689-700, 2007.
50. X. Xiao, K. Yi, and Y. Tao. The hardness and approximation algorithms for l-diversity. CoRR, abs/0912.5426, 2009. http://arxiv.org/abs/0912.5426.
51. J. Xu, W.Wang, J. Pei, X. Wang, B. Shi, and A. W.-C. Fu. Utility-based anonymization using local recoding. In SIGKDD, pages 785-790, 2006.
52. Q. Zhang, N. Koudas, D. Srivastava, and T. Yu. Aggregate query answering on anonymized tables. In ICDE, pages 116-125, 2007.