Secure Routing Strategies in DHT-Based Systems

  • Ricardo Villanueva
  • Maria del Pilar Villamil
  • Mile Arnedo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6265)


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.


Overlay Network Malicious Node Distribute Hash Table Reputation System Faulty Node 
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.
    Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. In: SPPA’06, pp. 318–327. ACM, New York (2006)Google Scholar
  2. 2.
    Awerbuch, B., Scheideler, C.: Towards scalable and robust overlay networks. In: IPTPS’07 (2007)Google Scholar
  3. 3.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: SIGOPS’02, pp. 299–314. ACM, New York (2002)Google Scholar
  4. 4.
    Danezis, G., Lesniewski-Laas, C., Kaashoek, M., Anderson, R.: Sybil-resistant DHT routing. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305–318. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803–814. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Fedotova, N., Bertucci, M., Veltri, L.: Reputation management techniques in DHT-based peer-to-peer networks. In: ICIW’07, p. 4. IEEE, Los Alamitos (2007)Google Scholar
  8. 8.
    Harvesf, C., Blough, D.: Replica placement for route diversity in tree-based routing distributed hash tables. In: TDSC’09. IEEE, Los Alamitos (2007)Google Scholar
  9. 9.
    Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: DICS’03, pp. 321–336. Springer, Heidelberg (2003)Google Scholar
  10. 10.
    Kapadia, A., Triandopoulos, N.: Halo: high-assurance locate for distributed hash tables. In: NDSS’08 (2008)Google Scholar
  11. 11.
    Lesniewski-Laas, C., Kaashoek, F.: Whānau: A Sybil-Proof Distributed Hash Table. In: NSDI’10 (2010)Google Scholar
  12. 12.
    Marti, S., Ganesan, P., Garcia-Molina, H.: DHT routing using social links. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 100–111. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Naor, M., Wieder, U.: A simple Fault Tolerant Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 88–97. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Needels, K., Kwon, M.: Secure routing in peer-to-peer distributed hash tables. In: SAC’09, pp. 54–58. ACM, New York (2009)Google Scholar
  15. 15.
    Ratsanamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM’01, pp. 161–172. ACM, New York (2001)Google Scholar
  16. 16.
    Roh, B., Kwon, O., Hong, S., Kim, J.: The exclusion of malicious routing peers in structured P2P systems. In: IPTPS’06, pp. 43–50. Springer, Heidelberg (2006)Google Scholar
  17. 17.
    Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  18. 18.
    Saia, J., Fiaty, A., Gribble, S., Karlin, A., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 270–279. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. 19.
    Sánchez-Artigas, M., García-López, P., Gómez, A.: A novel methodology for constructing secure multi-path overlay. In: Internet Computing’05, pp. 50–57. IEEE, Los Alamitos (2005)Google Scholar
  20. 20.
    Sánchez-Artigas, M., García-López, P., Gómez, A.: Bypass: providing secure DHT routing through bypassing malicious peers. In: ISCC’08, pp. 934–941. IEEE, Los Alamitos (2008)Google Scholar
  21. 21.
    Sánchez-Artigas, M., García-López, P., Gómez, A.: Secure forwarding in DHTs-is redundancy the key to robustness? In: EuroPar’08, pp. 611–621. Springer, Heidelberg (2008)Google Scholar
  22. 22.
    Sánchez-Artigas, M., García-López, P.: On routing in distributed hash tables: is reputation a shelter from malicious behavior and churn? In: P2P’09, pp. 31–40. IEEE, Los Alamitos (2009)Google Scholar
  23. 23.
    Singh, A., Ngan, T., Druschel, P., Wallach, D.: Eclipse attacks on overlay networks: threats and defenses. In: INFOCOM’06, pp. 1–12. IEEE, Los Alamitos (2006)Google Scholar
  24. 24.
    Scheideler, C.: How to spread adversarial nodes? Rotate! In: STOC’05, pp. 704–713. ACM, New York (2005)Google Scholar
  25. 25.
    Sit, E., Morris, R.: Security considerations for peer-to-peer distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 261–269. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  26. 26.
    Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In: ACSAC’04, pp. 252–261. IEEE, Los Alamitos (2004)Google Scholar
  27. 27.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: SIGCOMM’01, pp. 149–160. ACM, New York (2001)Google Scholar
  28. 28.
    Wang, P., Osipkov, I., Hopper, N., Kim, Y.: Myrmic: secure and robust DHT routing (2007) (submission)Google Scholar
  29. 29.
    Xiang, X., Jin, T.: Efficient secure message routing for structured peer-to-peer systems. In: NSWCTC’09, pp. 354–357. IEEE, Los Alamitos (2009)Google Scholar
  30. 30.
    Young, M., Kate, A., Goldberg, I., Karsten, M.: Practical robust communication in DHTs tolerating a byzantine adversary. In: ICDCS’10. IEEE, Los Alamitos (2010)Google Scholar
  31. 31.
    Yu, H., Kaminsky, M., Gibbons, P., Falxman, A.: SybilGuard: defending against sybil attacks via social networks. In: SIGCOMM’06, pp. 267–278. ACM, New York (2006)Google Scholar
  32. 32.
    Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A., Kubiatowicz, J.: Tapestry: a resilient global-scale overlay for service deployment. In: J-SAC’04, pp. 41–53. IEEE, Los Alamitos (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ricardo Villanueva
    • 1
  • Maria del Pilar Villamil
    • 1
  • Mile Arnedo
    • 1
  1. 1.University of Los AndesRepublic of Colombia

Personalised recommendations