Download Now Free registration required
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, which leads to scalability problems in the long run. Additionally they require the user to trust the directory provider. In this paper, the authors revisit the concept of distributed hash tables to address these issues. They propose a scalable node lookup system based on Kademlia and show how it notably hardens the eclipse attack and node fingerprinting. Additionally they provide comparative scalability analyzes for their approach and Tor's directory protocol.
- Format: PDF
- Size: 139.2 KB