Limiting privacy breaches in privacy preserving data mining

@inproceedings{Evfimievski2003LimitingPB,
  title={Limiting privacy breaches in privacy preserving data mining},
  author={Alexandre V. Evfimievski and Johannes Gehrke and Ramakrishnan Srikant},
  booktitle={PODS '03},
  year={2003}
}
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The model is then built over the randomized data, after first compensating for the randomization (at the aggregate level). This approach is potentially vulnerable to privacy breaches: based on the… Expand
Data transformation for privacy-preserving data mining
TLDR
This thesis proposes a unified framework for privacy-preserving data mining that ensures that the mining process will not violate privacy up to a certain degree of security, and demonstrates the practicality and feasibility of achieving privacy preservation in data mining. Expand
Privacy-Preserving Data Mining
  • A. Evfimievski
  • Computer Science
  • Encyclopedia of Machine Learning and Data Mining
  • 2017
TLDR
Privacy-preserving data mining (PPDM) refers to the area of data mining that seeks to safeguard sensitive information from unsolicited or unsanctioned disclosure, while privacy preservation is primarily concerned with protecting against disclosure individual data records. Expand
Privacy-Preserving Data Mining
TLDR
Privacy-preserving data mining (PPDM) refers to the area of data mining that seeks to safeguard sensitive information from unsolicited or unsanctioned disclosure, while privacy preservation is primarily concerned with protecting against disclosure individual data records. Expand
The applicability of the perturbation based privacy preserving data mining for real-world data
TLDR
An individually adaptable perturbation model is proposed, which enables the individuals to choose their own privacy levels and a simple but effective and yet efficient technique to build data mining models from perturbed data is suggested. Expand
Mining association rules with non-uniform privacy concerns
TLDR
This paper generalizes the privacy preserving association rule mining problem by allowing different attributes to have different levels of privacy, that is, using different randomization factors for values of different attributes in the randomization process, and proposes an efficient algorithm RE (Recursive Estimation) to estimate the support of itemsets under this framework. Expand
Privacy Issues in Association Rule Mining
TLDR
This chapter study the different aspects of privacy that arise in association rule mining, with special emphasis on input data privacy, output rule privacy and owner privacy, and presents a taxonomy and a survey of recent approaches to the association rule hiding problem. Expand
Privacy preserving data mining over vertically partitioned data
TLDR
This thesis argues that it is indeed possible to have efficient and practical techniques for useful privacy-preserving mining of knowledge from large amounts of data and presents several privacy preserving data mining algorithms operating over vertically partitioned data. Expand
Privacy-Preserving Classification of Customer Data without Loss of Accuracy
TLDR
This paper proposes a simple cryptographic approach that is e‐cient even in a many-customer setting, provides strong privacy for each customer, and does not lose any accuracy as the cost of privacy. Expand
A novel privacy preserving method for data publication
TLDR
A novel privacy preserving method for data publication is proposed based on conditional probability distribution and machine learning techniques, which can achieve different prior beliefs for different transactions and offer stronger privacy guarantee, while retaining better data utility. Expand
Anonymity-preserving data collection
TLDR
This paper proposes efficient cryptographic techniques for online data collection in which data from a large number of respondents is collected anonymously, without the help of a trusted third party, and extends the solution to tolerate certain kinds of malicious behavior of the participants. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Privacy Preserving Data Mining
TLDR
This work considers a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information, and proposes a protocol that is considerably more efficient than generic solutions and demands both very few rounds of communication and reasonable bandwidth. Expand
On the design and quantification of privacy preserving data mining algorithms
TLDR
It is proved that the EM algorithm converges to the maximum likelihood estimate of the original distribution based on the perturbed data, and proposed metrics for quantification and measurement of privacy-preserving data mining algorithms are proposed. Expand
Privacy preserving mining of association rules
TLDR
A class of randomization operators are proposed that are much more effective than uniform randomization in limiting the breaches of privacy breaches and derived formulae for an unbiased support estimator and its variance are derived. Expand
Data Swapping: Balancing Privacy against Precision in Mining for Logic Rules
TLDR
It is argued that in data mining the major requirement of security control mechanism is not to ensure precise and bias-free statistics, but rather to preserve the high-level descriptions of knowledge constructed by artificial data mining tools. Expand
Maintaining Data Privacy in Association Rule Mining
TLDR
This work presents a scheme, based on probabilistic distortion of user data, that can simultaneously provide a high degree of privacy to the user and retain a high level of accuracy in the mining results. Expand
Privacy preserving association rule mining
  • Y. Saygin, V. Verykios, A. Elmagarmid
  • Computer Science
  • Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002
  • 2002
TLDR
New metrics are introduced in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining, and it is shown that the complexity of the new heuristics is similar to that of the original algorithms. Expand
Privacy-preserving distributed mining of association rules on horizontally partitioned data
TLDR
This work addresses secure mining of association rules over horizontally partitioned data by incorporating cryptographic techniques to minimize the information shared, while adding little overhead to the mining task. Expand
SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING
TLDR
This position paper discusses possible problems and solutions in data mining, and outlines ideas for further research in this area. Expand
Fast Algorithms for Mining Association Rules
TLDR
Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. Expand
Communication theory of secrecy systems
  • C. Shannon
  • Mathematics, Computer Science
  • Bell Syst. Tech. J.
  • 1949
TLDR
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography. Expand
...
1
2
3
4
...