Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries

Authors:
Rhonda Chaytor;Patricia A. Evans;Todd Wareham
Affiliations:
School of Computing Science, Simon Fraser University, Vancouver BC, Canada;Faculty of Computer Science, University of New Brunswick, Fredericton NB, Canada;Department of Computer Science, Memorial University, St. John's NL, Canada
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 5
Cited 1

Achieving k-anonymity privacy protection using generalization and suppression

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Systematic parameterized complexity analysis in computational phonology

Systematic parameterized complexity analysis in computational phonology
Bottom-Up Generalization: A Data Mining Solution to Privacy Protection

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
On the complexity of optimal K-anonymity

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Allowing privacy protection algorithms to jump out of local optimums: an ordered greed framework

PinKDD'07 Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD

Anonymizing binary and small tables is hard to approximate

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k驴 1) other records in the dataset. The basic k-anonymization problem, which minimizes the number of dataset entries that must be suppressed to achieve k-anonymity, is NP-hard and hence not solvable both quickly and optimally in general. We apply parameterized complexity analysis to explore algorithmic options for restricted versions of this problem that occur in practice. We present the first fixed-parameter algorithms for this problem and identify key techniques that can be applied to this and other k-anonymization problems.