Security Considerations for Peer-to-Peer Distributed Hash Tables. Sit, E. and Morris, R. 2002.
Security Considerations for Peer-to-Peer Distributed Hash Tables [link]Paper  abstract   bibtex   
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 peer-to-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.
@conference {687810,
	title = {Security Considerations for Peer-to-Peer Distributed Hash Tables},
	booktitle = {IPTPS {\textquoteright}01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
	year = {2002},
	pages = {261{\textendash}269},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {London, UK},
	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 peer-to-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.},
	keywords = {distributed hash table, P2P},
	isbn = {3-540-44179-4},
	url = {http://portal.acm.org/citation.cfm?id=687810$\#$},
	author = {Emil Sit and Robert Morris}
}
Downloads: 0