How to allocate network centers
Journal of Algorithms
The Capacitated K-Center Problem
SIAM Journal on Discrete Mathematics
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Toward privacy in public databases
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
Data & Knowledge Engineering
Fast data anonymization with low information loss
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Towards optimal k-anonymization
Data & Knowledge Engineering
Preservation of proximity privacy in publishing numerical sensitive data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An efficient hash-based algorithm for minimal k-anonymity
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Attribute selection in multivariate microaggregation
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
Workload-aware anonymization techniques for large-scale datasets
ACM Transactions on Database Systems (TODS)
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Spatial generalisation algorithms for LBS privacy preservation
Journal of Location Based Services - Privacy Aware and Location-Based Mobile Services
Privacy-preserving anonymization of set-valued data
Proceedings of the VLDB Endowment
Towards trajectory anonymization: a generalization-based approach
SPRINGL '08 Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS
Continuous privacy preserving publishing of data streams
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Privacy-preserving incremental data dissemination
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Towards the evaluation of time series protection methods
Information Sciences: an International Journal
Privacy-preserving data publishing for cluster analysis
Data & Knowledge Engineering
A framework for efficient data anonymization under privacy and accuracy constraints
ACM Transactions on Database Systems (TODS)
Towards Trajectory Anonymization: a Generalization-Based Approach
Transactions on Data Privacy
Attacks on privacy and deFinetti's theorem
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Privacy aware data sharing: balancing the usability and privacy of datasets
Proceedings of the 2nd International Conference on PErvasive Technologies Related to Assistive Environments
Privacy-Preserving Data Publishing
Foundations and Trends in Databases
An integrated framework for de-identifying unstructured medical data
Data & Knowledge Engineering
Incremental privacy preservation for associative classification
Proceedings of the ACM first international workshop on Privacy and anonymity for very large databases
Identity disclosure protection: A data reconstruction approach for privacy-preserving data mining
Decision Support Systems
StarClique: guaranteeing user privacy in social networks against intersection attacks
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A reciprocal framework for spatial K-anonymity
Information Systems
COP: privacy-preserving multidimensional partition in DAS paradigm
Proceedings of the 2009 EDBT/ICDT Workshops
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
The hardness and approximation algorithms for l-diversity
Proceedings of the 13th International Conference on Extending Database Technology
Algorithm-safe privacy-preserving data publishing
Proceedings of the 13th International Conference on Extending Database Technology
Privacy-preserving data publishing: A survey of recent developments
ACM Computing Surveys (CSUR)
Towards publishing recommendation data with predictive anonymization
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Achieving k-anonymity via a density-based clustering method
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Privacy-preserving data mining through knowledge model sharing
PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD
P-Sensitive K-Anonymity with Generalization Constraints
Transactions on Data Privacy
Efficient Anonymizations with Enhanced Utility
Transactions on Data Privacy
Privacy issues in scientific workflow provenance
Proceedings of the 1st International Workshop on Workflow Approaches to New Data-centric Science
Towards mobility-based clustering
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Anonymization of moving objects databases by clustering and perturbation
Information Systems
An online framework for publishing privacy-sensitive location traces
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A family of enhanced (L,α)-diversity models for privacy preserving data publishing
Future Generation Computer Systems
ACM Transactions on Database Systems (TODS)
Theoretical Computer Science
Local and global recoding methods for anonymizing set-valued data
The VLDB Journal — The International Journal on Very Large Data Bases
SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 14th International Conference on Database Theory
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
kb-anonymity: a model for anonymized behaviour-preserving test and debugging data
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Node protection in weighted social networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization
Achieving k-anonymity by clustering in attribute hierarchical structures
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
k-ARQ: k-anonymous ranking queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
A semantic information loss metric for privacy preserving publication
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Permutation anonymization: improving anatomy for privacy preservation in data publication
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
Secure distributed computation of anonymized views of shared databases
ACM Transactions on Database Systems (TODS)
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
An automated data utility clustering methodology using data constraint rules
Proceedings of the 2012 international workshop on Smart health and wellbeing
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A Knowledge Model Sharing Based Approach to Privacy-Preserving Data Mining
Transactions on Data Privacy
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
Priority driven k-anonymisation for privacy protection
AusDM '08 Proceedings of the 7th Australasian Data Mining Conference - Volume 87
Privacy protection in personalized web search: a peer group-based approach
SBP'13 Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Journal of Computer Security
Hi-index | 0.00 |
Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population can be identified using non-key attributes (called quasi-identifiers) such as date of birth, gender, and zip code [15]. Sweeney [16] proposed the k-anonymity model for privacy where non-key attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k−1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a pre-specified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-Anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant-factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.