SW-SDF Based Personal Privacy with QIDB-Anonymization Method
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2012, Vol 3, Issue 8
Abstract
Personalized anonymization is a method in which a guarding node is used to indicate whether the record owner is ready to reveal its sensitivity based on which anonymization will be performed. Most of the sensitive values that are present in the private data base do not require privacy preservation since the record owner sensitivity is a general one. So there are only few records in the entire distribution that require privacy. For example a record owner having disease flu doesn’t mind revealing his identity as compared to record owner having disease cancer. Even in this some of the record owners who have cancer are ready to reveal their identity, this is the motivation for SW-SDF based Personal Privacy. In this paper we propose a novel personalized privacy preserving technique that over comes the disadvantages of previous personalized privacy and other anonymization techniques. The core of this method can be divided in to two major components. The first component deals with additional attribute used in the table which is in the form of flags which can be used to divide sensitive attribute. Sensitive Disclosure Flag (SDF) determines whether record owner sensitive information is to be disclosed or whether privacy should be maintained. The second flag that we are using is Sensitive Weigh (SW) which indicates how much sensitive the attribute value is as compared with the rest. Second section deals with a novel representation called Frequency Distribution Block (FDB) and Quasi–Identifier Distribution Block(QIDB) which is used in anonymization. Experimental result show that it has lesser information loss and faster execution time as compared with existing methods.
Authors and Affiliations
Kiran P, Dr Kavya P
Keywords
Related Articles
- EP ID EP150975
- DOI -
- Views 120
- Downloads 0
Distributed GPU-Based K-Means Algorithm for Data-Intensive Applications: Large-Sized Image Segmentation Case
K-means is a compute-intensive iterative algorithm. Its use in a complex scenario is cumbersome, specifically in data-intensive applications. In order to accelerate the K-means running time for data-intensive application...
Security Analysis of Image Cryptosystem Using Stream Cipher Algorithm with Nonlinear Filtering Function
In this work a new algorithm for encryption image is introduced. This algorithm makes it possible to cipher and decipher images by guaranteeing a maximum security. The algorithm introduced is based on stream cipher with...
Using Hybrid Evolutionary Algorithm based Adaptive Filtering
Noise degrades the overall efficiency of the data transmission in the networking models which is no different in Cognitive Radio Adhoc Networks (CRAHNs). For efficient opportunistic routing in CRAHN, the Modified SMOR (M...
Fairness Enhancement Scheme for Multimedia Applications in IEEE 802.11e Wireless LANs
Multimedia traffic should be transmitted to a receiver within the delay bound. The traffic is discarded when breaking its delay bound. Then, QoS (Quality of Service) of the traffic and network performance are lowered. Th...
An Agent-based Simulation for Studying Air Pollution from Traffic in Urban Areas: The Case of Hanoi City
In urban areas, traffic is one of the main causes of air pollution. Establishing an effective solution to raise public awareness of this phenomenon could help to significantly reduce the level of pollution in urban areas...