Utility-driven anonymization in data publishing

Authors:
Mingqiang Xue;Panagiotis Karras;Chedy Raïssi;Hung Keng Pung
Affiliations:
National University of Singapore, Singapore, Singapore;Rutgers University, Newark, NJ, USA;INRIA, Nancy Grand-Est, France;National University of Singapore, Singapore, Singapore
Venue:
Proceedings of the 20th ACM international conference on Information and knowledge management
Year:
2011

Citing 11
Cited 1

Privacy-preserving data mining

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Protecting Respondents' Identities in Microdata Release

IEEE Transactions on Knowledge and Data Engineering
Limiting privacy breaches in privacy preserving data mining

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
A privacy-preserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms

The VLDB Journal — The International Journal on Very Large Data Bases
A framework for efficient data anonymization under privacy and accuracy constraints

ACM Transactions on Database Systems (TODS)
On Anti-Corruption Privacy Preserving Publication

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Closeness: A New Privacy Measure for Data Publishing

IEEE Transactions on Knowledge and Data Engineering
Boosting the accuracy of differentially private histograms through consistency

Proceedings of the VLDB Endowment
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness

The VLDB Journal — The International Journal on Very Large Data Bases

Discretionary social network data revelation with a user-centric utility guarantee

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Privacy-preserving data publication has been studied intensely in the past years. Still, all existing approaches transform data values by random perturbation or generalization. In this paper, we introduce a radically different data anonymization methodology. Our proposal aims to maintain a certain amount of patterns, defined in terms of a set of properties of interest that hold for the original data. Such properties are represented as linear relationships among data points. We present an algorithm that generates a set of anonymized data that strictly preserves these properties, thus maintaining specified patterns in the data. Extensive experiments with real and synthetic data show that our algorithm is efficient, and produces anonymized data that affords high utility in several data analysis tasks while safeguarding privacy.