The Community for Technology Leaders
2012 IEEE Symposium on Security and Privacy (2009)
Oakland, California
May 17, 2009 to May 20, 2009
ISSN: 1081-6011
ISBN: 978-0-7695-3633-0
pp: 173-187
ABSTRACT
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and data-mining researchers. Privacy is typically protected by anonymization, i.e., removing names, addresses, etc.We present a framework for analyzing privacy and anonymity in social networks and develop a new re-identification algorithm targeting anonymized social-network graphs. To demonstrate its effectiveness on real-world networks, we show that a third of the users who can be verified to have accounts on both Twitter, a popular microblogging service, and Flickr, an online photo-sharing site, can be re-identified in the anonymous Twitter graph with only a 12% error rate.Our de-anonymization algorithm is based purely on the network topology, does not require creation of a large number of dummy "sybil" nodes, is robust to noise and all existing defenses, and works even when the overlap between the target network and the adversary's auxiliary information is small.
INDEX TERMS
social networks, anonymity, privacy
CITATION
Vitaly Shmatikov, Arvind Narayanan, "De-anonymizing Social Networks", 2012 IEEE Symposium on Security and Privacy, vol. 00, no. , pp. 173-187, 2009, doi:10.1109/SP.2009.22
84 ms
(Ver 3.3 (11022016))