Sybil Attacks: Sybil Guard or puzzles?


Sybil Guard is a decentralized system that ‘limits the corruptive influence of Sybil attacks’ (Yu et al., 2008) and determines potential attackers by using a graph system. This innovative system will ensure the verification of Sybil attacks by differentiating links in the graph, between Sybil nodes and human established connections known as honest nodes. In the world of social networking, Sybil Guard works efficiently. Subsequently, this mechanism is comprised with characteristics that will maintain security and trust in online social networking sites by identifying honest and malicious activity among users and networks. These characteristics will include the dissemination of attack edges that are vital to interpret malicious behaviour.

Another algorithm that is proposed is the conception of installing ‘computational puzzles to be solved prior to granting new identities’ (Cordeiro, Santos, Mauch, Barcelos, & Gaspary, 2012). Even though this approach will minimize attackers and the stealth of identities, there is a crucial disadvantage to this protocol. By assigning these puzzles that are targeted to confront sybil activity, honest users are coupled with this intractable task. In defense to this slight flaw, experts recommend higher, more complex puzzles to attackers while genuine users will be conformed to easier puzzles. As a result, by establishing these puzzles, the number of sybil attacks is brought to a minimum without ‘compromising the intrinsic characteristics of P2P networks’ (Cordeiro et al., 2012). In contrast to previous undertaken experiments, this mechanism will possess an ‘adaptive’ puzzle mechanism for identity administration and legitimization. Part 3: Nodes & Attack Edges.


Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman A.D. (2008). SybilGuard: Defending against sybil attacks via social networks. IEEE/ACM Transactions on Networking, 16(3), 576-589.

Cordeiro, W. L. D., Santos, F. R., Mauch, G. H., Barcelos, M. P., & Gaspary, L. P. (2012). Identity management based on adaptive puzzles to protect P2P systems. Computer Networks, 56(11), 2569-2589.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s