Secure routing in peer-to-peer distributed hash tables

Show simple item record

dc.contributor.author Needels, Keith
dc.contributor.author Kwon, Minseok
dc.date.accessioned 2009-02-11T18:23:07Z
dc.date.available 2009-02-11T18:23:07Z
dc.date.issued 2009
dc.identifier.uri http://hdl.handle.net/1850/8245
dc.description To appear in the ACM Symposium on Applied Computing (SAC), March 2009. This article is copyright of ACM, and will appear on their home page at: http://www.acm.org/ en_US
dc.description.abstract Distributed hash tables (DHTs) provide efficient and scalable look up mechanisms for locating data in peer-to-peer (p2p) networks. Several issues, however, prevent DHT-based p2p networks from being widely deployed – one of which is security. Malicious peers may modify, drop, misroute lookup requests, or even collude to deny the availability of target data. To address these security concerns, we propose an extension to Chord named Sechord. The main idea is that the source can determine whether the next hop is valid or invalid by estimating how far the next hop is from its finger pointer. If the next hop is too far away from the finger pointer, especially compared to the average distance between two consecutive peers, the source can infer some ongoing malicious activities. Our modifications require no trust between two nodes except node join. Moreover, each node utilizes locally available information to evaluate hops encountered during the lookup routing process for validity. These modifications have been implemented and evaluated in the presence of malicious nodes. Our results show that Sechord significantly enhances the security of structured p2p systems at the expense of slightly increased hop count.
dc.language.iso en_US
dc.subject Distributed hash tables en_US
dc.subject Peer-to-peer overlay networks en_US
dc.subject Routing en_US
dc.subject Security en_US
dc.title Secure routing in peer-to-peer distributed hash tables
dc.type Proceedings

Files in this item

Files Size Format View
MKwonConfProc03-2009.pdf 91.53Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse