Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Protecting Respondents' Identities in Microdata Release
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
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
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
Approximate algorithms for K-anonymity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A Critique of k-Anonymity and Some of Its Enhancements
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Efficient k-anonymization using clustering techniques
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
ICDT'05 Proceedings of the 10th international conference on Database Theory
Approximation algorithms for min-max generalization problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study the problem of abstracting a table of data about individuals so that no selection query can identify fewer than k individuals. We show that it is impossible to achieve arbitrarily good polynomial-time approximations for a number of natural variations of the generalization technique, unless P = NP , even when the table has only a single quasi-identifying attribute that represents a geographic or unordered attribute: - Zip-codes : nodes of a planar graph generalized into connected subgraphs - GPS coordinates : points in R2 generalized into non-overlapping rectangles - Unordered data : text labels that can be grouped arbitrarily. These hard single-attribute instances of generalization problems contrast with the previously known NP-hard instances, which require the number of attributes to be proportional to the number of individual records (the rows of the table). In addition to impossibility results, we provide approximation algorithms for these difficult single-attribute generalization problems, which, of course, apply to multiple-attribute instances with one that is quasi-identifying. Incidentally, the generalization problem for unordered data can be viewed as a novel type of bin packing problem---min-max bin covering ---which may be of independent interest.