Enforcing Collaboration in Peer-to-Peer Routing Services

  • Tim Moreton
  • Andrew Twigg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2692)


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.


Malicious Node Distribute Hash Table Close Node Trust Protocol Subjective Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Proceedings of IPTPS02, Cambridge, MA. (2002)Google Scholar
  2. 2.
    Adar, E., Huberman, B.: Free riding on Gnutella. In: Technical report, Xerox PARC, 10 Aug. 2000. (2000)Google Scholar
  3. 3.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN’ 02), San Jose, CA, USA (2002)Google Scholar
  4. 4.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). (2001) 329–350Google Scholar
  5. 5.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (2001)Google Scholar
  6. 6.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Security for structured peer-to-peer overlay networks. In: 5th Symposium on Operating Systems Design and Implementaion (OSDI’02). (2002)Google Scholar
  7. 7.
    Christianson, B., Harbison, W.: Why isn’t trust transitive? In: Security Protocols Workshop, 1996, pp. 171–176. (1996)Google Scholar
  8. 8.
    Keane, J.: Trust based dynamic source routing in mobile ad hoc networks. MSc. Thesis, Trinity College Dublin) (2002)Google Scholar
  9. 9.
    Xiong, L., Liu, L.: Building trust in decentralized peer-to-peer electronic communities. In: Fifth International Conference on Electronic Commerce Research (ICECR-5), Canada. (2002)Google Scholar
  10. 10.
    Aberer, K., Despotovic, Z.: Managing trust in a peer-2-peer information system. In: CIKM. (2001) 310–317Google Scholar
  11. 11.
    Jøsang, A.: A logic for uncertain probabilities. Available at (2001)Google Scholar
  12. 12.
    Twigg, A.: A subjective approach to routing in P2P and ad hoc networks. In: 1st International Conference on Trust Management, Crete. (2003)Google Scholar
  13. 13.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. available as tech. Rep., computer science department, stanford university (1998)Google Scholar
  14. 14.
    Geels, D., Kubiatowicz, J.: Replica management should be a game. In: Proceedings of the SIGOPS European Workshop. (2002)Google Scholar
  15. 15.
    Wilcox-O’Hearn, B.: Experiences Deploying a Large-Scale Emergent Network. In: 1st International Peer To Peer Systems Workshop. (2002)Google Scholar
  16. 16.
    Acquisti, A., Dingledine, R., Syverson, P.: On the economics of anonymity. Available at (2003)Google Scholar
  17. 17.
    Douceur, J.: The Sybil Attack. In: 1st International Peer To Peer Systems Workshop. (2002)Google Scholar
  18. 18.
    Lee, S., Sherwood, R., Bhattacharjee, B.: Cooperative Peer Groups in NICE. In: IEEE Infocom. (2003)Google Scholar
  19. 19.
    Levien, R.: Stamp trading networks. Available at (2001)Google Scholar
  20. 20.
    SECURE: Secure: Secure environments for collaboration among ubiquitous roaming entities. EU IST-2001-32486 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tim Moreton
    • 1
  • Andrew Twigg
    • 1
  1. 1.Computer LaboratoryCambridge UniversityUK

Personalised recommendations