AN ANALYSIS OF PRIVACY RISKS AND DESIGN PRINCIPLES FOR DEVELOPING COUNTERMEASURES IN PRIVACY PRESERVING SENSITIVE DATA PUBLISHING

Government Agencies and many other organizations often need to publish sensitive data ‐ tables that contain unaggregated information about individuals. Sensitive data is a valuable source of information for the research and allocation of public funds, trend analysis and medical research. Publishing data abou t individuals without revealing sensitive information about them is a significant problem. A breach in t he security of a sensitive data may expose the private information of an individual, or the interception of a private communication may compromise the security of a sensitive data. Private and Sensitive informati on is integral to many data repositories. The efficien cy of privacy preserving data mining is crucial to many times‐sensitive applications like medical data, vot er registration data, census data, social network d ata and customer data. Where information dissemination is q uick and easy, both individuals and custodians of d ata are getting increasingly cautious about privacy, se curity and ethical issues. In this paper privacy ri sks in publishing sensitive data and the design principles for developing counter measures are proposed. The main contributions of this study are four folds. First, domain knowledge about the Privacy and related issues is described. Secondly the definition of the utility o f released data with reference to social network mo del is discussed. In the third fold, knowledge based attac ks; vulnerabilities and risk analysis are given. Fi nally, the design considerations for developing countermeasures in privacy preserving sensitive data publishing a re presented.

[1]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2010, The VLDB Journal.

[2]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[3]  Murat Kantarcioglu,et al.  An architecture for privacy-preserving mining of client information , 2002 .

[4]  K. Liu,et al.  Towards identity anonymization on graphs , 2008, SIGMOD Conference.

[5]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[6]  Charu C. Aggarwal,et al.  On the design and quantification of privacy preserving data mining algorithms , 2001, PODS.

[7]  G. Singaravel,et al.  A new model for privacy preserving sensitive Data Mining , 2012, 2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12).

[8]  Ashwin Machanavajjhala,et al.  l-Diversity: Privacy Beyond k-Anonymity , 2006, ICDE.

[9]  Lei Zou,et al.  K-Automorphism: A General Framework For Privacy Preserving Network Publication , 2009, Proc. VLDB Endow..

[10]  Balachander Krishnamurthy,et al.  Class-based graph anonymization for social network data , 2009, Proc. VLDB Endow..

[11]  David J. DeWitt,et al.  Mondrian Multidimensional K-Anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).