Anonymity for continuous data publishing

Authors:
Benjamin C. M. Fung;Ke Wang;Ada Wai-Chee Fu;Jian Pei
Affiliations:
Concordia University, Montreal, QC, Canada;Simon Fraser University, Burnaby, BC, Canada;The Chinese University of Hong Kong;Simon Fraser University, Burnaby, BC, Canada
Venue:
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Year:
2008

Citing 13
Cited 22

k-anonymity: a model for protecting privacy

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Top-Down Specialization for Information and Privacy Preservation

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On the complexity of optimal K-anonymity

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incognito: efficient full-domain K-anonymity

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Template-Based Privacy Preservation in Classification Problems

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
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
Anonymizing sequential releases

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
(α, 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
M-invariance: towards privacy preserving re-publication of dynamic datasets

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Anonymizing Classification Data for Privacy Preservation

IEEE Transactions on Knowledge and Data Engineering
Maintaining K-Anonymity against Incremental Updates

SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Secure anonymization for incremental datasets

SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management

Composition attacks and auxiliary information in data privacy

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy preserving serial data publishing by role composition

Proceedings of the VLDB Endowment
Privacy-preserving data mashup

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Continuous privacy preserving publishing of data streams

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Privacy protection for RFID data

Proceedings of the 2009 ACM symposium on Applied Computing
Privacy-preserving data publishing for cluster analysis

Data & Knowledge Engineering
Anonymizing location-based RFID data

C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Cor-Split: Defending Privacy in Data Re-publication from Historical Correlations and Compromised Tuples

SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Privacy-preserving data publishing: A survey of recent developments

ACM Computing Surveys (CSUR)
An online framework for publishing privacy-sensitive location traces

Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Extending l-diversity to generalize sensitive data

Data & Knowledge Engineering
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness

The VLDB Journal — The International Journal on Very Large Data Bases
Cloning for privacy protection in multiple independent data publications

Proceedings of the 20th ACM international conference on Information and knowledge management
Limiting disclosure of sensitive data in sequential releases of databases

Information Sciences: an International Journal
CMOA: continuous moving object anonymization

Proceedings of the 16th International Database Engineering & Applications Sysmposium
Privacy-preserving deletion to generalization-based anonymous database

Proceedings of the CUBE International Information Technology Conference
Generically extending anonymization algorithms to deal with successive queries

Proceedings of the 21st ACM international conference on Information and knowledge management
A Knowledge Model Sharing Based Approach to Privacy-Preserving Data Mining

Transactions on Data Privacy
An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud

Journal of Computer and System Sciences
Updating outsourced anatomized private databases

Proceedings of the 16th International Conference on Extending Database Technology
Anonymizing sequential releases under arbitrary updates

Proceedings of the Joint EDBT/ICDT 2013 Workshops
Incremental processing and indexing for k, e-anonymisation

International Journal of Information and Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

k-anonymization is an important privacy protection mechanism in data publishing. While there has been a great deal of work in recent years, almost all considered a single static release. Such mechanisms only protect the data up to the first release or first recipient. In practical applications, data is published continuously as new data arrive; the same data may be anonymized differently for a different purpose or a different recipient. In such scenarios, even when all releases are properly k-anonymized, the anonymity of an individual may be unintentionally compromised if recipient cross-examines all the releases received or colludes with other recipients. Preventing such attacks, called correspondence attacks, faces major challenges. In this paper, we systematically characterize the correspondence attacks and propose an efficient anonymization algorithm to thwart the attacks in the model of continuous data publishing.