Melola Discovery

← Melola Discovery

Jurnal SINTA 2

An Analysis of Graph Properties for Detecting Sybil Nodes in Social Networks

Journal of ICT Research and Applications (JICTRA) · Vol. 12 No. 2 (2018) · pp. 185–205

DOI
10.5614/itbj.ict.res.appl.2018.12.2.6
ISSN
2338-5499, 2337-5787
Published
2018-09-28
Publisher
DRI - ITB
Language
eng

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.

Keywords

Collaboration network of the authors

5 authors · 5 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • King Mongkut's University of Technology North Bangkok
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Weena JanratchakoolKing Mongkut's University of Technology North Bangkok2
Sucha SmanchatKing Mongkut's University of Technology North Bangkok2
Narongrit WangkeereeKing Mongkut's University of Technology North Bangkok1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 1 Nov 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">An Analysis of Graph Properties for Detecting Sybil Nodes in Social Networks</dc:title>
	<dc:creator>Kaewking, Korkiat</dc:creator>
	<dc:creator>Boonkrong, Sirapat</dc:creator>
	<dc:subject xml:lang="en-US">attack graph</dc:subject>
	<dc:subject xml:lang="en-US">graph theory</dc:subject>
	<dc:subject xml:lang="en-US">social graph</dc:subject>
	<dc:subject xml:lang="en-US">social network</dc:subject>
	<dc:subject xml:lang="en-US">Sybil attack</dc:subject>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2018-09-28</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/6398</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.res.appl.2018.12.2.6</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 12 No. 2 (2018); 185-205</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:source>10.5614/itbj.ict.res.appl.2018.12.2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/6398/3462</dc:relation>
</oai_dc:dc>