Graph-based Sybil Detection in social and information systems

Yazan Boshmaf, Konstantin Beznosov, Matei Ripeanu

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

20 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

Other

Other2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013
CountryCanada
CityNiagara Falls, ON
Period25/8/1328/8/13

Fingerprint

Information systems
Industry

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Boshmaf, Y., Beznosov, K., & Ripeanu, M. (2013). Graph-based Sybil Detection in social and information systems. In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013 (pp. 466-473). Association for Computing Machinery. https://doi.org/10.1145/2492517.2492568

Graph-based Sybil Detection in social and information systems. / Boshmaf, Yazan; Beznosov, Konstantin; Ripeanu, Matei.

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013. Association for Computing Machinery, 2013. p. 466-473.

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

Boshmaf, Y, Beznosov, K & Ripeanu, M 2013, Graph-based Sybil Detection in social and information systems. in Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013. Association for Computing Machinery, pp. 466-473, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, Niagara Falls, ON, Canada, 25/8/13. https://doi.org/10.1145/2492517.2492568
Boshmaf Y, Beznosov K, Ripeanu M. Graph-based Sybil Detection in social and information systems. In Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013. Association for Computing Machinery. 2013. p. 466-473 https://doi.org/10.1145/2492517.2492568
Boshmaf, Yazan ; Beznosov, Konstantin ; Ripeanu, Matei. / Graph-based Sybil Detection in social and information systems. Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013. Association for Computing Machinery, 2013. pp. 466-473
@inproceedings{5b07bbc464fe45daabce215b694c2c2d,
title = "Graph-based Sybil Detection in social and information systems",
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.",
author = "Yazan Boshmaf and Konstantin Beznosov and Matei Ripeanu",
year = "2013",
doi = "10.1145/2492517.2492568",
language = "English",
isbn = "9781450322409",
pages = "466--473",
booktitle = "Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Graph-based Sybil Detection in social and information systems

AU - Boshmaf, Yazan

AU - Beznosov, Konstantin

AU - Ripeanu, Matei

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893231662&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893231662&partnerID=8YFLogxK

U2 - 10.1145/2492517.2492568

DO - 10.1145/2492517.2492568

M3 - Conference contribution

AN - SCOPUS:84893231662

SN - 9781450322409

SP - 466

EP - 473

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

PB - Association for Computing Machinery

ER -