By Topic

Resisting Sybil Attack By Social Network and Network Clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ling Xu ; Grad. Sch. of Inf. Sci., Tohoku Univ., Sendai, Japan ; Satayapiwat Chainan ; Hiroyuki Takizawa ; Hiroaki Kobayashi

Peer to peer (P2P) systems are extremely vulnerable to Sybil attacks, in which a malicious user controls a large number of Sybil peers to collude to break the system laws. This paper proposes a distributed algorithm, named Sybil Resisting Network Clustering (SRNC), to resist the Sybil attack by preventing honest peers from communicating with Sybil Peers. SRNC is based on a social network model. In this model, honest peers and Sybil peers can be largely classified into two clusters, connected by a small number of edges, called attack edges. SRNC tries to explicitly detect attack edges, and then prohibits the communication over the detected edges. The performance of SRNC is evaluated by theoretical analysis and simulations. In particular, SRNC ensures theoretically that honest peers totally accept O(|AE|) Sybil peers. This is a O(log(n)) times improvement over SybilLimit, one of the conventional representative Sybil resisting algorithms, where n is the number of peers and |AE| is the number of attack edges in the system. The performance is then evaluated by simulations on data sets of real world social networks.

Published in:

Applications and the Internet (SAINT), 2010 10th IEEE/IPSJ International Symposium on

Date of Conference:

19-23 July 2010