|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 International Conference on Computational Intelligence and Security
Providing Efficient Secure DHTs Routing
Beijing, China
December 11-December 14
ISBN: 978-0-7695-3931-7
| ASCII Text | x | ||
| Xu Xiang, "Providing Efficient Secure DHTs Routing," 2012 Eighth International Conference on Computational Intelligence and Security, vol. 2, pp. 510-514, 2009 International Conference on Computational Intelligence and Security, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/CIS.2009.128, author = {Xu Xiang}, title = {Providing Efficient Secure DHTs Routing}, journal ={2012 Eighth International Conference on Computational Intelligence and Security}, volume = {2}, year = {2009}, isbn = {978-0-7695-3931-7}, pages = {510-514}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIS.2009.128}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 Eighth International Conference on Computational Intelligence and Security TI - Providing Efficient Secure DHTs Routing SN - 978-0-7695-3931-7 SP510 EP514 A1 - Xu Xiang, PY - 2009 KW - DHTs KW - Secure KW - Sybil attack KW - Routing VL - 2 JA - 2012 Eighth International Conference on Computational Intelligence and Security ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIS.2009.128
It is quite difficult to provide a secure routing path in DHTs, since nodes in the routing path do not always behave according to pre-established routing protocols. To address this issue, we propose a secure protocol which consists of two phases: detecting malicious nodes and bypassing them. We present a novel efficient routing strategy called tracer routing to control routing progress, accompanied by a node-ID based signature scheme. Combine these two, the source of every query can verify each step and malicious nodes can be identified. We also present a scheme to create a secure path to bypass malicious nodes. With high probability, each query successfully reach the destination even if there is a large number of malicious nodes in the system. Simulation results show the superiority of our protocol in comparison with previous protocols.
Index Terms:
DHTs, Secure, Sybil attack, Routing
Citation:
Xu Xiang, "Providing Efficient Secure DHTs Routing," cis, vol. 2, pp.510-514, 2009 International Conference on Computational Intelligence and Security, 2009
Usage of this product signifies your acceptance of the Terms of Use.