Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Data Privacy through Optimal k-Anonymization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Incognito: efficient full-domain K-anonymity
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Mondrian Multidimensional K-Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Privacy Protection: p-Sensitive k-Anonymity Property
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Personalized privacy preservation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
K-anonymization incremental maintenance and optimization techniques
Proceedings of the 2007 ACM symposium on Applied computing
Hiding the presence of individuals from shared databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
M-invariance: towards privacy preserving re-publication of dynamic datasets
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Minimality attack in privacy preserving data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Fast data anonymization with low information loss
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Privacy skyline: privacy with multidimensional adversarial knowledge
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Preservation of proximity privacy in publishing numerical sensitive data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
(t, λ)-Uniqueness: Anonymity Management for Data Publication
ICIS '08 Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)
A framework for efficient data anonymization under privacy and accuracy constraints
ACM Transactions on Database Systems (TODS)
Towards Preference-Constrained k-Anonymisation
Database Systems for Advanced Applications
User-controlled generalization boundaries for p-sensitive k-anonymity
Proceedings of the 2010 ACM Symposium on Applied Computing
Efficient k-anonymization using clustering techniques
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Semi-Edge anonymity: graph publication when the protection algorithm is available
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
An automated data utility clustering methodology using data constraint rules
Proceedings of the 2012 international workshop on Smart health and wellbeing
Graph publication when the protection algorithm is available
Data & Knowledge Engineering
Hi-index | 0.00 |
Numerous privacy models based on the k-anonymity property and extending the k-anonymity model have been introduced in the last few years in data privacy research: l-diversity, p-sensitive k-anonymity, (α, k) anonymity, t-closeness, etc. While differing in their methods and quality of their results, they all focus first on masking the data, and then protecting the quality of the data as a whole. We consider a new approach, where requirements on the amount of distortion allowed on the initial data are imposed in order to preserve its usefulness. Our approach consists of specifying quasiidentifiers' generalization constraints, and achieving p-sensitive k-anonymity within the imposed constraints. We think that limiting the amount of allowed generalization when masking microdata is indispensable for real life datasets and applications. In this paper, the constrained p-sensitive k-anonymity model is introduced and an algorithm for generating constrained p-sensitive k-anonymous microdata is presented. Our experiments have shown that the proposed algorithm is comparable with existing algorithms used for generating p-sensitive k-anonymity with respect to the results' quality, and obviously the obtained masked microdata complies with the generalization constraints as indicated by the user.