SybilInfer: Detecting Sybil Nodes using Social Networks

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2009

Volumn , Issue , 2009, Pages

  Danezis, George ^a   Mittal, Prateek ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; NETWORK SECURITY; NETWORK TOPOLOGY; SOCIAL NETWORKING (ONLINE);

ANALYTICAL RESULTS; ASSIGNED PROBABILITY; BAYESIAN INFERENCE; DEGREE OF CERTAINTY; LABELINGS; NETWORK TOPOLOGY; POTENTIAL REGION; PROBABILISTIC MODELS; REAL-WORLD NETWORKS; RETURN POTENTIAL;

INFERENCE ENGINES;

EID: 85180633166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. U. A. Acar. Self-adjusting computation. PhD thesis, Pittsburgh, PA, USA, 2005. Co-Chair-Guy Blelloch and Co-Chair-Robert Harper.
2. B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems (detailed summary). In STOC, pages 230–240. ACM, 1987.
3. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In OSDI’02: Proceedings of the 5th symposium on Operating systems design and implementation, pages 299–314, New York, NY, USA, 2002. ACM.
4. F. Dabek. A cooperative file system. Master’s thesis, MIT, September 2001.
5. G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, pages 2–15, May 2003.
6. G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resistant dht routing. In ESORICS 2005: Proceedings of the European Symp. Research in Computer Security, pages 305–318, 2005.
7. R. Dingledine, N. Mathewson, and P. Syverson. Tor: the second-generation onion router. In SSYM’04: Proceedings of the 13th conference on USENIX Security Symposium, pages 21–21, Berkeley, CA, USA, 2004. USENIX Association.
8. J. R. Douceur. The sybil attack. In IPTPS’01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 251–260, London, UK, 2002. Springer-Verlag.
9. L. Goodman. Snowball sampling. Annals of Mathematical Statistics, 32:148–170.
10. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97–109, April 1970.
11. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497–515, 2004.
12. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382–401, 1982.
13. C. Lesniewski-Laas. A sybil-proof one-hop dht. In Proceedings of the Workshop on Social Network Systems, Glasgow, Scotland, April 2008.
14. R. Levien and A. Aiken. Attack-resistant trust metrics for public key certification. In SSYM’98: Proceedings of the 7th conference on USENIX Security Symposium, pages 18–18, Berkeley, CA, USA, 1998. USENIX Association.
15. D. J. C. MacKay. Information Theory, Inference & Learning Algorithms. Cambridge University Press, New York, NY, USA, 2002.
16. S. Milgram. The small world problem. 2:60–67, 1967.
17. U. Möller, L. Cottrell, P. Palfrader, and L. Sassaman. Mix-master Protocol — Version 2. IETF Internet Draft, July 2003.
18. S. Nagaraja. Anonymity in the wild: Mixes on unstructured networks. In N. Borisov and P. Golle, editors, Proceedings of the Seventh Workshop on Privacy Enhancing Technologies (PET 2007), Ottawa, Canada, June 2007. Springer.
19. D. J. Phillips. Defending the boundaries: Identifying and countering threats in a usenet newsgroup. Inf. Soc., 12(1), 1996.
20. D. Randall. Rapidly mixing markov chains with applications in computer science and physics. Computing in Science and Engineering, 8(2):30–41, 2006.
21. M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design. IEEE Internet Computing Journal, 6(1), Aug. 2002.
22. Secondlife: secondlife.com.
23. Sophos. Sophos facebook id probe shows 41% of users happy to reveal all to potential identity thieves, August 14 2007.
24. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw., 11(1):17–32, 2003.
25. L. von Ahn, M. Blum, N. Hopper, and J. Langford. Captcha: Using hard ai problems for security. In In Proceedings of EUROCRYPT 03, Lecture Notes in Computer Science, 2003.
26. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybil-limit: A near-optimal social network defense against sybil attacks. In IEEE Symposium on Security and Privacy, pages 3–17, 2008.
27. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: defending against sybil attacks via social networks. SIGCOMM Comput. Commun. Rev., 36(4):267–278, 2006.
28. del.icio.us: delicious.com.
29. Facebook: www.facebook.com.
30. Orkut: www.orkut.com.
31. Wikipedia: www.wikipedia.org.