Abstract
The provisioning of techniques for secure message forwarding over Distributed Hash Tables has been a research concern for a long time. Several techniques have been developed and evaluated, but typically each based on the increase of redundancy as a defense against data forwarding attacks. Although the security vigor of these solutions, they have left the scalability aspect largely unaddressed, as the weak peers may not support the congestion caused by the increase on redundancy. In this article, we take the opposite tack and discuss why improving the quality of delivery paths can achieve a resilience comparable to redundant routing. To prove our intuition, we confront the two strategies and develop a representative algorithm of each category. Further, we validate our work using two other existing protocols that increase redundancy (more independent paths) to fortify routing. Our results reveal that improving the quality of paths can be as effective as increasing redundancy but with minimum overhead.
This research was partially funded through project P2PGRID, TIN2007-68050-C03-03, of the Ministry of Education and Science, Spain.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)
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)
Artigas, M., et al.: A novel methodology for constructing secure multipath overlays. IEEE Internet Computing 9(6), 50–57 (2005)
Harvesf, C., Blough, D.M.: The effect of replica placement on routing robustness in distributed hash tables. In: P2P 2006, pp. 57–66 (2006)
Castro, M., et al.: Secure routing for structured peer-to-peer overlay networks. SIGOPS Oper. Syst. Rev. 36(SI), 299–314 (2002)
Wang, P., Osipkov, I., Hopper, N., Kim, Y.: Myrmic: Secure and robust dht routing (submission, 2007)
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)
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)
Awerbuch, B., Scheideler, C.: Robust random number generation for peer-to-peer systems. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 275–289. Springer, Heidelberg (2006)
King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23th annual ACM symposium on Principles Of Distributed Computing(PODC 2004), pp. 125–130 (2004)
Motwani, R., Raghavan, P.: Randomized Algortihms. Cambrige Univ. Press, Cambrige (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sànchez-Artigas, M., García-López, P., Skarmeta, A.G. (2008). Secure Forwarding in DHTs - Is Redundancy the Key to Robustness?. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)