ACM Home Page
Please provide us with feedback. Feedback
Secure routing in peer-to-peer distributed hash tables
Full text PdfPdf (268 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Computer networks track table of contents
Pages 54-58  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
Keith Needels  Rochester Institute of Technology, Rochester, NY
Minseok Kwon  Rochester Institute of Technology, Rochester, NY
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 40,   Downloads (12 Months): 118,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529292
What is a DOI?

ABSTRACT

Distributed hash tables (DHTs) provide efficient and scalable lookup 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BitTorrent. http://www.bittorrent.com/.
 
2
Napster. http://www.napster.com.
3
 
4
T. Condie, V. Kacholia, S. Sankararaman, J. Hellerstein, and P. Maniatis. Induced Churn as Shelter from Routing Table Poisoning. In Proc. of NDSS, February 2006.
 
5
G. Danezis, C. Lesiewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-Resistant DHT Routing. In Proc. of the 10th European Symposium on Research in Computer Security, pages 305--318, September 2005.
 
6
7
8
 
9
S. Nielson, S. Crosby, and D. Wallach. A Taxonomy of Rational Attacks. In Proc. of IPTPS, February 2005.
10
 
11
A. Singh and L. Liu. Agyaat: Providing Mutually Anonymous Services over Structured P2P Networks. In Proc. of the 14th World Wide Web Conference, pages 422--431, May 2005.
 
12
13
14
 
15
D. Wallach. A Survey of Peer-to-Peer Security Issues. In Proc. of the ACM International Symposium on Software Security (ISSS), June 2002.

Collaborative Colleagues:
Keith Needels: colleagues
Minseok Kwon: colleagues