Preserving Structural Properties in Edge-Perturbing Anonymization Techniques for Social Networks

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 serio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on dependable and secure computing 2012-11, Vol.9 (6), p.877-889
Main Authors: Masoumzadeh, A., Joshi, J.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Anonymity
Clustering algorithms
Collection
data anonymization
Data collection
data perturbation
Data privacy
Distortion
Partitioning algorithms
Preserving
Privacy
Semantics
social network
Social network analysis
Social network services
Social networks
Studies
Utilities
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1545-5971
1941-0018
DOI:10.1109/TDSC.2012.65