Using k-anonymization for registry data: pitfalls and alternatives

DOI10.12697/ACUTM.2017.21.05MaRDI QIDQ4978327zbMATH OpenFDO

Authors Sten Anspal, Mart Kaska, Indrek Seppo

Publication date 10 August 2017

Published in Acta et Commentationes Universitatis Tartuensis de Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12697/ACUTM.2017.21.05

zbMATH Keywords

\(k\)-anonymizationprivacy-preserving computing

Mathematics Subject Classification ID

Paired and multiple comparisons; multiple testing (62J15) Applications of statistics to social sciences (62P25)

Recommendations

• Data and Applications Security XIX
• A comparison between local and global recoding algorithms for achieving microdata p-sensitive k-anonymity
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Weak k-Anonymity: A Low-Distortion Model for Protecting Privacy
• k-Anonymization with Minimal Loss of Information

Describes a project that uses

Uses Software

• Rmind

This page was built for publication: Using \(k\)-anonymization for registry data: pitfalls and alternatives

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