TY - GEN
T1 - De-anonymizing social networks
AU - Narayanan, Arvind
AU - Shmatikov, Vitaly
PY - 2009
Y1 - 2009
N2 - 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 socialnetwork graphs. To demonstrate its effectiveness on realworld 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 allexisting defenses, and works even when the overlap between the target network and the adversary's auxiliary information is small.
AB - 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 socialnetwork graphs. To demonstrate its effectiveness on realworld 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 allexisting defenses, and works even when the overlap between the target network and the adversary's auxiliary information is small.
UR - http://www.scopus.com/inward/record.url?scp=70449632682&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449632682&partnerID=8YFLogxK
U2 - 10.1109/SP.2009.22
DO - 10.1109/SP.2009.22
M3 - Conference contribution
AN - SCOPUS:70449632682
SN - 9780769536330
T3 - Proceedings - IEEE Symposium on Security and Privacy
SP - 173
EP - 187
BT - 2009 30th IEEE Symposium on Security and Privacy
T2 - 2009 30th IEEE Symposium on Security and Privacy
Y2 - 17 May 2009 through 20 May 2009
ER -