Sybil-Resistant DHT Routing

George Danezis, Chris Lesniewski-Laas, M. Frans Kaashoek, Ross Anderson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in open networks, where an adversary can perform a sybil attack by introducing a large number of corrupt nodes in the network, considerably degrading its performance. We introduce 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. This ensures that at least some of the nodes queried are good, and hence the search makes forward progress. This strategy makes use of latent social information present in the introduction graph of the network.
Original languageEnglish
Title of host publicationComputer Security -- ESORICS 2005
Subtitle of host publication10th European Symposium on Research in Computer Security, Milan, Italy, September 12-14, 2005. Proceedings
EditorsSabrina de Capitani di Vimercati, Paul Syverson, Dieter Gollmann
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Number of pages14
ISBN (Print)978-3-540-31981-8
Publication statusPublished - 27 Sept 2005
Event10th European Symposium on Research in Computer Security - Milan, Italy
Duration: 12 Sept 200514 Sept 2005
Conference number: 10


Symposium10th European Symposium on Research in Computer Security
Abbreviated titleESORICS 2005


Dive into the research topics of 'Sybil-Resistant DHT Routing'. Together they form a unique fingerprint.

Cite this