Distributed Privacy preserving and Handling Privacy information leakage by using k -anonymity algorithm

Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2014, Vol 2, Issue 12

Abstract

There is increasing pressure to share health information and even make it publicly available. However, such disclosures of personal health information raise serious privacy concerns. To alleviate such concerns, it is possible to anonymize the data before disclosure. One popular anonymization approach is k-anonymity. There have been no evaluations of the actual re-identification probability of k-anonymized data sets. Through a simulation, we evaluated the re-identification risk of k-anonymization and three different improvements on three large data sets. Re-identification probability is measured under two different re-identification scenarios. Information loss is measured by the commonly used discernability metric. For one of the re-identification scenarios, k-Anonymity consistently over-anonymous data sets, with this over-anonymization being most pronounced with small sampling fractions. Over-anonymization results in excessive distortions in the data (i.e., high information loss), making the data less useful for subsequent analysis. We found that a hypothesis testing approach provided the best control over re-identification risk and reduces the extent of information loss compared to baseline kanonymity. Guidelines are provided on when to use the hypothesis testing approach instead of baseline k-anonymity.

Authors and Affiliations

Padmapriya. G, Dr. M. Hemalatha

Keywords