A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Serving DNS Using a Peer-to-Peer Lookup Service
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
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
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
Peer-to-peer internet telephony using SIP
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
Defending against eclipse attacks on overlay networks
Proceedings of the 11th workshop on ACM SIGOPS European workshop
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
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
Lawful Interception in P2P-Based VoIP Systems
Principles, Systems and Applications of IP Telecommunications. Services and Security for Next Generation Networks
| Hi-index | 0.00 |
Distributed Hash Tables (DHTs) provide a formally definedstructure for overlay networks to store and retrieve content. However,handling malicious nodes which intentionally disrupt the DHT's functionalityis still a research challenge. One particular problem - which isthe scope of this paper - is providing availability of the DHT's lookupservice in the presence of attackers. We focus on DHTs with unidirectionalrouting and present concrete algorithms to extend one particularsuch DHT, namely Chord. Our extensions provide independent multipathrouting and enable routing to replica roots despite attackers on theregular routing path. In addition, we investigate algorithms to detectadversary nodes which employ node-ID suppression attacks during routing.We demonstrate how these techniques can be combined to increaselookup success in a network under attack by deriving analytical boundsfor our proposed extensions and simulating how our algorithms comeclose to these bounds.