First, we clarify the deep connection between sybil defense and the theory of random walks. This leads us to identify a community detection algorithm that ...

This article surveys the evolution of sybil defense protocols that leverage the structural properties of the social graph underlying a distributed system to ...

Sep 15, 2014 · This article surveys the evolution of sybil defense protocols that leverage the structural properties of the social graph underlying a ...

Our teams advance the state of the art through research, systems engineering, and collaboration across Google. See our teams. Teams.

This article surveys the evolution of sybil defense protocols that leverage the structural properties of the social graph underlying a distributed system to ...

By Lorenzo Alvisi, Alessandro Epasto & 3 more. Sybil attacks, in which an adversary forges a potentially unbounded number of identities, are a danger to ...

The intuition of the lazy and originator- biased random walk is that nodes trust “their own selves” and other nodes within their community more than others. On ...

curve is the number of nodes traversed by random walks originating from a sybil node no smaller than 5 times. ... the existence of social communities, even social ...

This paper presents SybilDefender, a sybil defense mechanism that leverages the network topologies to defend against sybil attacks in social networks. Based on ...

SybilGuard uses the intersections between modified random walks to determine whether identities should be accepted. SybilLimit improves on. SybilGuard's bound ...