Security Considerations for Peer-to-Peer Distributed Hash Tables (2002)
Cached
Download Links
| Citations: | 146 - 2 self |
BibTeX
@INPROCEEDINGS{Sit02securityconsiderations,
author = {Emil Sit and Robert Morris},
title = {Security Considerations for Peer-to-Peer Distributed Hash Tables},
booktitle = {},
year = {2002},
pages = {261--269},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent peer-to-peer research has focused on providing efficient hash lookup systems that can be used to build more complex systems. These systems have good properties when their algorithms are executed correctly but have not generally considered how to handle misbehaving nodes. This paper looks at what sorts of security problems are inherent in large peerto -peer systems based on distributed hash lookup systems. We examine the types of problems that such systems might face, drawing examples from existing systems, and propose some design principles for detecting and preventing these problems.
