Please use this identifier to cite or link to this item: https://doi.org/10.1145/2396761.2396823
Title: Delineating social network data anonymization via random edge perturbation
Authors: Xue, M.
Karras, P.
Chedy, R.
Kalnis, P.
Pung, H.K. 
Keywords: graph utility
privacy
random perturbation
social network
Issue Date: 2012
Source: Xue, M.,Karras, P.,Chedy, R.,Kalnis, P.,Pung, H.K. (2012). Delineating social network data anonymization via random edge perturbation. ACM International Conference Proceeding Series : 475-484. ScholarBank@NUS Repository. https://doi.org/10.1145/2396761.2396823
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. © 2012 ACM.
Source Title: ACM International Conference Proceeding Series
URI: http://scholarbank.nus.edu.sg/handle/10635/41276
ISBN: 9781450311564
DOI: 10.1145/2396761.2396823
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Dec 11, 2017

Page view(s)

66
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.