Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs
From MaRDI portal
Publication:2392556
DOI10.1007/s00500-012-0850-4zbMath1270.68233arXiv1112.1978WikidataQ57608812 ScholiaQ57608812MaRDI QIDQ2392556
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
68R10: Graph theory (including graph drawing) in computer science
Related Items
Improving the characterization of P-stability for applications in network privacy, Some basics on privacy techniques, anonymization and their big data challenges, 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
Cites Work