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
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
POST: a secure, resilient, cooperative messaging system
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Parallel and Distributed Systems
WTR: a reputation metric for distributed hash tables based on a risk and credibility factor
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Information Sciences: an International Journal
Hi-index | 0.00 |
Structured Peer to Peer overlays have shown to be a very good solution for building very large scale distributed information systems. Most of them are based on Distributed Hash Tables (DHTs) that provide an easy way to manage replicas, thus facilitating high availability of data as well as fault tolerance. However, DHTs can also be affected by some well known Distributed Denial of Services attacks that can lead to almost complete unavailability of the stored objects. Very few powerful solutions exist for this kind of security weakness, and increasing the number of replicas for a given object seems to be the best known one. In this paper, we show how a recursive replicating schema can provide a good solution for this kind of attack.