Keep your friends close: Incorporating trust into social network-based Sybil defenses

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1943-1951

  Mohaisen, Abedelaziz ^a   Hopper, Nicholas ^a   Kim, Yongdae ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROPERTIES; COMMUNITY STRUCTURES; NETWORK-BASED; ONLINE SOCIAL NETWORKS; RANDOM WALK; SOCIAL GRAPHS; TRUST VALUES;

COST FUNCTIONS; DESIGN; GRAPHIC METHODS; RANDOM PROCESSES; SOCIAL NETWORKING (ONLINE);

GRAPH THEORY;

EID: 79960871268     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934998     Document Type: Conference Paper

References (37)

1. J. Douceur, "The sybil attack," in IPTPS, 2002, pp. 251-260.
2. B. Levine, C. Shields, and N. Margolin, "A survey of solutions to the sybil attack," University of Massachusetts Amherst, Tech. Rep., 2006.
3. M. Castro, P. Druschel, A. J. Ganesh, A. I. T. Rowstron, and D. S. Wallach, "Secure routing for structured peer-to-peer overlay networks," in OSDI, 2002.
4. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer, "Farsite: Federated, available, and reliable storage for an incompletely trusted environment," in OSDI, 2002.
5. J. Ledlie and M. I. Seltzer, "Distributed, secure load balancing with skew, heterogeneity and churn," in INFOCOM, 2005, pp. 1419-1430.
6. F. Lesueur, L. Mé, and V. V. T. Tong, "An efficient distributed pki for structured p2p networks," in Proceeding of P2P. IEEE, 2009, pp. 1-10.
7. N. Borisov, "Computational puzzles as sybil defenses," in Peer-to-Peer Computing, 2006, pp. 171-176.
8. H. Yu, M. Kaminsky, P. B. Gibbons, and A. D. Flaxman, "Sybilguard: defending against sybil attacks via social networks," IEEE/ACM Trans. Netw., vol. 16, no. 3, pp. 576-589, 2008.
9. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao, "Sybillimit: A near-optimal social network defense against sybil attacks," in IEEE Symposium on Security and Privacy, 2008, pp. 3-17.
10. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman, "Sybilguard: defending against sybil attacks via social networks," in SIGCOMM, 2006, pp. 267-278.
11. B. Viswanath, A. Post, K. P. Gummadi, and A. Mislove, "An analysis of social network-based sybil defenses," in SIGCOMM, 2010.
12. G. Danezis and P. Mittal, "Sybilinfer: Detecting sybil nodes using social networks," in NDSS, 2009.
13. C. Lesniewski-Lass and M. F. Kaashoek, "Whānau: A sybil-proof distributed hash table," in USENIX NSDI, 2010, pp. 3-17.
14. A. Mohaisen, A. Yun, and Y. Kim, "Measuring the mixing time of social graphs," in IMC. ACM, 2010, pp. 383-389.
15. N. Tran, B. Min, J. Li, and L. Subramanian, "Sybil-resilient online content voting," in NSDI. USENIX Association, 2009, pp. 15-28.
16. E. M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," in MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing. New York, NY, USA: ACM, 2007, pp. 32-40.
17. S. Marti, P. Ganesan, and H. Garcia-Molina, "Dht routing using social links," in IPTPS, 2004, pp. 100-111.
18. S. Pai, T. Roosta, S. B. Wicker, and S. Sastry, "Using social network theory towards development of wireless ad hoc network trust," in AINA Workshops, 2007, pp. 443-450.
19. R. Landa, D. Griffin, R. Clegg, E. Mykoniati, and M. Rio, "A sybilproof indirect reciprocity mechanism for peer-to-peer networks," in Proceedings of IEEE Infocom, vol. 9, 2009.
20. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the evolution of user interaction in facebook," in Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks, August 2009.
21. C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao, "User interactions in social networks and their implications," in EuroSys. ACM, 2009, pp. 205-218.
22. J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg, "Predicting positive and negative links in online social networks," in WWW, 2010, pp. 641-650.
23. D. J. Crandall, D. Cosley, D. P. Huttenlocher, J. M. Kleinberg, and S. Suri, "Feedback effects between similarity and social influence in online communities," in KDD, 2008, pp. 160-168.
24. E. Le Merrer and G. Trédan, "Centralities: capturing the fuzzy notion of importance in social graphs," in SNS. ACM, 2009, pp. 33-38.
25. D. Liben-Nowell and J. M. Kleinberg, "The link prediction problem for social networks," in CIKM. ACM, 2003, pp. 556-559.
26. A. Mislove, M. Marcon, P. K. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks," in Internet Measurement Comference, 2007, pp. 29-42.
27. Y.-Y. Ahn, S. Han, H. Kwak, S. B. Moon, and H. Jeong, "Analysis of topological characteristics of huge online social networking services," in WWW, 2007, pp. 835-844.
28. J. Golbeck, "Trust and nuanced profile similarity in online social networks," ACM Trans. Web, vol. 3, no. 4, pp. 1-33, 2009.
29. C. Dwyer, S. Hiltz, and K. Passerini, "Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace," in AMCIS, 2007.
30. S. Nagaraja, "Anonymity in the wild: Mixes on unstructured networks," in Privacy Enhancing Technologies, 2007, pp. 254-271.
31. A. Mohaisen, N. Hopper, and Y. Kim, "Incorporating trust into social network-based sybil defenses," UMN, Tech. Rep., 2010.
32. A. Sinclair, "Improved bounds for mixing rates of marcov chains and multicommodity flow," Comb., Probability & Computing, vol. 1, pp. 351-370, 1992.
33. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations," in KDD. ACM, 2005, pp. 177-187.
34. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, "Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters," CoRR, vol. abs/0810.1355, 2008.
35. M. Richardson, R. Agrawal, and P. Domingos, "Trust management for the semantic web," in ISWC, 2003, pp. 351-368.
36. M. Ley, "The DBLP computer science bibliography: Evolution, research issues, perspectives," in String Processing and Information Retrieval. Springer, 2009, pp. 481-486.
37. A. Mislove, B. Viswanath, K. P. Gummadi, and P. Druschel, "You are who you know: Inferring user profiles in Online Social Networks," in WSDM, New York, NY, February 2010.