Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Cyclone: A Novel Design Schema for Hierarchical DHTs
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Proceedings of the 16th ACM conference on Computer and communications security
Birds of a FETHR: open, decentralized micropublishing
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
ReDS: reputation for directory services in P2P systems
Proceedings of the 2010 ACM workshop on Insider threats
| Hi-index | 0.00 |
Peer-to-peer (P2P) architectures are gaining popularity and importance for applications ranging from massive-scale Internet content delivery to mobile social networks. Such P2P systems must provide directory services for locating peers with the desired content and services. These directory services are themselves decentralized, such as with distributed hash tables (DHTs), which allow for efficient locating of objects without any centralized directory. Being a distributed system over a diverse set of untrusted nodes, however, such directory services must be resilient to adversarial behavior. Otherwise, the entire P2P system can be crippled by manipulating or simply denying access to resources. We propose Reputation for Directory Services (ReDS), a framework for using reputation management to enhance the security of finding information in distributed systems. While previous reputation systems have addressed several specific applications of P2P networks (e.g., by identifying peers who share bad files), directory services form the backbone of P2P systems and have unique properties with respect to reputation that make them worth investigating. In this extended abstract, we motivate our investigation of ReDS and describe preliminary results that show its effectiveness in the Salsa P2P system.