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
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
Denial of service or denial of security?
Proceedings of the 14th 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
AREX: An Adaptive System for Secure Resource Access in Mobile P2P Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Information leaks in structured peer-to-peer anonymous communication systems
Proceedings of the 15th ACM conference on Computer and communications security
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
Hashing it out in public: common failure modes of DHT-based anonymity schemes
Proceedings of the 8th ACM workshop on Privacy in the electronic society
ReDS: reputation for directory services in P2P systems
Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
| Hi-index | 0.00 |
P2P systems rely on directory services for locating peers with the desired content and services. Directory services are themselves decentralized, such as with distributed hash tables (DHTs) that allow for efficient locating of objects without a centralized directory. As a system distributed over a diverse set of untrusted nodes, however, directory services must be resilient to adversarial behavior by such malicious insiders. While redundancy-based DHTs such as Salsa and Halo mitigate the effects of adversarial behavior, they incur substantial overhead due to redundant lookups. We propose Reputation for Directory Services (ReDS), a framework for using reputation management to enhance the security and reduce the costs of redundancy-based DHTs in the face of insider attacks. We present ReDS designs for both Salsa and Halo, and we show that peers can significantly boost the success rates of directory lookups by considering past performance. For example, our simulations show that Salsa-ReDS can reduce lookup failure rates by up to 94%. We find that applying ReDS effectively cuts the redundancy required by both Salsa and Halo in half to get comparable results.