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
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Finding similar regions in many sequences
Journal of Computer and System Sciences - STOC 1999
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate algorithms for K-anonymity
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
K-anonymization with minimal loss of information
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ICDT'05 Proceedings of the 10th international conference on Database Theory
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
On the inapproximability of maximum intersection problems
Information Processing Letters
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 |
The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the k-anonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that all the rows in a cluster become the same tuple, after the suppression of some records. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is known to be NP-hard when the values are over a ternary alphabet, k=3 and the rows length is unbounded. In this paper we give a lower bound on the approximation factor that any polynomial-time algorithm can achieve on two restrictions of the problem, namely (i) when the records values are over a binary alphabet and k=3, and (ii) when the records have length at most 8 and k=4, showing that these restrictions of the problem are APX-hard.