Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Graph decomposition is NPC - a complete proof of Holyer's conjecture
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the complexity of optimal K-anonymity
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
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
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The k-anonymity problem is hard
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
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
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Pattern-guided data anonymization and clustering
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The effect of homogeneity on the complexity of k-anonymity
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
| Hi-index | 0.00 |
We formally study two methods for data sanitation that have been used extensively in the database community: k-anonymity and l- diversity. We settle several open problems concerning the difficulty of applying these methods optimally, proving both positive and negative results: - 2-anonymity is in P. - The problem of partitioning the edges of a triangle-free graph into 4-stars (degree-three vertices) is NP-hard. This yields an alternative proof that 3-anonymity is NP-hard even when the database attributes are all binary. - 3-anonymity with only 27 attributes per record is MAX SNP-hard. - For databases with n rows, k-anonymity is in O(4n ċ poly(n)) time for all k 1. - For databases with l attributes, alphabet size c, and n rows, k- Anonymity can be solved in 2O(k2(2c)l) + O(nl) time. - 3-diversity with binary attributes is NP-hard, with one sensitive attribute. - 2-diversity with binary attributes is NP-hard, with three sensitive attributes.