Graph-based Sybil Detection in social and information systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

33 Citations (Scopus)

Abstract

Sybil attacks in social and information systems have serious security implications. Out of many defence schemes, Graph-based Sybil Detection (GSD) had the greatest attention by both academia and industry. Even though many GSD algorithms exist, there is no analytical framework to reason about their design, especially as they make different assumptions about the used adversary and graph models. In this paper, we bridge this knowledge gap and present a unified framework for systematic evaluation of GSD algorithms. We used this framework to show that GSD algorithms should be designed to find local community structures around known non-Sybil identities, while incrementally tracking changes in the graph as it evolves over time.

Original languageEnglish
Title of host publicationProceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013
PublisherAssociation for Computing Machinery
Pages466-473
Number of pages8
ISBN (Print)9781450322409
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013 - Niagara Falls, ON, Canada
Duration: 25 Aug 201328 Aug 2013

Publication series

NameProceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013

Conference

Conference2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013
Country/TerritoryCanada
CityNiagara Falls, ON
Period25/08/1328/08/13

Fingerprint

Dive into the research topics of 'Graph-based Sybil Detection in social and information systems'. Together they form a unique fingerprint.

Cite this