Security Considerations for Peer-to-Peer Distributed Hash Tables
Lecture notes in computer sciencePublished 1 January 2002
Emil Sit, Robert Morris
Citations401
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper looks at what sorts of security problems are inherent in large peer-to-peer systems based on distributed hash lookup systems, and proposes some design principles for detecting and preventing these problems.
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 hav 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 examin 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
Computer Science
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Lecture notes in computer sciencePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
7,296 Citations2001Antony Rowstron, Peter Druschel
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
A scalable content-addressable network
6,407 Citations2001Sylvia Ratnasamy, Paul Francis +3 more
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
2,143 Citations2001Ben Y. Zhao, John Kubiatowicz +1 more
Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources.
ACM SIGCOMM Computer Communication ReviewA scalable content-addressable network
1,789 Citations2001Sylvia Ratnasamy, Paul Francis +3 more
Wide-area cooperative storage with CFS
1,435 Citations2001Frank Dabek, M. Frans Kaashoek +3 more
The Cooperative File System is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval with a completely decentralized architecture that can scale to large systems.
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
1,220 Citations2001Antony Rowstron, Peter Druschel
The storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility based on a self-organizing, Internet-based overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache additional copies of popular files, is evaluated.
Tarzan
671 Citations2002Michael J. Freedman, Robert Morris
Measurements show that Tarzan imposes minimal overhead over a corresponding non-anonymous overlay route, and Protocols toward unbiased peer-selection offer new directions for distributing trust among untrusted entities.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
624 Citations2001Ben Y. Zhao, John Kubiatowicz +1 more
Lecture notes in computer scienceScribe: The Design of a Large-Scale Event Notification Infrastructure
514 Citations2001Antony Rowstron, Anne-Marie Kermarrec +2 more
Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization and locality properties.
ACM SIGOPS Operating Systems ReviewWide-area cooperative storage with CFS
119 Citations2001Frank Dabek, M. Frans Kaashoek +3 more
Lecture notes in computer scienceIntroducing Tarzan, a Peer-to-Peer Anonymizing Network Layer
104 Citations2002Michael J. Freedman, Emil Sit +2 more
Tarzan is introduced, a peer-to-peer anonymous network layer that provides generic IP forwarding and can provide anonymity to existing applications, such as web browsing and file sharing, without change to those applications.
Early measurements of a cluster-based architecture for P2P systems
104 Citations2001Balachander Krishnamurthy, Jia Wang +1 more
The query locality observed in Gnutella traces is discussed and caching as a short-term approach to increase Gnutsella’s scalability is suggested, which would help improve the application-level content location and routing within the network.
Operating Systems Design and ImplementationFast and secure distributed read-only file system
64 Citations2000Kevin Fu, M. Frans Kaashoek +1 more