scholarly journals Data mining as a tool in privacy-preserving data publishing

2010 ◽  
Vol 45 (1) ◽  
pp. 151-159 ◽  
Author(s):  
Michal Sramka
Keyword(s):  
Data Mining ◽  
Decision Making ◽  
Data Analysis ◽  
Privacy Preserving ◽  
Data Publishing ◽  
Sensitive Information ◽  
Private Data ◽  
Privacy Preserving Data Publishing

ABSTRACTMany databases contain data about individuals that are valuable for research, marketing, and decision making. Sharing or publishing data about individuals is however prone to privacy attacks, breaches, and disclosures. The concern here is about individuals’ privacy-keeping the sensitive information about individuals private to them. Data mining in this setting has been shown to be a powerful tool to breach privacy and make disclosures. In contrast, data mining can be also used in practice to aid data owners in their decision on how to share and publish their databases. We present and discuss the role and uses of data mining in these scenarios and also briefly discuss other approaches to private data analysis.

Anonymization Based on Improved Bucketization (AIB): A Privacy-Preserving Data Publishing Technique for Improving Data Utility in Healthcare Data

2021 ◽  
Vol 11 (12) ◽  
pp. 3164-3173
Author(s):  
R. Indhumathi ◽  
S. Sathiya Devi
Keyword(s):  
Medical Information ◽  
Threshold Value ◽  
Privacy Preserving ◽  
Data Publishing ◽  
Published Data ◽  
Sensitive Information ◽  
Data Utility ◽  
Healthcare Data ◽  
Privacy Preserving Data Publishing ◽  
Horizontal Partitioning

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.

scholarly journals Efficiently Supporting Online Privacy-Preserving Data Publishing in a Distributed Computing Environment

2021 ◽  
Vol 11 (22) ◽  
pp. 10740
Author(s):  
Jong Kim
Keyword(s):  
Personal Information ◽  
Privacy Preserving ◽  
Online Privacy ◽  
Data Publishing ◽  
Sensitive Information ◽  
Data Anonymization ◽  
Query Result ◽  
Individual Entity ◽  
Privacy Preserving Data Publishing ◽  
Increasing Demand

There has recently been an increasing need for the collection and sharing of microdata containing information regarding an individual entity. Because microdata typically contain sensitive information on an individual, releasing it directly for public use may violate existing privacy requirements. Thus, extensive studies have been conducted on privacy-preserving data publishing (PPDP), which ensures that any microdata released satisfy the privacy policy requirements. Most existing privacy-preserving data publishing algorithms consider a scenario in which a data publisher, receiving a request for the release of data containing personal information, anonymizes the data prior to publishing—a process that is usually conducted offline. However, with the increasing demand for the sharing of data among various parties, it is more desirable to integrate the data anonymization functionality into existing systems that are capable of supporting online query processing. Thus, we developed a novel scheme that is able to efficiently anonymize the query results on the fly, and thus support efficient online privacy-preserving data publishing. In particular, given a user’s query, the proposed approach effectively estimates the generalization level of each quasi-identifier attribute, thereby achieving the k-anonymity property in the query result datasets based on the statistical information without applying k-anonymity on all actual datasets, which is a costly procedure. The experiment results show that, through the proposed method, significant gains in processing time can be achieved.

Privacy-Preserving Data Mining

2009 ◽  
pp. 527-536 ◽  
Author(s):  
Alexandre Evfimievski ◽  
Tyrone Grandison
Keyword(s):  
Data Mining ◽  
Privacy Preservation ◽  
Statistical Processing ◽  
Privacy Preserving ◽  
Third Party ◽  
Data Publishing ◽  
Sensitive Information ◽  
Public Servants ◽  
Data Set ◽  
Privacy Preserving Data Mining

Privacy-preserving data mining (PPDM) refers to the area of data mining that seeks to safeguard sensitive information from unsolicited or unsanctioned disclosure. Most traditional data mining techniques analyze and model the data set statistically, in aggregated form, while privacy preservation is primarily concerned with protecting against disclosure of individual data records. This domain separation points to the technical feasibility of PPDM. Historically, issues related to PPDM were first studied by the national statistical agencies interested in collecting private social and economical data, such as census and tax records, and making it available for analysis by public servants, companies, and researchers. Building accurate socioeconomical models is vital for business planning and public policy. Yet, there is no way of knowing in advance what models may be needed, nor is it feasible for the statistical agency to perform all data processing for everyone, playing the role of a trusted third party. Instead, the agency provides the data in a sanitized form that allows statistical processing and protects the privacy of individual records, solving a problem known as privacypreserving data publishing. For a survey of work in statistical databases, see Adam and Wortmann (1989) and Willenborg and de Waal (2001).

scholarly journals K-Anonymity Versus L-Diversity: A Comparative Analysis on Data Anonymization Techniques

2018 ◽  
Vol 7 (3.4) ◽  
pp. 24
Author(s):  
Dr Sowmyarani C N ◽  
Dr Dayananda P
Keyword(s):  
Decision Making ◽  
Comparative Analysis ◽  
Privacy Preserving ◽  
Data Publishing ◽  
Original Form ◽  
Specific Information ◽  
Specific Data ◽  
Data Anonymization ◽  
Privacy Preserving Data Publishing

The main aim of data publishing is to make the data utilized by the researchers, scientists and data analysts to process the data by analytics and statistics which in turn useful for decision making. This data in its original form may contain some person-specific information, which should not be disclosed while publishing the data. So, privacy of such individuals should be preserved. Hence, privacy preserving data publishing plays a major role in providing privacy for person-specific data. The data should be published in such a way that, there should not be any technical way for adversary to infer the information of specific individuals. This paper provides overview on popular privacy preserving techniques. In this study, a honest effort shows that, concepts behind these techniques are analyzed and justified with suitable examples, drawbacks and vulnerability of these techniques towards privacy attacks are narrated.  

scholarly journals Privacy preserving data publishing: Review

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

scholarly journals Efficient and Privacy-Preserving Multi-User Outsourced K-Means Clustering

2021 ◽  
Vol 14 (2) ◽  
pp. 26
Author(s):  
Na Li ◽  
Lianguan Huang ◽  
Yanling Li ◽  
Meng Sun
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Clustering Algorithm ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Sensitive Information ◽  
The Public ◽  
Big Data Mining ◽  
Euclidean Distances ◽  
Computational Resources

In recent years, with the development of the Internet, the data on the network presents an outbreak trend. Big data mining aims at obtaining useful information through data processing, such as clustering, clarifying and so on. Clustering is an important branch of big data mining and it is popular because of its simplicity. A new trend for clients who lack of storage and computational resources is to outsource the data and clustering task to the public cloud platforms. However, as datasets used for clustering may contain some sensitive information (e.g., identity information, health information), simply outsourcing them to the cloud platforms can't protect the privacy. So clients tend to encrypt their databases before uploading to the cloud for clustering. In this paper, we focus on privacy protection and efficiency promotion with respect to k-means clustering, and we propose a new privacy-preserving multi-user outsourced k-means clustering algorithm which is based on locality sensitive hashing (LSH). In this algorithm, we use a Paillier cryptosystem encrypting databases, and combine LSH to prune off some unnecessary computations during the clustering. That is, we don't need to compute the Euclidean distances between each data record and each clustering center. Finally, the theoretical and experimental results show that our algorithm is more efficient than most existing privacy-preserving k-means clustering.

scholarly journals Privacy Preserving In Data Mining with No Data Loss with a Combinational Scheme

2019 ◽  
Vol 8 (4S3) ◽  
pp. 457-459
Keyword(s):  
Data Mining ◽  
Privacy Preserving ◽  
Data Reconstruction ◽  
Sensitive Information ◽  
Data Loss ◽  
Data Mining Technique ◽  
Information Mining ◽  
Mining Technique

Large amounts of data collected by many organizations under-goes data mining for various purposes like analysis and prediction. During data mining tasks, the sensitive information may be losing its privacy. Hence, Privacyprotection or preservation is becomes major issue for the organizations. Publishing data or sharing information for mining with Privacypreservation is possible through Privacypreserve data mining technique (PPDM). Existing techniques are not able to withstand for some attacks and some suffers with data misfortune. In our paper we conventional an effective and combinational approach for security safeguarding in information mining. Our approach with can withstand from different kinds of assaults and limits data misfortune and increases data re-usability with data reconstruction capability

Sign in / Sign up

Export Citation Format

Share Document