[{"type":"paper-conference","title":"S\/Kademlia: A Practicable Approach Towards Secure Key-Based Routing","issued":{"date-parts":[["2007"]]},"page":"Article no 4447808","container-title":"Proceedings of the 13th International Conference on Parallel and Distributed Systems (ICPADS \u201907), Hsinchu, CHN, December 5-7, 2007. Vol. 2","DOI":"10.1109\/ICPADS.2007.4447808","author":[{"family":"Baumgart","given":"Ingmar"},{"family":"Mies","given":"Sebastian"}],"publisher":"IEEE","publisher-place":"Piscataway, NJ","ISBN":"978-1-4244-1890-9","ISSN":"15219097","abstract":"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.","kit-publication-id":"1000087134"}]