Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy

DOI10.1007/11836810_5MaRDI QIDQ3506877zbMATH OpenOpenAlexFDO

Authors Maurizio Atzori

Publication date 17 June 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11836810_5

zbMATH Keywords

\(k\)-anonymitydata privacylow distortion

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Database Theory - ICDT 2005
• k-Anonymization with Minimal Loss of Information
• Data and Applications Security XIX
• Achieving anonymity via clustering

Cited in

(10)

• \(k\)-anonymous microdata release via post randomisation method
• A universal approach to guarantee data privacy
• Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
• k-Anonymization with Minimal Loss of Information
• A comparison between local and global recoding algorithms for achieving microdata p-sensitive k-anonymity
• A data distortion by probability distribution
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Using \(k\)-anonymization for registry data: pitfalls and alternatives
• Expendend p-sensitive k-anonymity
• On some consequences of the permutation paradigm for data anonymization: centrality of permutation matrices, universal measures of disclosure risk and information loss, evaluation by dominance

This page was built for publication: Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy

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