Anonymity technologies for privacy-preserving data publishing and mining

Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques

Volumn , Issue , 2010, Pages 3-33

  Monreale, Anna ^a   Pedreschi, Dino ^a   Pensa, Ruggero G ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR TELEPHONE SYSTEMS; DATA MINING; DATA PRIVACY; ELECTRONIC MAIL; SALES; TELEPHONE SETS;

ANONYMITY TECHNOLOGIES; CUSTOMER PREFERENCES; INTELLIGENT SERVICES; KNOWLEDGE DISCOVERY IN DATABASE; LARGE AMOUNTS OF DATA; PRIVACY PRESERVING DATA PUBLISHING; PRIVACY VIOLATION; SENSITIVE INFORMATIONS;

DATA ACQUISITION;

EID: 85026674532     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b10373     Document Type: Chapter

References (72)

1. O. Abul, F. Bonchi, and M. Nanni. Never walk alone: Uncertainty for anonymity in moving objects databases. In ICDE, pages 376-385, 2008.
2. N. R. Adam and J. C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4): 515-556, 1989.
3. C. C. Aggarwal. On randomization, public information and the curse of dimensionality. In ICDE, pages 136-145, 2007.
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. ACM, 2006.
5. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Anonymizing tables. In ICDT, volume 3363 of LNCS, pages 246-258, 2005.
6. D. Agrawal and C.C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In PODS. ACM, 2001.
7. R. Agrawal. Privacy and data mining. In ECML/PKDD, 2004.
8. R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD, pages 439-450. ACM, 2000.
9. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. Blocking anonymity threats raised by frequent itemset mining. In ICDM, pages 561-564. IEEE Computer Society, 2005.
10. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. k-anonymous patterns. In PKDD, pages 10-21, 2005.
11. M. Atzori, F. Bonchi, F. Giannotti, and D. Pedreschi. Anonymity preserving pattern discovery. VLDB Journal, 17(4): 703-727, 2008.
12. R. J. Bayardo and R. Agrawal. Data privacy through optimal kanonymization. In ICDE 2005, pages 217-228, 2005.
13. A. R. Beresford and F. Stajano. Location privacy in pervasive computing. IEEE Pervasive Computing, 2(1): 46-55, 2003.
14. A. R. Beresford and F. Stajano. Mix zones: user privacy in locationaware services. In PerCom Workshops, pages 127-131. IEEE Computer Society, 2004.
15. S. Mascetti and C. Bettini. Preserving k-anonymity in spatio-temporal datasets and location-based services. First Italian workshop on PRIvacy and SEcurity (PRISE), Rome, June 2006.
16. C. Bettini, X. S. Wang, and S. Jajodia. Protecting privacy against location-based personal identification. In VLDB Workshop SDM 2005, volume 3674 of LNCS, pages 185-199. Springer, 2005.
17. J. Burridge, L. Franconi, S. Polettini, and J. Stander. A methodological framework for statistical disclosure limitation of business microdata. Technical Report 1.1-D4, CASC Project, 2002.
18. K. Chen and L. Liu. Privacy preserving data classification with rotation perturbation. In ICDM, pages 589-592. IEEE Computer Society, 2005.
19. A. Cooper. A survey of query log privacy-enhancing techniques from a policy perspective. ACM Trans. Web, 2(4): 1-27, 2008.
20. L. H. Cox and J. J. Kim. Effects of rounding on the quality and confidentiality of statistical data. In Privacy in Statistical Databases, volume 4302 of LNCS, pages 48-56, 2006.
21. R. A. Dandekar, J. Domingo-Ferrer, and F. Sebé. Lhs-based hybrid microdata vs rank swapping and microaggregation for numeric microdata protection. In Inference Control in Statistical Databases, pages 153-162. Springer-Verlag, 2002.
22. A. G. DeWaal and L. C. R. J. Willenborg. Global recodings and local suppressions in microdata sets. In Proceedings of Statistics Canada Symposium’95, page 121132, 1995.
23. J. Domingo-Ferrer and J. M. Mateo-Sanz. On resampling for statistical confidentiality in contingency tables. In Computers & Mathematics with Applications, pages 13-32, 1999.
24. J. Domingo-Ferrer and J. M. Mateo-Sanz. Practical data-oriented microaggregation for statistical disclosure control. IEEE TKDE, 14(1): 189-201, 2002.
25. J. Domingo-Ferrer and V. Torra. A Quantitative Comparison of Disclosure Control Methods for Microdata, pages 111-133. Elsevier, 2001.
26. J. Domingo-Ferrer and V. Torra. Distance-based and probabilistic record linkage for re-identification of records with categorical variables. Butlletí de l’ACIA, 28: 243-250, 2002.
27. M. Duckham and L. Kulik. A formal model of obfuscation and negotiation for location privacy. In Pervasive, pages 152-170, 2005.
28. A. V. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In SIGKDD, pages 217-228. ACM, 2002.
29. S. E. Fienberg and J. McIntyre. Data swapping: Variations on a theme by dalenius and reiss. In Privacy in Statistical Databases, volume 3050 of LNCS, pages 14-29. Springer, 2004.
30. S. E. Fienberg. A radical proposal for the provision of micro-data samples and the preservation of confidentiality. Technical Report 611, Carnegie Mellon University Department of Statistics, 1994.
31. A. Florian. An efficient sampling scheme: Updated latin hypercube sampling. J. Probabilistic Engineering Mechanics, 7(2): 123-130, 1992.
32. L. Franconi and J. Stander. A model based method for disclosure limitation of business microdata. Journal of the Royal Statistical Society D-Statistician, 51: 1-11, 2002.
33. B. C. M. Fung, K. Wang, and P. S. Yu. Top-down specialization for information and privacy preservation. In ICDE, pages 205-216, 2005.
34. M. Gruteser and X. Liu. Protecting privacy in continuous locationtracking applications. IEEE Security & Privacy, 2(2): 28-34, 2004.
35. B. Hoh and M. Gruteser. Protecting location privacy through path confusion. In SECURECOMM '05, pages 194-205. IEEE Computer Society, 2005.
36. V. S. Iyengar. Transforming data to satisfy privacy constraints. In KDD, pages 279-288. ACM, 2002.
37. W. Johnson and J. Lindenstrauss. Extensions of Lipshitz mapping into Hilbert space. Contemporary Math., 26: 189-206, 1984.
38. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In ICDM '03, page 99. IEEE Computer Society, 2003.
39. H. Kido, Y. Yanagisawa, and T. Satoh. An anonymous communication technique using dummies for location-based services. In International Conference on Pervasive Services, pages 88-97. IEEE Computer Society, 2005.
40. H. Kido, Y.Yanagisawa, and T. Satoh. Protection of location privacy using dummies for location-based services. In ICDE Workshops, page 1248, 2005.
41. J. J. Kim. A method for limiting disclosure in microdata based on random noise and transformation. In Survey Research Method Section, American Statistical Association, pages 370-374, 1986.
42. P. Kooiman, L. Willenborg, and J. Gouweleeuw. Pram: A method for disclosure limitation of microdata. Research paper no. 9705, 1997.
43. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD, pages 49-60. ACM, 2005.
44. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE, pages 106-115. IEEE, 2007.
45. K. Liu, H. Kargupta, and J. Ryan. Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE TKDE, 18(1): 92-106, 2006.
46. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In ICDE, page 24. IEEE Computer Society, 2006.
47. B. Malin. Protecting DNA sequence anonymity with generalization lattices. Methods of Information in Medicine, 44(5): 687-692, 2005.
48. S. Mascetti, C. Bettini, X. S. Wang, and S. Jajodia. k-anonymity in databases with timestamped data. In TIME, pages 177-186, 2006.
49. J. M. Mateo-Sanz, A. Martinez-Balleste, and J. Domingo-Ferrer. Fast generation of accurate synthetic microdata. In Privacy in Statistical Databases, vol.3050 of LNCS, pages 298-306. Springer, 2004.
50. A. Meyerson and R. Williams. On the complexity of optimal kanonymity. In PODS '04, pages 223-228. ACM, 2004.
51. M. E. Nergiz, M. Atzori, and Y. Saygin. Perturbation-driven anonymization of trajectories. Technical Report 2007-TR-017, ISTI-CNR, Pisa, Italy, 2007. 10 pages.
52. A. Oganian and J. Domingo-Ferrer. On the complexity of optimal microaggregation for statistical disclosure control. Statistical Journal of the United Nations Economic Comission for Europe, 18: 345-354, 2001.
53. S. R. M. Oliveira and O. R. Zaiane. Privacy preserving clustering by data transformation. In SBBD, pages 304-318, 2003.
54. S. R. M. Oliveira and O. R. Zaiane. Data perturbation by rotation for privacypreserving clustering. Technical Report TR04-17, Department of Computing Science, University of Alberta, Edmonton, Canada, 2004.
55. Federal Committee on Statistical Methodology. Statistical policy working paper 22, may 1994. Report on Statistical Disclosure Limitation Methodology.
56. R. G. Pensa, A. Monreale, F. Pinelli, and D. Pedreschi. Patternpreserving k-anonymization of sequences and its application to mobility data mining. In PiLBA, 2008.
57. S. Rizvi and J. R. Haritsa. Maintaining data privacy in association rule mining. In VLDB, pages 682-693, 2002.
58. D. B. Rubin. Discussion of statistical disclosure limitation. Journal of Official Statistics, (9(2)): 461-468, 1993.
59. P. Samarati. Protecting respondents’ identities in microdata release. IEEE TKDE, 13(6): 1010-1027, 2001.
60. A. C. Singh, F. Yu, and G. H. Dunteman. Massc: A new data mask for limiting statistical information loss and disclosure. In The Joint UNECE/EUROSTAT Work Session on Statistical Data Confidentiality, pages 373-394, 2003.
61. G. R. Sullivan. The use of added error to avoid disclosure in microdata releases. PhD thesis, Ames, IA, USA, 1989. Supervisor-Fuller, Wayne A.
62. L. Sweeney. Uniqueness of simple demographics in the U.S. population. Technical report, Laboratory for International Data Privacy, Carnegie Mellon University, Pittsburgh, PA, 2000.
63. L. Sweeney. k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems, 2002.
64. M. Terrovitis and N. Mamoulis. Privacy preservation in the publication of trajectories. In MDM, pages 65-72, 2008.
65. K. Wang, P. S. Yu, and S. Chakraborty. Bottom-up generalization: A data mining solution to privacy protection. In ICDM, pages 249-256. IEEE Computer Society, 2004.
66. L. Willenborg and T. DeWaal. Elements of Statistical Disclosure Control. Springer-Verlag, 2001.
67. W. E. Winkler. Using simulated annealing for k-anonymity. Technical Report 7, US Census Bureau.
68. X. Xiao and Y. Tao. Anatomy: Simple and effective privacy preservation. In VLDB, pages 139-150. ACM, 2006.
69. R. Yarovoy, F. Bonchi, L. V. S. Lakshmanan, and W. H. Wang. Anonymizing moving objects: how to hide a mob in a crowd? In EDBT, pages 72-83, 2009.
70. J. Z. Zhan, S. Matwin, and L. Chang. Privacy-preserving collaborative association rule mining. In DBSec, pages 153-165, 2005.
71. P. Zhang, Y. Tong, S. Tang, and D. Yang. Privacy preserving Naive Bayes classification. In ADMA, volume 3584 of LNCS, pages 744-752. Springer, 2005.
72. B. Zhou, J. Pei, and W. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explor. Newsl., 10(2): 12-22, 2008.