Abstract
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 language | English |
---|---|
Title of host publication | Computer Security -- ESORICS 2005 |
Subtitle of host publication | 10th European Symposium on Research in Computer Security, Milan, Italy, September 12-14, 2005. Proceedings |
Editors | Sabrina de Capitani di Vimercati, Paul Syverson, Dieter Gollmann |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 305-318 |
Number of pages | 14 |
ISBN (Print) | 978-3-540-31981-8 |
DOIs | |
Publication status | Published - 27 Sept 2005 |
Event | 10th European Symposium on Research in Computer Security - Milan, Italy Duration: 12 Sept 2005 → 14 Sept 2005 Conference number: 10 |
Symposium
Symposium | 10th European Symposium on Research in Computer Security |
---|---|
Abbreviated title | ESORICS 2005 |
Country/Territory | Italy |
City | Milan |
Period | 12/09/05 → 14/09/05 |