Continuous privacy preserving publishing of data streams

Authors:
Bin Zhou;Yi Han;Jian Pei;Bin Jiang;Yufei Tao;Yan Jia
Affiliations:
Simon Fraser University, Canada;National University of Defense Technology, China;Simon Fraser University, Canada;Simon Fraser University, Canada;The Chinese University of Hong Kong, China;National University of Defense Technology, China
Venue:
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Year:
2009

Citing 30
Cited 10

Generalizing data to provide anonymity when disclosing information (abstract)

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional binary search trees used for associative searching

Communications of the ACM
Data-streams and histograms

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Models and issues in data stream systems

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sampling from a moving window over streaming data

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
Transforming data to satisfy privacy constraints

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Data Privacy through Optimal k-Anonymization

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
On k-anonymity and the curse of dimensionality

VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
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
Workload-aware anonymization

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Anonymizing sequential releases

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Utility-based anonymization using local recoding

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
The new Casper: query processing for location services without compromising privacy

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
M-invariance: towards privacy preserving re-publication of dynamic datasets

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Maintaining K-Anonymity against Incremental Updates

SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
K-anonymization as spatial indexing: toward scalable and incremental anonymization

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
Anonymity for continuous data publishing

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Anonymizing Streaming Data for Privacy Protection

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
CASTLE: A delay-constrained scheme for ks-anonymizing data streams

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Anonymizing tables

ICDT'05 Proceedings of the 10th international conference on Database Theory

FAANST: fast anonymizing algorithm for numerical streaming data

DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
Disclosure detection over data streams in database publishing

Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
Protecting privacy in data release

Foundations of security analysis and design VI
Privacy-preserving network flow recording

Digital Investigation: The International Journal of Digital Forensics & Incident Response
CMOA: continuous moving object anonymization

Proceedings of the 16th International Database Engineering & Applications Sysmposium
An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud

Journal of Computer and System Sciences
Utility-maximizing event stream suppression

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fast clustering-based anonymization approaches with time constraints for data streams

Knowledge-Based Systems
Incremental processing and indexing for k, e-anonymisation

International Journal of Information and Computer Security
Modeling and preventing inferences from sensitive value distributions in data release

Journal of Computer Security - STM'10

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, privacy preserving data publishing has received a lot of attention in both research and applications. Most of the previous studies, however, focus on static data sets. In this paper, we study an emerging problem of continuous privacy preserving publishing of data streams which cannot be solved by any straightforward extensions of the existing privacy preserving publishing methods on static data. To tackle the problem, we develop a novel approach which considers both the distribution of the data entries to be published and the statistical distribution of the data stream. An extensive performance study using both real data sets and synthetic data sets verifies the effectiveness and the efficiency of our methods.