Fast data anonymization with low information loss

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 758-769

  Ghinita, Gabriel ^a   Karras, Panagiotis ^b   Kalnis, Panos ^a   Mamoulis, Nikos ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ANONYMIZATION; EXPERIMENTAL EVALUATION; NOCV2; ONE DIMENSIONAL PROBLEMS; OPTIMAL SOLUTIONS; PRIVACY PRESERVATION; PRIVACY PRESERVING; SENSITIVE INFORMATIONS; SPACE MAPPING TECHNIQUES;

DATA PRIVACY;

EID: 84988315609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu. Achieving Anonymity via Clustering. In Proc. of ACM PODS, pp 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, (Paper number: 20051120001), 2005.
3. R. J. Bayardo and R. Agrawal. Data Privacy through Optimal k-Anonymization. In Proc. of ICDE, pp 217-228, 2005.
4. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Math. Softw., 3(3):209-226, 1977.
5. A. Froomkin. The Death of Privacy. Stanford Law Review, 52(5):1461-1543, 2000.
6. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing Data Cubes Efficiently. In Proc. of ACM SIGMOD, pp 205-216, 1996.
7. V. S. Iyengar. Transforming Data to Satisfy Privacy Constraints. In Proc. of SIGKDD, pp 279-288, 2002.
8. D. Kifer and J. Gehrke. Injecting Utility into Anon-ymized Datasets. In Proc. of ACM SIGMOD, pp 217-228, 2006.
9. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient Full-domain k-Anonymity. In Proc. of ACM SIGMOD, pp 49-60, 2005.
10. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian Multidimensional k-Anonymity. In Proc. of ICDE, 2006.
11. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Workload-aware Anonymization. In Proc. of KDD, pp 277-286, 2006.
12. N. Li, T. Li, and S. Venkatasubramanian. t-Closeness: Privacy Beyond k-Anonymity and l-Diversity. In Proc. of ICDE, pp 106-115, 2007.
13. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-Diversity: Privacy Beyond k-Anonymity. In Proc. of ICDE, 2006.
14. A. Meyerson and R. Williams. On the Complexity of Optimal K-anonymity. In Proc. of ACM PODS, pp 223-228, 2004.
15. B. Moon, H. Jagadish, and C. Faloutsos. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. IEEE TKDE, 13(1):124-141, 2001.
16. P. Samarati and L. Sweeney. Generalizing Data to Provide Anonymity when Disclosing Information (abstract). In PODS (see also Technical Report SRI-CSL-98-04), 1998.
17. L. Sweeney. k-Anonymity: A Model for Protecting Privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):557-570, 2002.
18. Y. Tao and X. Xiao. Personalized Privacy Preservation. In Proc. of ACM SIGMOD, pp 229-240, 2006.
19. R. Wong, A. Fu, J. Pei, K. Wang, S. Wan, and C. Lo. Multidimensional k-anonymization by Linear Clustering Using Space-filling Curves. TR 2006-27, Simon Fraser University, March 2006.
20. X. Xiao and Y. Tao. Anatomy: Simple and Effective Privacy Preservation. In Proc. of VLDB, pp 139-150, 2006.
21. J. Xu, W. Wang, J. Pei, X. Wang, B. Shi, and A. Fu. Utility-Based Anonymization Using Local Recoding. In Proc. of SIGKDD, pp 785-790, 2006.
22. Q. Zhang, N. Koudas, D. Srivastava, and T. Yu. Aggregate Query Answering on Anonymized Tables. In Proc. of ICDE, pp 116-125, 2007.
23. R. Zhang, P. Kalnis, B. C. Ooi, and K.-L. Tan. Generalized Multidimensional Data Mapping and Query Processing. ACM TODS, 30(3):661-697, 2005.