Sybil detection via distributed sparse cut monitoring

Aditya Kurve, George Kesidis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Decentralized reputation systems help to enforce discipline and fairness in large unstructured and ad-hoc systems by rewarding good behavior and penalizing dishonest or greedy behavior. They are essential in large networks of independent nodes where centralized monitoring of node behavior is difficult due to the sheer size of the network. Sybil nodes pose a threat to the reputation systems by false referrals through sybil identities. We propose a scalable and distributed algorithm to identify attack edges and quarantine sybil clusters. This algorithm works well with dynamic trust graphs as nodes do not need to store any pre-computed data.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
StatePublished - Sep 2 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: Jun 5 2011Jun 9 2011

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period6/5/116/9/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Sybil detection via distributed sparse cut monitoring'. Together they form a unique fingerprint.

  • Cite this

    Kurve, A., & Kesidis, G. (2011). Sybil detection via distributed sparse cut monitoring. In 2011 IEEE International Conference on Communications, ICC 2011 [5963402] (IEEE International Conference on Communications). https://doi.org/10.1109/icc.2011.5963402