T-Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing

2018 ◽  
Vol 30 (3) ◽  
pp. 438-453 ◽  
Author(s):  
Mingzheng Wang ◽  
Zhengrui Jiang ◽  
Yu Zhang ◽  
Haifang Yang
2020 ◽  
Vol 17 (9) ◽  
pp. 4623-4626
Author(s):  
Nisha Nehra ◽  
Suneet Kumar

Now days, due to the sheer amount of data, its complexity and the rate at which it is generated, traditional algorithms that are present so far for the privacy preservation of relation data publishing are not capable enough to ensure privacy as efficiently for transactional data also. From last two decades the interest also increases to provide better data preserving schemes for data publishing. There are a number of algorithms, schemes, models and techniques in the literature that ensure privacy against identity disclosure and attribute disclosure attacks. This paper is a comprehensive survey of the past work done in the field of anonymization to provide privacy against transactional data publishing.


2021 ◽  
Vol 11 (12) ◽  
pp. 3164-3173
Author(s):  
R. Indhumathi ◽  
S. Sathiya Devi

Data sharing is essential in present biomedical research. A large quantity of medical information is gathered and for different objectives of analysis and study. Because of its large collection, anonymity is essential. Thus, it is quite important to preserve privacy and prevent leakage of sensitive information of patients. Most of the Anonymization methods such as generalisation, suppression and perturbation are proposed to overcome the information leak which degrades the utility of the collected data. During data sanitization, the utility is automatically diminished. Privacy Preserving Data Publishing faces the main drawback of maintaining tradeoff between privacy and data utility. To address this issue, an efficient algorithm called Anonymization based on Improved Bucketization (AIB) is proposed, which increases the utility of published data while maintaining privacy. The Bucketization technique is used in this paper with the intervention of the clustering method. The proposed work is divided into three stages: (i) Vertical and Horizontal partitioning (ii) Assigning Sensitive index to attributes in the cluster (iii) Verifying each cluster against privacy threshold (iv) Examining for privacy breach in Quasi Identifier (QI). To increase the utility of published data, the threshold value is determined based on the distribution of elements in each attribute, and the anonymization method is applied only to the specific QI element. As a result, the data utility has been improved. Finally, the evaluation results validated the design of paper and demonstrated that our design is effective in improving data utility.


2018 ◽  
Vol 8 (5) ◽  
pp. 783 ◽  
Author(s):  
A Hasan ◽  
Qingshan Jiang ◽  
Hui Chen ◽  
Shengrui Wang

2015 ◽  
Vol 10 (7) ◽  
pp. 239-247 ◽  
Author(s):  
Hatem Rashid Asmaa ◽  
Binti Mohd Yasin Norizan

Sign in / Sign up

Export Citation Format

Share Document