Exploring the design space of social network-based Sybil defenses

2012 4th International Conference on Communication Systems and Networks, COMSNETS 2012

Volumn , Issue , 2012, Pages

  Viswanath, Bimal ^a   Mondal, Mainack ^a   Clement, Allen ^a   Druschel, Peter ^a   Gummadi, Krishna P ^a   Mislove, Alan ^b   Post, Ansley ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b Northeastern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEFENSE SYSTEM; DESIGN GOAL; DESIGN SPACES; DETECTION SCHEME; GLOBAL PROPERTIES; GRAPH STRUCTURES; MULTIPLE IDENTITIES; NETWORK-BASED; SOCIAL GRAPHS; SOCIAL NETWORKS; SYBIL ATTACK;

COMMUNICATION SYSTEMS; GRAPHIC METHODS;

COMPUTER CRIME;

EID: 84858031353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMSNETS.2012.6151333     Document Type: Conference Paper

References (34)

1. J. Douceur, "The Sybil Attack," in IPTPS, 2002.
2. N. Tran, B. Min, J. Li, and L. Subramanian, "Sybil-Resilient Online Content Voting," in NSDI, 2009.
3. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman, "SybilGuard: Defending Against Sybil Attacks via Social Networks," in SIGCOMM, 2006.
4. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao, "SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks," in IEEE S&P, 2008.
5. G. Danezis and P. Mittal, "SybilInfer: Detecting Sybil Nodes using Social Networks," in NDSS, 2009.
6. N. Tran, J. Li, L. Subramanian, and S. S. Chow, "Optimal sybil-resilient node admission control," in INFOCOM, 2011.
7. D. Quercia and S. Hailes, "Sybil attacks against mobile users: Friends and foes to the rescue," in INFOCOM, 2010.
8. C. Lesniewski-Laas and M. F. Kaashoek, "Whanau: A Sybil-proof Distributed Hash Table," in NSDI, 2010.
9. A. Post, V. Shah, and A. Mislove, "Bazaar: Strengthening user reputations in online marketplaces," in NSDI, 2011.
10. A. Mislove, A. Post, K. P. Gummadi, and P. Druschel, "Ostra: Leveraging Trust to Thwart Unwanted Communication," in NSDI, 2008.
11. D. do B. DeFigueiredo and E. T. Barr, "TrustDavis: A non-exploitable online reputation system," IEEE E-Commerce, 2005.
12. H. Yu, "Sybil defenses via social networks: a tutorial and survey," SIGACT News, vol. 42, no. 3, 2011.
13. B. Viswanath, A. Post, K. P. Gummadi, and A. Mislove, "An Analysis of Social Network-based Sybil Defenses," in SIGCOMM, 2010.
14. M. Mitzenmacher and E. Upfal, Probability and Computing. Cambridge, UK: Cambridge University Press, 2005.
15. "Diaspora*," http://joindiaspora.com.
16. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and Analysis of Online Social Networks," in IMC, 2007.
17. Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of Topological Characteristics of Huge Online Social Networking Services," in WWW, 2007.
18. J. Leskovec, K. Lang, and M. Mahoney, "Empirical comparison of algorithms for network community detection," in WWW, 2010.
19. A. Mohaisen, A. Yun, and Y. Kim, "Measuring the mixing time of social graphs," in IMC, 2010.
20. M. E. J. Newman, "The structure of scientific collaboration networks," PNAS, vol. 98, no. 2, pp. 404-409, 2001. (Pubitemid 32105053)
21. "Advogato trust network," http://www.trustlet.org/wiki/ Advogato.
22. M. Mondal, B. Viswanath, A. Clement, P. Druschel, K. P. Gummadi, A. Mislove, and A. Post, "Limiting large-scale crawls of social networking sites," MPI-SWS, Tech. Rep. 2011-006, Nov. 2011.
23. Z. Liu, H. Hu, Y. Liu, K. W. Ross, Y. Wang, and M. Mobius, "P2p trading in social networks: The value of staying connected," in INFOCOMM, 2010.
24. P. Dandekar, A. Goel, R. Govindan, and I. Post, "Liquidity in credit networks: A little trust goes a long way," in NetEcon, 2010.
25. A. Ghosh, M. Mahdian, D. Reeves, D. Pennock, and R. Fugger, "Mechanism design on trust networks," in NetEcon, 2007.
26. Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of topological characteristics of huge online social networking services," in WWW, 2007.
27. S. Seuken and D. C. Parkes, "On the Sybil-Proofness of accounting mechanisms," in NetEcon, 2011.
28. L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol. 8, pp. 399-404, 1956.
29. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," in STOC'86, Berkeley, CA, 1986.
30. E. A. Dinic, "An algorithm for the solution of the max-flow problem with the polynomial estimation," Doklady Akademii Nauk SSSR, vol. 194, no. 4, 1970.
31. R. E. Gomory and T. Hu, "Multi-terminal network flows," SIAM, vol. 9, no. 4, pp. 551-570, 1961.
32. T. Hartmann and D. Wagner, "Fully-dynamic cut tree construction," Karlsruhe Institute of Technology, Tech. Rep. 2011,25, 2011.
33. A. Gubichev, S. Bedathur, S. Seufert, and G.Weikum, "Fast and accurate estimation of shortest paths in large graphs," in CIKM, 2010.
34. A. Das Sarma, S. Gollapudi, M. Najork, and R. Panigrahy, "A sketchbased distance oracle for web-scale graphs," in WSDM, 2010.