DocumentCode :
3022898
Title :
De-anonymizing Social Networks
Author :
Narayanan, Arvind ; Shmatikov, Vitaly
Author_Institution :
Univ. of Texas at Austin, Austin, TX, USA
fYear :
2009
fDate :
17-20 May 2009
Firstpage :
173
Lastpage :
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.
Keywords :
data mining; data privacy; graph theory; social networking (online); anonymized social network graphs; application developers; data mining researchers; de-anonymizing social networks; network topology; re-identification algorithm; anonymity; privacy; social networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Security and Privacy, 2009 30th IEEE Symposium on
Conference_Location :
Berkeley, CA
ISSN :
1081-6011
Print_ISBN :
978-0-7695-3633-0
Type :
conf
DOI :
10.1109/SP.2009.22
Filename :
5207644
Link To Document :
بازگشت