This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Eight Friends Are Enough: Social Graph Approximation via Public Listings Joseph Bonneau Computer Laboratory University of Cambridge [email protected] Jonathan Anderson Computer Laboratory University of Cambridge [email protected] Frank Stajano Computer Laboratory University of Cambridge [email protected] Ross Anderson Computer Laboratory University of Cambridge [email protected] ABSTRACT The popular social networking website Facebook exposes a “public view” of user profiles to search engines which in- cludes eight of the user’s friendship links. We examine what interesting properties of the complete social graph can be inferred from this public view. In experiments on real social network data, we were able to accurately approximate the degree and centrality of nodes, compute small dominating sets, find short paths between users, and detect commu- nity structure. This work demonstrates that it is difficult to safely reveal limited information about a social network. Categories and Subject Descriptors K.4.1 [ Computers and Society ]: Public Policy Issues — Privacy; E.1 [ Data Structures ]: Graphs and networks; F.2.1 [ Analysis of Algorithms and Problem Complex- ity ]: Numerical Algorithms and Problems; K.6.5 [ Manage- ment of Computing and Information Systems ]: Secu- rity and Protection General Terms Security, Algorithms, Experimentation, Measurement, The- ory, Legal Aspects Keywords Social networks, Privacy, Web crawling, Data breaches, Graph theory 1. INTRODUCTION The proliferation of online social networking services has entrusted massive silos of sensitive personal information to social network operators. Privacy concerns have attracted Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SNS ’09 Nuremberg, Germany Copyright 2009 ACM 978-1-60558-463-8 ...$5.00. considerable attention from the media, privacy advocates and the research community. Most of the focus has been on personal data privacy: researchers and operators have attempted to fine-tune access control mechanisms to pre- vent the accidental leakage of embarrassing or incriminating information to third parties. A less studied problem is that of social graph privacy : pre- venting data aggregators from reconstructing large portions of the social graph, composed of users and their friendship links. Knowing who a person’s friends are is valuable in- formation to marketers, employers, credit rating agencies, insurers, spammers, phishers, police, and intelligence agen- cies, but protecting the social graph is more difficult than protecting personal data. Personal data privacy can be man- aged individually by users, while information about a user’s...
View Full Document
This note was uploaded on 01/11/2011 for the course CSE 301 taught by Professor Amir during the Spring '10 term at Bangladesh University of Eng and Tech.
- Spring '10