| Secure routing in peer-to-peer distributed hash tables |
| Full text |
Pdf
(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
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 40, Downloads (12 Months): 118, Citation Count: 0
|
|
|
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
|
Miguel Castro , Peter Druschel , Ayalvadi Ganesh , Antony Rowstron , Dan S. Wallach, Secure routing for structured peer-to-peer overlay networks, Proceedings of the 5th symposium on Operating systems design and implementation Due to copyright restrictions we are not able to make the PDFs for this conference available for downloading, December 09-11, 2002, Boston, Massachusetts
[doi> 10.1145/1060289.1060317]
|
| |
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
|
Petros Maniatis , TJ Giuli , Mema Roussopoulos , David S. H. Rosenthal , Mary Baker, Impeding attrition attacks in P2P systems, Proceedings of the 11th workshop on ACM SIGOPS European workshop, September 19-22, 2004, Leuven, Belgium
[doi> 10.1145/1133572.1133601]
|
| |
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
|
Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States
|
| |
15
|
D. Wallach. A Survey of Peer-to-Peer Security Issues. In Proc. of the ACM International Symposium on Software Security (ISSS), June 2002.
|
|