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
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
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
How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Reputation Management Techniques in DHT-Based Peer-to-Peer Networks
ICIW '07 Proceedings of the Second International Conference on Internet and Web Applications and Services
Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Secure routing in peer-to-peer distributed hash tables
Proceedings of the 2009 ACM symposium on Applied Computing
Efficient Secure Message Routing for Structured Peer-to-Peer Systems
NSWCTC '09 Proceedings of the 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Whanau: a sybil-proof distributed hash table
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Due to the inherent characteristics of peer-to-peer systems, one of the barriers to deploy applications over public networks is the different security levels that have to be provided. Peer-to-peer systems are vulnerable to several attacks. In particular, for routing attacks, an adversary attempts to mis-route or drop messages along the routing procedure or corrupt routing table entries, thus degrading the overall routing process. In this paper, we propose a taxonomy of solutions to the routing attack, identify new issues and shape future directions.