k-Anonymization with Minimal Loss of Information

DOI10.1007/978-3-540-75520-3_40MaRDI QIDQ3527233zbMATH OpenOpenAlexFDO

Authors Aristides Gionis, Tamir Tassa

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_40

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• A practical approximation algorithm for optimal \(k\)-anonymity
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Distribution‐preserving k‐anonymity
• Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy
• On distributed \(k\)-anonymization

Cited in

(23)

• A practical approximation algorithm for optimal \(k\)-anonymity
• Generalized bucketization scheme for flexible privacy settings
• Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
• The effect of homogeneity on the computational complexity of combinatorial data anonymization
• A modification of the Lloyd algorithm for \(k\)-anonymous quantization
• An decision tree algorithm for k-anonymity data
• Provable de-anonymization of large datasets with sparse dimensions
• Achieving anonymity via clustering
• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• Anonymizing categorical data with a recoding method based on semantic similarity
• A new approach for achieving k-anonymity in database based on fuzzy clustering and 0-1 integer programming
• Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy
• A probabilistic perspective on re-identifiability
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Using \(k\)-anonymization for registry data: pitfalls and alternatives
• Database Theory - ICDT 2005
• On distributed \(k\)-anonymization
• Anonymizing binary and small tables is hard to approximate
• Discovery Science
• K-anonymization approaches for supporting multiple constraints
• \(k\)-anonymous data collection
• Efficient systematic clustering method for k-anonymization

This page was built for publication: k-Anonymization with Minimal Loss of Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527233)