The Sybil Attack

  title={The Sybil Attack},
  author={John R. Douceur},
  booktitle={International Workshop on Peer-to-Peer Systems},
  • John R. Douceur
  • Published in
    International Workshop on…
    7 March 2002
  • Computer Science
Large-scale peer-to-peer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby undermining this redundancy. One approach to preventing these "Sybil attacks" is to have a trusted agency certify identities. This paper shows that, without a logically centralized authority, Sybil… 

Defeating against Sybil-attacks in Peer-to-peer Networks

  • X. Xiang
  • Computer Science
    2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
  • 2012
This paper presents a distributed protocol to reduce the adverse effects of sybil attacks in free riding problem by restricting nodes to obtain the number of service units in a reasonable level and shows the promise of the protocol in limitingSybil attacks while not sacrificing application performance.

Resisting Attrition Attacks on a Peer-to-Peer System

A set of defenses for the LOCKSS digital preservation system is described that help ensure that applicationlevel attacks even from powerful adversaries are less effective than network- level attacks, and that network-level attacks must be intense, wide-spread, and prolonged to impair the system.

Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems : A Quantitative Analysis

A number of recent structured Peer-to-Peer (P2P) systems are built on top of distributed hash table (DHT) based P2P overlay networks that employ a tight-deterministic data placement and ID mapping schemes.

Detection Techniques for Sybil Attack in MANETs

This paper presents a new approach to detect the Sybil attack, called Lightweight Sybil Attack Detection Approach, which is not suitable for mobile ad hoc networks because it usually requires costly initial setup and incurs overhead related to maintaining and distributing cryptographic keys.


This work goes over some of the known issues found in common P2P networks, and analyzes the relevance of such issues and the applicability of existing solutions when using P1P architectures for secure communication.

SybilConf: Computational Puzzles for Confining Sybil Attacks

  • F. TegelerXiaoming Fu
  • Computer Science
    2010 INFOCOM IEEE Conference on Computer Communications Workshops
  • 2010
SybilConf is presented, a simple scheme to increase costs for maintaining an identity, thus reducing the sybil attack's impact and enabling a flexible, strong and identity-bound sybil protection.

Sufficiently Secure Peer-to-Peer Networks

This paper examines censorship resistance in a peer-to-peer network by examining the equilibrium behaviour of the censor and the publisher in a game theoretic model elaborated to include multiple publishers, non-linear cost functions, and non-trivial search heuristics.

Securing peer-to-peer overlay networks from Sybil Attack

  • E. Lua
  • Computer Science
    2007 International Symposium on Communications and Information Technologies
  • 2007
Through cross-pollination of the two schemes, the hybrid security protocol is able to verify the data communications among overlay nodes and identify any malicious (cheating) nodes in a secured manner.

An Evidence Based Architecture for Efficient, Attack-Resistant Computational Trust Dissemination in Peer-to-Peer Networks

This paper's focus is on the particular problem of distributing evidence for use in trust-based security decisions, and presents a system that solves this in a highly scalable way, and resists attacks such as false recommendations and collusion.

Survey on the Sybil Attack in Peer to Peer Wireless Sensor Network

This paper summarizes the existing Sybil defense techniques and proposes new strategies to defend against Sybil attack and its variants.



DOS-Resistant Authentication with Client Puzzles

It is shown how stateless authentication protocols and the client puzzles of Juels and Brainard can be used to prevent denial of service by server resource exhaustion.

The Free Haven Project: Distributed Anonymous Storage Service

A design for a system of anonymous storage which resists the attempts of powerful adversaries to find or destroy any stored data is presented, and a way to classify anonymous systems based on the kinds of anonymity provided is suggested.

Survivable Information Storage Systems

The PASIS architecture flexibly and efficiently combines proven technologies for constructing information storage systems whose availability, confidentiality and integrity policies can survive component failures and malicious attacks.

Secure communications over insecure channels

This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained, and describes a method which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key.

Separating key management from file system security

SFS is presented, a secure file system that avoids internal key management, and its file names effectively contain public keys, making them self-certifying pathnames, which make SFS more versatile than any file system with built-in key management.

Publius: a robust, tamper-evident, censorship-resistant web publishing system

This work describes a system that has the property that it is very difficult for any adversary to censor or modify the content, and the identity of the publisher is protected once the content is posted.

How to Prove Yourself: Practical Solutions to Identification and Signature Problems

Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.

A Modification of the Fiat-Shamir Scheme

This paper proposes an identification and signature scheme based on the difficulty of extracting the L-th roots mod n when the factors of n are unknown and proves that the sequential version of this scheme is a zero knowledge interactive proof system and the parallel version satisfies variations of no transferable information under some conditions.

Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs

It is concluded that the measured desktop infrastructure would passably support the proposed serverless distributed file system, providing availability on the order of one unfilled file request per user per thousand days.

Practical Byzantine fault tolerance

A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.