Pattern-guided \(k\)-anonymity

DOI10.3390/a6040678zbMath1461.68071OpenAlexW1995222351MaRDI QIDQ1736590

André Nichterlein, Rolf Niedermeier, Robert Bredereck

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6040678

zbMATH Keywords

heuristicsexperimentsinteger linear programmingNP-hardnessparameterized complexityexact algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Privacy in Elections: k-Anonymizing Preference Orders

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• Anonymizing binary and small tables is hard to approximate
• Fixed-parameter tractability of anonymizing data by suppressing entries
• Using patterns to form homogeneous teams
• The effect of homogeneity on the computational complexity of combinatorial data anonymization
• Parametrized complexity theory.
• Integer Programming with a Fixed Number of Variables
• Pattern-Guided Data Anonymization and Clustering
• Terminal Backup, 3D Matching, and Covering Cubic Graphs
• Resolving the Complexity of Some Data Privacy Problems
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Reducibility among Combinatorial Problems
• Exploiting vector instructions with generalized stream fusion
• Pattern-Guided k-Anonymity

This page was built for publication: Pattern-guided \(k\)-anonymity