Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs

DOI10.1007/s00500-012-0850-4zbMath1270.68233DBLPjournals/soco/StokesT12arXiv1112.1978OpenAlexW2047002475WikidataQ57608812 ScholiaQ57608812MaRDI QIDQ2392556

Klara Stokes, Vincenç Torra

Publication date: 1 August 2013

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1978

zbMATH Keywords

\(k\)-anonymous graph\(n\)-confusion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Some basics on privacy techniques, anonymization and their big data challenges ⋮ Improving the characterization of P-stability for applications in network privacy ⋮ Privacy preserving and fast decision for novelty detection using support vector data description ⋮ \(k\)-metric antidimension: a privacy measure for social graphs ⋮ Graphic sequences, distances and \(k\)-degree anonymity

Uses Software

• PrivateLR

Cites Work

• Unnamed Item
• The transferable belief model
• Distances between fuzzy sets representing grey level images
• A data distortion by probability distribution
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
• Differential Privacy

This page was built for publication: Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs