Issue No. 06 - Nov.-Dec. (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.65
Amirreza Masoumzadeh , University of Pittsburgh, Pittsburgh
James Joshi , University of Pittsburgh, Pittsburgh
Social networks are attracting significant interest from researchers in different domains, especially with the advent of social networking systems which enable large-scale collection of network information. However, as much as analysis of such social networks can benefit researchers, it raises serious privacy concerns for the people involved in them. To address such privacy concerns, several techniques, such as k-anonymity-based approaches, have been proposed in the literature to provide user anonymity in published social networks. However, these methods usually introduce a large amount of distortion to the original social network graphs, thus, raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. We propose two methods to enhance edge-perturbing anonymization methods based on the concepts of structural roles and edge betweenness in social network theory. We experimentally show significant improvements in preserving structural properties in an anonymized social network achieved by our approach compared to the original algorithms over several data sets.
Social network services, Partitioning algorithms, Privacy, Algorithm design and analysis, Data privacy, Semantics, Clustering algorithms, data perturbation, Privacy, social network, social network analysis, data anonymization
J. Joshi and A. Masoumzadeh, "Preserving Structural Properties in Edge-Perturbing Anonymization Techniques for Social Networks," in IEEE Transactions on Dependable and Secure Computing, vol. 9, no. , pp. 877-889, 2012.