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
Related Articles
- EP ID EP19150
- DOI -
- Views 670
- Downloads 23
Study of Geotechnical Properties of Cement Stabilized Gravelly SOIL
Pavement generally consists of base and sub-base, which are constructed from suitable materials. When no suitable material is available and it is expensive to bring material from distant sources; an alternative way whic...
slugAn Energy Saving Adaptive Clustering for Wsn
Routing in Wireless Sensor Networks is different from routing in AD-HOC networks as nodes are randomly deployed. There are three types of routing in the WSNs: Flat, Hierarchical and Location Based Routing. The paper di...
Design and Implementation Various Logic Circuits Using GDI Technique
Area and power are the 2 very important problems in analog circuit style and synthesis of VLSI circuits that depends on varied vital style parameters. The aim of this paper is to style varied logic gates, Comparator and...
Theft Prevention for Improvising Authenticity and Security of Automated Teller Machine System
Attacks on ATM are on the increase world-wide. The cash handling, financial and banking companies have always taken the threat of villainous attacks very seriously and are constantly striving to improve their security m...
slugA Review paper on Routing Protocol Comparison
This paper presents a broad study on the work of common MANET (mobile adhoc network) routing protocols. The routing protocols used in this study include AODV, DSR and DSDV which consist of a mixture of reactive and proa...