• Corpus ID: 12056076

SybilInfer: Detecting Sybil Nodes using Social Networks

@inproceedings{Danezis2009SybilInferDS,
  title={SybilInfer: Detecting Sybil Nodes using Social Networks},
  author={George Danezis and Prateek Mittal},
  booktitle={Network and Distributed System Security Symposium},
  year={2009}
}
SybilInfer is an algorithm for labelling nodes in a social network as honest users or Sybils controlled by an adversary. At the heart of SybilInfer lies a probabilistic model of honest social networks, and an inference engine that returns potential regions of dishonest nodes. The Bayesian inference approach to Sybil detection comes with the advantage label has an assigned probability, indicating its degree of certainty. We prove through analytical results as well as experiments on simulated and… 

Figures from this paper

Improving sybil detection in online social networks

Due to open and anonymous nature, online social networks are particularly vulnerable to Sybil attack, where a malicious user can fabricate many dummy identities to target systems. Recently, there are

SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks

The novel SybilLimit protocol is presented, which leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees, and provides the first evidence that real-world social networks are indeed fast mixing.

SoK: The Evolution of Sybil Defense via Social Networks

This paper surveys the evolution of sybil defense protocols that leverage the structural properties of the social graph underlying a distributed system to identify sybil identities and identifies a community detection algorithm that, for the first time, offers provable guarantees in the context of Sybil defense.

Sybil Detection Using Latent Network Structure

A sybil defense system that accounts for the adversary's ability to launch such attacks yet provably withstands them by making a weaker assumption that creating edges from sybils to most honest nodes is difficult, yet allowing that the remaining nodes can be freely connected to.

Sybil defenses in mobile social networks

This paper proposes a local ranking system for estimating trust-level between users based on both trust and distrust relations, and weakens the impacts of attack edges by removing several suspicious edges with high centrality.

SybilDefender: Defend against sybil attacks in large social networks

The survey results of the Facebook application show that the assumption made by previous work that all the relationships in social networks are trusted does not apply to online social networks, and it is feasible to limit the number of attack edges inOnline social networks by relationship rating.

SybilDefender: A Defense Mechanism for Sybil Attacks in Large Social Networks

The survey results of the Facebook application show that the assumption made by previous work that all the relationships in social networks are trusted does not apply to online social networks, and it is feasible to limit the number of attack edges inOnline social networks by relationship rating.

SybilLimit: A Near-Optimal Social Network Defense

The novel SybilLimit protocol is presented, which leverages the same insight as SybilGuard, but offers dramatically improved and near-optimal guarantees, and provides the first evidence that real-world social networks are indeed fast-mixing.

SYBILFUSE: Combining Local Attributes with Global Structure to Perform Robust Sybil Detection

This work proposes SYBILFUSE, a defense-in-depth framework for Sybil detection when the oversimplified assumptions are relaxed, which achieves 98% of Sybil coverage among top-ranked nodes and outperforms state-of-the-art approaches significantly.
...

References

SHOWING 1-10 OF 30 REFERENCES

SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks

The novel SybilLimit protocol is presented, which leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees, and provides the first evidence that real-world social networks are indeed fast mixing.

SybilGuard: Defending Against Sybil Attacks via Social Networks

This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the ldquosocial networkrdquo among user identities, where an edge between two identities indicates a human-established trust relationship.

A Sybil-proof one-hop DHT

A one-hop distributed hash table which uses the social links between users to strongly resist the Sybil attack is described, which is the first sublinear solution to this problem.

Sybil-Resistant DHT Routing

This work introduces a routing strategy that alleviates some of the effects of such an attack by making sure that lookups are performed using a diverse set of nodes, and makes use of latent social information present in the introduction graph of the network.

Anonymity in the Wild: Mixes on Unstructured Networks

This work explores the efficiency and traffic analysis resistance properties of mix networks based on unstructured topologies as opposed to theoretically optimal structured topologies, under high latency conditions and indicates that mix-networks based on scale-free and small-world topologies have roughly comparable to those in expander graphs.

Mixminion: design of a type III anonymous remailer protocol

Mixminion works in a real-world Internet environment, requires little synchronization or coordination between nodes, and protects against known anonymity-breaking attacks as well as or better than other systems with similar design parameters.

Secure routing for structured peer-to-peer overlay networks

This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.

The Sybil Attack

It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.

Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design

The Gnutella virtual network topology does not match well the underlying Internet topology, hence leading to ineffective use of the physical networking infrastructure, and changes to the Gnutsella protocol and implementations that may bring significant performance and scalability improvements are proposed.

Tor: The Second-Generation Onion Router

This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points.