Resisting structural re-identification in anonymized social networks

被引:76
作者
Hay, Michael [1 ]
Miklau, Gerome [1 ]
Jensen, David [1 ]
Towsley, Don [1 ]
Li, Chao [1 ]
机构
[1] Univ Massachusetts, Dept Comp Sci, Amherst, MA 01002 USA
关键词
Anonymity; Anonymization; Privacy; Networks; Social networks; PRIVACY;
D O I
10.1007/s00778-010-0210-x
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We identify privacy risks associated with releasing network datasets and provide an algorithm that mitigates those risks. A network dataset is a graph representing entities connected by edges representing relations such as friendship, communication or shared activity. Maintaining privacy when publishing a network dataset is uniquely challenging because an individual's network context can be used to identify them even if other identifying information is removed. In this paper, we introduce a parameterized model of structural knowledge available to the adversary and quantify the success of attacks on individuals in anonymized networks. We show that the risks of these attacks vary based on network structure and size and provide theoretical results that explain the anonymity risk in random networks. We then propose a novel approach to anonymizing network data that models aggregate network structure and allows analysis to be performed by sampling from the model. The approach guarantees anonymity for entities in the network while allowing accurate estimates of a variety of network measures with relatively little bias.
引用
收藏
页码:797 / 823
页数:27
相关论文
共 53 条
[1]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[2]   Diversity of graphs with highly variable connectivity [J].
Alderson, David L. ;
Li, Lun .
PHYSICAL REVIEW E, 2007, 75 (04)
[3]  
[Anonymous], SEQUENTIAL IMP UNPUB
[4]  
[Anonymous], 2007, P 16 INT C WORLD WID
[5]  
[Anonymous], 2008, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data
[6]  
Babai L., 1979, 20th Annual Symposium of Foundations of Computer Science, P39, DOI 10.1109/SFCS.1979.8
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]  
Bhagat S., 2009, P VLDB ENDOW, V2, P766, DOI DOI 10.14778/1687627.1687714
[9]  
Cohen W.W., 2005, ENRON EMAIL DATASET
[10]   Anonymizing Bipartite Graph Data using Safe Groupings [J].
Cormode, Graham ;
Srivastava, Divesh ;
Yu, Ting ;
Zhang, Qing .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (01) :833-844