Abstract
Distributed Hash Tables (DHTs) provide a formally defined structure for overlay networks to store and retrieve content. However, handling malicious nodes which intentionally disrupt the DHT’s functionality is still a research challenge. One particular problem - which is the scope of this paper - is providing availability of the DHT’s lookup service in the presence of attackers. We focus on DHTs with unidirectional routing and present concrete algorithms to extend one particular such DHT, namely Chord. Our extensions provide independent multipath routing and enable routing to replica roots despite attackers on the regular routing path. In addition, we investigate algorithms to detect adversary nodes which employ node-ID suppression attacks during routing. We demonstrate how these techniques can be combined to increase lookup success in a network under attack by deriving analytical bounds for our proposed extensions and simulating how our algorithms come close to these bounds.
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
Awerbuch, B., Scheideler, C.: Towards Scalable and Robust Overlay Networks. In: Sixth International Workshop on Peer-to-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27 (2007)
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Proc. of the 5th Symposium on Operating Systems Design and Implementation, Boston, MA, December 2002, ACM Press, New York (2002)
Condie, T., Kacholia, V., Sankararaman, S., Maniatis, P., Hellerstein, J.M.: Maelstrom: Churn as Shelter, University of California at Berkeley Technical Report No. UCB/EECS-2005-11 (November 2005)
Cox, R., Muthitacharoen, A., Morris, R.: Serving DNS Using a Peer-to-Peer Lookup Service. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of SOSP 2001, Banff, Canada (2001)
Danezis, G., Lesniewski-Laas, C., Kaashoek, M.F., Anderson, R.: Sybil-Resistant DHT Routing. In: de Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305–318. Springer, Heidelberg (2005)
Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)
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)
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Surveys and Tutorials 7(2), 72–93 (2005)
Marti, S., Ganesan, P., Garcia-Molina, H.: DHT Routing Using Social Links. 3rd Int. Workshop on Peer-to-Peer Systems (2004)
Muus, C.: Availability in DHT-based Structured Overlay Networks Considering Chord as an Example, Diploma Thesis, University of Hamburg, Germany (November 2007)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of SIGCOMM 2001, San Diego, USA, August 27-31 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany (November 2001)
Sanchez Artigas, M., Lopez, P.G., Skarmeta, A.F.G.: A Novel Methodology for Constructing Secure Multipath Overlays. IEEE Internet Computing 9(6), 50–57 (2005)
Seedorf, J., Muus, C.: Availability for Structured Overlay Networks: Considerations for Simulation and a new Bound on Lookup Success. In: 12th Nordic Workshop on Secure IT-Systems - NordSec 2007, Reykjavik, Iceland (October 2007)
Singh, A., Castro, M., Druschel, P., Rowstron, A.: Defending against eclipse attacks on overlay networks. In: Proc. of the ACM SIGOPS European Workshop (September 2004)
Singh, K., Schulzrinne, H.: Peer-to-Peer Internet Telephony using SIP. In: Proc. of the international workshop on Network and operating systems support for digital audio and video, Stevenson, Washington, USA, June 2005, pp. 63–68. ACM Press, New York (2005)
Srivatsa, M., Liu, L.: Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis. In: Proc. of the 20th Annual Computer Security Applications Conference (ACSAC), Tucson, Arizona, December 6-10, 2004, pp. 251–261. IEEE CS Press, Los Alamitos (2004)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. In: IEEE/ACM Transactions on Networking, February 2003, vol. 11(1), IEEE Press, Los Alamitos (2003)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22(1) (January 2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Seedorf, J., Muus, C. (2008). Availability for DHT-Based Overlay Networks with Unidirectional Routing. In: Onieva, J.A., Sauveron, D., Chaumette, S., Gollmann, D., Markantonakis, K. (eds) Information Security Theory and Practices. Smart Devices, Convergence and Next Generation Networks. WISTP 2008. Lecture Notes in Computer Science, vol 5019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79966-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-79966-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79965-8
Online ISBN: 978-3-540-79966-5
eBook Packages: Computer ScienceComputer Science (R0)