Enforcing collaboration in peer-to-peer routing services

  • Authors:
  • Tim Moreton;Andrew Twigg

  • Affiliations:
  • Computer Laboratory, Cambridge University, UK;Computer Laboratory, Cambridge University, UK

  • Venue:
  • iTrust'03 Proceedings of the 1st international conference on Trust management
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many peer-to-peer services rely on a cooperative model of interaction among nodes, yet actually provide little incentive for nodes to collaborate. In this paper, we develop a trust and security architecture for a routing and node location service based on Kademlia [1], a distributed hash table. Crucially, rather than 'routing round' defective or malicious nodes, we discourage free-riding by requiring a node to contribute honestly in order to obtain routing service in return. We claim that our trust protocol enforces collaboration and show how our modified version of Kademlia resists a wide variety of attacks.