STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Comparing information without leaking it
Communications of the ACM
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
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
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
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
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
Privacy-enhancing k-anonymization of customer data
Proceedings of the twenty-fourth 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
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
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
(α, 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
Utility-based anonymization using local recoding
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient multivariate data-oriented microaggregation
The VLDB Journal — The International Journal on Very Large Data Bases
A secure distributed framework for achieving k-anonymity
The VLDB Journal — The International Journal on Very Large Data Bases
Anatomy: simple and effective privacy preservation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Message delay and DisCSP search algorithms
Annals of Mathematics and Artificial Intelligence
Approximate algorithms for K-anonymity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Smooth sensitivity and sampling in private data analysis
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
k-Anonymization with Minimal Loss of Information
IEEE Transactions on Knowledge and Data Engineering
Privacy-preserving data mashup
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A framework for efficient data anonymization under privacy and accuracy constraints
ACM Transactions on Database Systems (TODS)
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Attacks on privacy and deFinetti's theorem
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Distributed Anonymization: Achieving Privacy for Both Data Subjects and Data Providers
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Generating microdata with p-sensitive k-anonymity property
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Efficient k-anonymization using clustering techniques
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Secure computation of the vector dominance problem
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Efficient Anonymizations with Enhanced Utility
Transactions on Data Privacy
Personal privacy vs population privacy: learning to attack anonymization
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
ICDT'05 Proceedings of the 10th international conference on Database Theory
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
A practical approximation algorithm for optimal k-anonymity
Data Mining and Knowledge Discovery
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
A Look-Ahead Approach to Secure Multiparty Protocols
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
We consider the problem of computing efficient anonymizations of partitioned databases. Given a database that is partitioned between several sites, either horizontally or vertically, we devise secure distributed algorithms that allow the different sites to obtain a k-anonymized and ℓ-diverse view of the union of their databases, without disclosing sensitive information. Our algorithms are based on the sequential algorithm [Goldberger and Tassa 2010] that offers anonymizations with utility that is significantly better than other anonymization algorithms, and in particular those that were implemented so far in the distributed setting. Our algorithms can apply to different generalization techniques and utility measures and to any number of sites. While previous distributed algorithms depend on costly cryptographic primitives, the cryptographic assumptions of our solution are surprisingly minimal.