ReDS: A Framework for Reputation-Enhanced DHTs

  title={ReDS: A Framework for Reputation-Enhanced DHTs},
  author={R. Akavipat and M. N. Al-Ameen and Apu Kapadia and Z. Rahman and Roman Schlegel and Matthew K. Wright},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  • R. Akavipat, M. N. Al-Ameen, +3 authors Matthew K. Wright
  • Published 2014
  • Computer Science
  • IEEE Transactions on Parallel and Distributed Systems
  • Distributed hash tables (DHTs), such as Chord and Kademlia, offer an efficient means to locate resources in peer-to-peer networks. Unfortunately, malicious nodes on a lookup path can easily subvert such queries. Several systems, including Halo (based on Chord) and Kad (based on Kademlia), mitigate such attacks by using redundant lookup queries. Much greater assurance can be provided; we present Reputation for Directory Services (ReDS), a framework for enhancing lookups in redundant DHTs by… CONTINUE READING
    12 Citations

    Figures and Topics from this paper.

    Load balancing algorithm using reputation-ReDS in the magnified distributed hash table
    • A. Vijayaraj, R. Suresh, K. Devi
    • Computer Science
    • 2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)
    • 2015
    • 1
    • Highly Influenced
    Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash table
    • 1
    Randomness, Age, Work: Ingredients for Secure Distributed Hash Tables
    Enhancing Collusion Resilience in Reputation Systems
    • 6
    • PDF
    A strong and efficient privacy and security guarantee using CACHET
    Reputation systems: A survey and taxonomy
    • 125
    • PDF
    VPCH: A Consistent Hashing Algorithm for Better Load Balancing in a Hadoop Environment
    • 4
    A mechanism for resource pricing and fairness in peer-to-peer networks
    • 10
    Descriptive analysis of Hash Table based Intrusion Detection Systems
    • S. Raj, R. Rajesh
    • Computer Science
    • 2016 International Conference on Data Mining and Advanced Computing (SAPIENCE)
    • 2016
    • 3


    Halo: High-Assurance Locate for Distributed Hash Tables
    • 50
    • PDF
    ReDS: reputation for directory services in P2P systems
    • 6
    • PDF
    Making Chord Robust to Byzantine Attacks
    • 116
    • PDF
    Salsa: a structured approach to large-scale anonymity
    • 163
    • PDF
    Towards a scalable and robust DHT
    • 24
    Reducing communication costs in robust peer-to-peer networks
    • 20
    • PDF
    Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables
    • 13
    • PDF
    Secure routing for structured peer-to-peer overlay networks
    • 894
    • PDF
    Chord: A scalable peer-to-peer lookup service for internet applications
    • 9,284
    • Highly Influential
    • PDF
    NISAN: network information service for anonymization networks
    • 47
    • PDF