Sybil detection via distributed sparse cut monitoring

IEEE International Conference on Communications

Volumn , Issue , 2011, Pages

  Kurve, Aditya ^a   Kesidis, George ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

peer to peer; reputation; social networks; sybils

Indexed keywords

AD HOC SYSTEMS; DISTRIBUTED ALGORITHM; LARGE NETWORKS; PEER TO PEER; REPUTATION; REPUTATION SYSTEMS; SHEER SIZE; SOCIAL NETWORKS; SYBILS;

ALGORITHMS;

PEER TO PEER NETWORKS;

EID: 80052163217     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2011.5963402     Document Type: Conference Paper

References (21)

1. J. Aspnes. Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3): pp. 165-175, Sept. 2003.
2. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Second Edition. Wiley, 2004.
3. R. Bazzi and G. Konjevod, "On the establishment of distinct identities in overlay networks," in Proc. ACM Symp. Principles of Distributed Computing (PODC), Las Vegas, NV, pp. 312-320, July 2005.
4. P. Buser, "A note on the isoperimetric constant," Ann. Sci. cole Norm, Sup.(4)15, no.2, 213-230, 1982.
5. A. Cheng and E. Friedman, "Sybilproof reputation mechanisms," in Proc. ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems (P2PECON), Philadelphia, PA, pp. 128-132, Aug. 2005.
6. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press, 2001.
7. E. Damiani, D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante, "A reputation-based approach for choosing reliable resources in peer-to-peer networks," in Proc. ACM CCS, 2002.
8. G. Danezis and P. Mittal, "SybilInfer: Detecting sybil nodes using social networks," in Proc. NDSS, San Diego, CA, Feb. 2009.
9. M. Dell'Amico and Y. Roudier, "A Measurement of Mixing Time in Social Networks," in Proc. 5th International Workshop on Security and Trust Management, Saint Malo, France, Sept. 2009.
10. J. R. Douceur, "The sybil attack," in Proc. Int'l Workshop on Peer-to-Peer Systems (IPTPS), pp. 251-260, 2002.
11. S. Kamvar, M. Schlosser, and H. Garcia-Molina, "The EigenTrust Algorithm for Reputation Management in P2P Networks," in Proc. ACM World Wide Web Conf., May 2003.
12. D.R. Karger, "Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm" in Proc. ACM/SIAM Symp. Discrete Algorithms, pp. 21-30, 1993.
13. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," Technical Report TR 95-035, Department of Computer Science, University of Minnesota, 1995.
14. B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs", The Bell System Technical Journal, 1970.
15. G. Kesidis, A. Tangpong and C. Griffin, "A sybil-proof referral system based on multiplicative reputation chains," IEEE Comm. Letters, pp. 862-864, Nov. 2009.
16. Monien, B., R. Preis, and R. Diekmann, "Quality Matching and Local Improvement for Multilevel Graph-Partitioning.," Parallel Computing 26(12): pp. 1605-1634, 2000.
17. NetLogo itself: Wilensky, U. 1999. NetLogo. http://ccl.northwestern.edu/ netlogo/. Center for Connected Learning and Computer-Based Modeling, Northwestern University. Evanston, IL.
18. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, "Random graphs with arbitrary degree distributions and their applications," Phys. Rev. E, 64, 2001.
19. M. Spear, X. Lu, N. Matloff, and S. F. Wu, "Karmanet: Leveraging trusted social path to create judicious forwarders," in Proc. Future Information Networks, 2009. ICFIN, pp. 218-223, 2009.
20. L. von Ahn, M. Blum, N. J. Hopper, and J. Langford, "CAPTCHA: Using hard AI problems for security," in Proc. Eurocrypt 2003, Warsaw, Poland, pp. 294-311, May 2003.
21. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman, "SybilGuard: Defending Against Sybil Attacks via Social Networks," IEEE Trans. Networking, 16(3), pp. 576-589, June 2008.