K-anonymization incremental maintenance and optimization techniques
Proceedings of the 2007 ACM symposium on Applied computing
Rethinking rank swapping to decrease disclosure risk
Data & Knowledge Engineering
The fitness-rough: A new attribute reduction method based on statistical and rough set theory
Intelligent Data Analysis
Protecting privacy in recorded conversations
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
Towards the evaluation of time series protection methods
Information Sciences: an International Journal
A new framework to automate constrained microaggregation
Proceedings of the ACM first international workshop on Privacy and anonymity for very large databases
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Measuring risk and utility of anonymized data using information theory
Proceedings of the 2009 EDBT/ICDT Workshops
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
Using classification methods to evaluate attribute disclosure risk
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
Edit constraints on microaggregation and additive noise
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Information fusion in data privacy: A survey
Information Fusion
Kd-trees and the real disclosure risks of large statistical databases
Information Fusion
The Journal of Supercomputing
Hi-index | 0.00 |
Inference control for protecting the privacy of microdata (individual data) should try to optimize the tradeoff between data utility (low information loss) and protection against disclosure (low disclosure risk). Whereas risk measures are bounded between 0 and 1, information loss measures proposed in the literature for continuous data are unbounded, which makes it awkward to trade off information loss for disclosure risk. We propose in this paper to use probabilities to define bounded information loss measures for continuous microdata.