Communications of the ACM

Home/Magazine Archive/December 2011 (Vol. 54, No. 12)/Wherefore Art Thou R3579X?: Anonymized Social Networks.../Abstract

Research highlights

Wherefore Art Thou R3579X?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography

By Lars Backstrom, Cynthia Dwork, Jon Kleinberg
Communications of the ACM, December 2011, Vol. 54 No. 12, Pages 133-141
10.1145/2043174.2043199
Comments

View as: Print Mobile App ACM Digital Library In the Digital Edition Share:

anonymous figure — Credit: Wikimedia Commons

In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. We describe a family of attacks such that it is possible to learn whether edges exist or not between specific targeted pairs of nodes.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.