Eight friends are enough: Social graph approximation via public listings

Proceedings of the 2nd ACM EuroSys Workshop on Social Network Systems, SNS '09

Volumn , Issue , 2009, Pages 13-18

  Bonneau, Joseph ^a   Anderson, Jonathan ^a   Anderson, Ross ^a   Stajano, Frank ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Data breaches; Graph theory; Privacy; Social networks; Web crawling

Indexed keywords

COMMUNITY STRUCTURES; DOMINATING SETS; FACEBOOK; LIMITED INFORMATION; PRIVACY; SHORT-PATH; SOCIAL GRAPHS; SOCIAL NETWORKING; SOCIAL NETWORKS; USER PROFILE; WEB CRAWLING;

BEHAVIORAL RESEARCH; DATA PRIVACY; ELECTRONIC MAIL; SEARCH ENGINES; WORLD WIDE WEB;

GRAPH THEORY;

EID: 70450193106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1578002.1578005     Document Type: Conference Paper

References (19)

1. Facebook privacy policy. http://www.facebook.com/policy.php (2009).
2. Acquisti, A., and Gross, R. Imagined Communities: Awareness, Information Sharing, and Privacy on the Facebook. In Privacy Enhancing Technologies - LNCS 4258 (2006), Springer Berlin/Heildelberg, pp. 36-58.
3. Albert, R., and Barabási, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 1 (Jan 2002), 47-97.
4. Backstrom, L., Dwork, C., and Kleinberg, J. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW '07: Proceedings of the 16th international conference on World Wide Web (New York, NY, USA, 2007), ACM, pp. 181-190.
5. Brandes, U. A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25, 2 (2001), 163-177.
6. Brin, S., and Page, L. The anatomy of a large-scale hypertextual web search engine. In Seventh International World-Wide Web Conference (WWW 1998) (1998).
7. Chvatal, V. A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4, 3 (1979), 233-235.
8. Clauset, A., Newman, M. E. J., and Moore, C. Finding community structure in very large networks. Physical Review E 70, 6 (Dec 2004), 066111.
9. Danezis, G., and Wittneben, B. The economics of mass surveillance and the questionable value of anonymous communications. WEIS: Workshop on the Economics of Information Security (2006).
10. Dwyer, C., Hiltz, S. R., and Passerini, K. Trust and privacy concern within social networking sites: A comparison of facebook and myspace. America's Conference on Information Systems (2007).
11. Floyd, R. W. Algorithm 97: Shortest path. Communications of the ACM 5, 6 (1962), 345.
12. Jagatic, T. N., Johnson, N. A., Jakobsson, M., and Menczer, F. Social phishing. Commun. ACM 50, 10 (2007), 94-100.
13. Karp, R. Reducibility Among Combinatorial Problems. Complexity of Computer Computations (1972).
14. Krishnamurthy, B., and Wills, C. E. Characterizing Privacy in Online Social Networks. In Workshop on Online Social Networks WOSN 2008 (2008), pp. 37- 42.
15. Nagaraja, S. The economics of covert community detection and hiding. WEIS: Workshop on the Economics of Information Security (2008).
16. Newman, M. E. J., and Girvan, M. Finding and evaluating community structure in networks. Physical Review E 69 (2004), 026113.
17. Rosenblum, D. What Anyone Can Know: The Privacy Risks of Social Networking Sites. IEEE Security & Privacy Magazine 5, 3 (2007), 40.
18. Wasserman, S., and Faust, K. Social Network Analysis. Cambridge University Press, 1994.
19. Xu, W., Zhou, X., and Li, L. Inferring privacy information via social relations. International Conference on Data Engineering (2008).