Stalking online: on user privacy in social networks
Proceedings of the second ACM conference on Data and Application Security and Privacy
Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.00 |
Increasing research on social networks stresses the urgency for producing effective means of ensuring user privacy. Represented ubiquitously as graphs, social networks have a myriad of recently developed techniques to prevent identity disclosure, but the equally important attribute disclosure attacks have been neglected. To address this gap, we introduce an approach to anonymize social networks that have labeled nodes, $\alpha$-proximity, which requires that the label distribution in every neighbourhood of the graph be close to that throughout the entire network. We present an effective greedy algorithm to achieve $\alpha$-proximity and experimentally validate the quality of the solutions it derives.