loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'07)
S/Kademlia: A practicable approach towards secure key-based routing
Hsinchu, Taiwan
December 05-December 07
ISBN: 978-1-4244-1889-3
ASCII Text
x 
 
Ingmar Baumgart, Sebastian Mies, "S/Kademlia: A practicable approach towards secure key-based routing," Parallel and Distributed Systems, International Conference on, vol. 2, pp. 1-8, 13th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICPADS.2007.4447808,
author = {Ingmar Baumgart and Sebastian Mies},
title = {S/Kademlia: A practicable approach towards secure key-based routing},
journal ={Parallel and Distributed Systems, International Conference on},
volume = {2},
year = {2007},
isbn = {978-1-4244-1889-3},
pages = {1-8},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2007.4447808},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Systems, International Conference on
TI - S/Kademlia: A practicable approach towards secure key-based routing
SN - 978-1-4244-1889-3
SP1
EP8
A1 - Ingmar Baumgart,
A1 - Sebastian Mies,
PY - 2007
KW - null
VL - 2
JA - Parallel and Distributed Systems, International Conference on
ER -
 
Ingmar Baumgart, Institute of Telematics Universit?t Karlsruhe (TH) D-76128, Germany
Sebastian Mies, Institute of Telematics Universit?t Karlsruhe (TH) D-76128, Germany
Security is a common problem in completely decentralized peer-to-peer systems. Although several suggestions exist on how to create a secure key-based routing protocol, a practicable approach is still unattended. In this paper we introduce a secure key-based routing protocol based on Kademlia that has a high resilience against common attacks by using parallel lookups over multiple disjoint paths, limiting free nodeId generation with crypto puzzles and introducing a reliable sibling broadcast. The latter is needed to store data in a safe replicated way. We evaluate the security of our proposed extensions to the Kademlia protocol analytically and simulate the effects of multiple disjoint paths on lookup success under the influence of adversarial nodes.
Citation:
Ingmar Baumgart, Sebastian Mies, "S/Kademlia: A practicable approach towards secure key-based routing," icpads, vol. 2, pp.1-8, 13th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.