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

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

Related Articles

Road Railway Safety System to Avert Accident in Unmanned LC

Railway transportation is one of the safest modes of transport. In unmanned level crossing the number of horrible fatal accidents that road vehicle driver and pedestrians cause. To reduce the accident in LC to introduce...

Seismic Analysis & Design of Multistorey Steel Building

Steel is one of the most widely used material for building construction in the world .The inherent strength, toughness and high ductility of steel are characteristics that are ideal for seismic design. To utilize these...

An Adaptive Rate Aware Session Admission Control for Mobile Ad Hoc Networks

Providing quality of service (QoS) guarantee in a mobile ad hoc network (MANET) is not easy due to node mobility, contention for channel access, a lack of central synchronization, and the unpredictable nature of the wir...

Strength Properties of Concrete by Replacing Coarse Aggregate with Blast Furnace Slag and Fine Aggregate with Crusher Dust

The demand of river sand in the construction industry has consequently increased due to Urbanization and mass construction of housing resulting in the reduction of natural sources and also an increase in price. In such...

Deduplicating Data in Cloud and Secure Auditing

As the cloud computing technology develops during the last decade, outsourcing data to cloud service for storage becomes an attractive trend, which benefits in sparing efforts on heavy data maintenance and management. N...

Download PDF file
  • EP ID EP19150
  • DOI -
  • Views 696
  • Downloads 23

How To Cite

Padmapriya. G, Dr. M. Hemalatha (2014). Distributed Privacy preserving and Handling Privacy information leakage by using k -anonymity algorithm. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 2(12), -. https://europub.co.uk/articles/-A-19150