Delineating social network data anonymization via random edge perturbation

Abstract : Social network data analysis raises concerns about the privacy of related entities or individuals. To address this issue, organizations can publish data after simply replacing the identities of individuals with pseudonyms, leaving the overall structure of the social network unchanged. However, it has been shown that attacks based on structural identification (e.g., a walk-based attack) enable an adversary to re-identify selected individuals in an anonymized network. In this paper we explore the capacity of techniques based on random edge perturbation to thwart such attacks. We theoretically establish that any kind of structural identification attack can effectively be prevented using random edge perturbation and show that, surprisingly, important properties of the whole network, as well as of subgraphs thereof, can be accurately calculated and hence data analysis tasks performed on the perturbed data, given that the legitimate data recipient knows the perturbation probability as well. Yet we also examine ways to enhance the walk-based attack, proposing a variant we call probabilistic attack. Nevertheless, we demonstrate that such probabilistic attacks can also be prevented under sufficient perturbation. Eventually, we conduct a thorough theoretical study of the probability of success of any}structural attack as a function of the perturbation probability. Our analysis provides a powerful tool for delineating the identification risk of perturbed social network data; our extensive experiments with synthetic and real datasets confirm our expectations.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00768441
Contributor : Chedy Raïssi <>
Submitted on : Friday, December 21, 2012 - 2:42:38 PM
Last modification on : Friday, August 9, 2019 - 3:24:03 PM
Long-term archiving on : Sunday, December 18, 2016 - 8:36:34 AM

File

fp021-xue.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00768441, version 1

Collections

Citation

Mingqiang Xue, Panagiotis Karras, Chedy Raïssi, Panos Kalnis, Hung Keng Pung. Delineating social network data anonymization via random edge perturbation. CIKM - 21st ACM International Conference on Information and Knowledge Management - 2012, Oct 2012, Maui, United States. ⟨hal-00768441⟩

Share

Metrics

Record views

419

Files downloads

390