A top-down approach for approximate data anonymisation

Enterprise Information Systems

Volumn 7, Issue 3, 2013, Pages 272-302

  Li, JianQiang ^a   Yang, Ji Jiang ^b   Zhao, Yu ^a   Liu, Bo ^a  

^a NEC Laboratories China   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

approximate algorithm; data anonymisation; k anonymity; privacy protection

Indexed keywords

APPROXIMATE ALGORITHMS; DATA ANONYMISATION; EMPIRICAL EXPERIMENTS; INDIVIDUAL PRIVACY; INFORMATION SOCIETY; K-ANONYMITY; PRIVACY PROTECTION; THEORETICAL PERFORMANCE;

APPROXIMATION ALGORITHMS; DATA PRIVACY; EQUIVALENCE CLASSES; GRAPH THEORY; HEURISTIC ALGORITHMS;

PROBLEM SOLVING;

EID: 84882572557     PISSN: 17517575     EISSN: 17517583     Source Type: Journal    
DOI: 10.1080/17517575.2012.688223     Document Type: Article

References (49)

1. Acquisti, A. Privacy in electronic commerce and the economics of immediate gratification. Proceedings of ACM electronic commerce conference, New York. May 17-20 2004. pp. 21-29. New York, NY: ACM Press.
2. Aggarwal, G. 2005. Approximation algorithms for k-anonymity. Journal of Privacy Technology (Paper number: 20051120001),
3. Aggarwal, G. Achieving anonymity via clustering. Proceedings of ACM PODS. June 26-28 2006. pp. 153-162. Chicago, IL. New York, NY: ACM Press
4. Agrawal, R. and Srikant, R. Fast algorithms for mining association rules in large databases. VLDB. pp. 12-15 September 1994, Santiago de Chile, Chile. Morgan Kaufmann Publishers, 487-499.
5. Agrawal, R. and Srikant, R. Privacy-preserving data mining. Proceedings of the ACM SIGMOD international conference on management of data. May 15-18 2000. pp. 439-450. Dallas, TX: ACM Press.
6. Bayardo, R. and Agrawal, R. Data privacy through optimal k-anonymization. ICDE. April 5-8 2005. pp. 217-228. Tokyo, Japan: IEEE Computer Society.
7. Benjamin Fung, C.M. 2010. Privacy-preserving data publishing: a survey on recent developments. ACM Computing Surveys, 42 (4): 1-53
8. Brown, M. and Muchira, R. 2004. Investigating the relationship between internet privacy concerns and online purchase behavior. Journal of Electronic Commerce Research, 5 (1): 62-70.
9. Byun, J.-W. Efficient k-anonymization using clustering techniques. Internal conference on database systems for advanced applications (DASFAA). April 9-12 2007. pp. 188-288. Bangkok, Thailand: Springer.
10. Chaum, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24 (2): 84-88.
11. Chen, B.-C. 2009. Privacy-preserving data publishing. Foundations and Trends® in Databases, 2 (1-2): 1-167.
12. Chiu, C.-C. and Tsai, C.-Y. A k-anonymity clustering method for effective data privacy preservation. Third international conference on advanced data mining and applications (ADMA). August 6-8 2007. pp. 89-99. China: Springer.
13. Dinur, I. and Nissim, K. Revealing information while preserving privacy. Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. June 9-12 2003. pp. 202-210. San Diego, CA: ACM Press.
14. Dwork, C. and Nissim, K. Privacy-preserving data mining on vertically partitioned databases. Advances in cryptology: proceedings of crypto. August 15-19 2004. pp. 528-544. Santa Barbara, CA: Springer.
15. Evfimievski, A., Gehrke, J. and Srikant, R. Limiting privacy breaches in privacy preserving data mining. Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. June 9-12 2003. pp. 211-222. San Diego, CA: ACM Press.
16. Gehrke, J. Models and methods for privacy-preserving data publishing and analysis. Tutorial at the 12th ACM SIGKDD. 20-23 August 2006, Philadelphia, PA. ACM Press
17. Ghinita, G. Fast data anonymization with low information loss. Proceedings of VLDB. September 23-27 2007. pp. 758-769. Austria: ACM Press. University of Vienna
18. Gionis, A. and Tassa, T. 2009. k-anonymization with minimal loss of information. IEEE Transactions on Knowledge and Data Engineering, 21 (2): 206-219.
19. Iyengar, V. Transforming data to satisfy privacy constraints. Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining. July 23-26 2002. pp. 279-288. Edmonton, Alberta, Canada: ACM Press.
20. Jakobsson, M., Juels, A. and Rivest, R.L. Making mix nets robust for electronic voting by randomized partial checking. Proceedings of the 11th USENIX security symposium. August 5-9 2002. pp. 339-353. San Francisco, CA, USA USENIX Association Berkeley, CA
21. Kenig, B. and Tassa, T. 2012. A practical approximation algorithm for optimal k-anonymity. Data Mining and Knowledge Discovery, 25, 134-168 doi: 10.1007/s 10618-011-0235-9
22. Kenthapadi, K., Mishra, N. and Nissim, K. Simulatable auditing. Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems. June 13-16 2005. pp. 118-127. Baltimore, Maryland: ACM Press.
23. Kleinberg, J., Papadimitriou, C. and Raghavan, P. 2003. Auditing boolean attributes. Journal of Computer and System Sciences, 6: 244-253.
24. Koudas, N. Aggregate query answering on anonymized tables. ICDE. April 15-20 2007. pp. 116-125. The Marmara Hotel, Istanbul, Turkey: IEEE Computer Society.
25. Lefevre, K., Dewitt, D.J. and Ramakrishnan, R. Incognito: efficient full-domain k-anonymity. Proceedings of ACM SIGMOD. June 14-16 2005. pp. 49-60. Baltimore, Maryland: ACM Press.
26. Lefevre, K., Dewitt, D.J. and Ramakrishnan, R. Mondrian multidimensional k-anonymity. Proceedings of the 22nd IEEE international conference on data engineering (ICDE). April 3-8 2006. pp. 25-34. Atlanta, GA: IEEE Computer Society.
27. Lefevre, K., Dewitt, D.J. and Ramakrishnan, R. Workload-aware anonymization. KDD. August 20-23 2006. pp. 277-286. Philadelphia, CA: ACM.
28. Li, N., Li, T. and Venkatasubramanian, S. t-Closeness: privacy beyond k-anonymity and l-diversity. Proceedings of ICDE. April 15-20 2007. pp. 106-115. The Marmara Hotel, Istanbul, Turkey: IEEE Computer Society.
29. Lin, J.L. and Wei, M.C. An efficient clustering method for k-anonymization. Proceedings of PAIS, 29 March 2008, Nantes, France. IOS Press, 46-50.
30. Loukides, G. and Shao, J. Capturing data usefulness and privacy protection in k-anonymisation. Proceedings of the 2007 ACM symposium on applied computing, Convention Center Seoul. March 11-15 2007. pp. 370-374. Korea: ACM Press.
31. Loukides, G. and Shao, J. Speeding up clustering-based k-anonymisation algorithms with pre-partitioning. BNCOD. July 3-5 2007. pp. 203-214. Glasgow, UK: Springer.
32. Machanavajjhala, A. l-diversity: privacy beyond k-anonymity. Proceedings of ICDE, 3-7 April 2006, Atlanta, GA. IEEE Press, 24-24.
33. Meyerson, A. and Williams, R. On the complexity of optimal k-anonymity. Proceedings of ACM PODS. June 13-18 2004. pp. 223-228. Paris, France: ACM Press.
34. Moon, B., Jagadish, H. and Faloutsos, C. 2001. Analysis of the clustering properties of the Hilbert space-filling curve. IEEE TKDE, 13 (1): 124-141.
35. Park, H. and Shim, K. Approximate algorithms for k-anonymity. Proceedings of the SIGMOD. 12-14 2007. pp. 67-78. Beijing, China: ACM Press.
36. Park, H. and Shim, K. 2010. Approximate algorithms with generalizing attribute values for k-anonymity. Information System, 35: 933-955.
37. Pasquier, N. Discovering frequent closed itemsets for association rules. ICDT. January 10-12 1999. pp. 398-416. Jerusalem, Israel: Springer.
38. Privacy & American Business (P&AB). 2005. New survey reports an increase in ID theft and decrease in consumer confidence [online] Conducted by Harris Interactive, May 2005. Available from: http://www.pandab.org/deloitteidsurveypr.html [Accessed 18 June 2011]
39. Samarati, P. 2001. Protecting respondents' identities in microdata release. IEEE Transactions on Knowledge and Data Engineering (TKDE), 13 (6): 1010-1027.
40. Skowron, A. and Rauszer, C. 1992. Intelligent decision support: handbook of applications and advances of the rough set theory Dordrecht: Kluwer
41. Sweeney, L. 2002a. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10 (5): 557-570.
42. Sweeney, L. 2002b. Achieving k-anonymity privacy protection using generalization and suppression. International Journal on Uncertainty, Fuzziness, and Knowledge-based Systems, 10 (5): 571-588.
43. van der Putten, P. and van Someren, M. 2000. CoIL challenge 2000: the insurance company case [online], Amsterdam: Sentient Machine Research. Available from: http://archive.ics.uci.edu/ml/datasets/Insurance+Company+Benchmark+%28COIL+2000%29 [Accessed 20 June 2011]
44. Warner, S.L. 1965. Randomized response: a survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60 (309): 63-69.
45. Wong, R.C.W. (α, k)-anonymity: an enhanced k-anonymity model for privacy-preserving data publishing. Proceedings of the ACM KDD. August 20-23 2006. pp. 754-759. Philadelphia, PA, New York: ACM Press.
46. Xiao, X. and Tao, Y. Personalized privacy preservation. Proceedings of ACM SIGMOD. June 27-29 2006. pp. 229-240. Chicago, IL: ACM Press.
47. Xu, J. Utility-based anonymization using local recoding. Proceedings of SIGKDD. August 20-23 2006. pp. 785-790. Philadelphia, PA: ACM Press.
48. Yang, Z., Zhong, S. and Wright, R.N. Anonymity-preserving data collection. Proceedings of the 11th ACM SIGKDD. August 21-25 2005. pp. 334-343. Chicago, IL: ACM Press.
49. Zhang, R. 2005. Generalized multidimensional data mapping and query processing. ACM TODS, 30 (3): 661-697.