An analysis of graph properties for detecting sybil nodes in social networks

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This research concerns the analysis of social networks using graph theory to find properties that can be used to determine Sybil nodes. This research also investigated the mixing time, which is one of the properties that many existing methods use for detecting Sybil attacks. The results showed that the mixing time does not reflect the difference between honest graphs and Sybil graphs. In addition, the properties of social graphs were studied and it was found that the average node distance is different in graphs containing Sybil nodes than in graphs with only honest nodes. Furthermore, the eigenvector centrality and the degree of Sybil nodes are correlated, while in honest nodes they are not.

Cite

CITATION STYLE

APA

Kaewking, K., & Boonkrong, S. (2018). An analysis of graph properties for detecting sybil nodes in social networks. Journal of ICT Research and Applications, 12(2), 185–205. https://doi.org/10.5614/itbj.ict.res.appl.2018.12.2.6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free