A Kademlia-Based Node Lookup System for Anonymization Networks

Authors:
Benedikt Westermann;Andriy Panchenko;Lexi Pimenidis
Affiliations:
Center for Quantifiable Quality of Service in Communication Systems, NTNU, Trondheim, Norway 7491;Computer Science Department, Informatik IV, RWTH Aachen University, Aachen, Germany D-52074;Chair for IT Security, University of Siegen, Siegen, Germany
Venue:
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Year:
2009

Citing 13
Cited 0

Randomized algorithms

Randomized algorithms
Tarzan: a peer-to-peer anonymizing network layer

Proceedings of the 9th ACM conference on Computer and communications security
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection

Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Route Fingerprinting in Anonymous Communications

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Salsa: a structured approach to large-scale anonymity

Proceedings of the 13th ACM conference on Computer and communications security
Tor: the second-generation onion router

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Bridging and Fingerprinting: Epistemic Attacks on Route Selection

PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Information leaks in structured peer-to-peer anonymous communication systems

Proceedings of the 15th ACM conference on Computer and communications security
Local view attack on anonymous communication

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Breaking the collusion detection mechanism of morphmix

PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 we revisit the concept of distributed hash tables to address these issues. We propose a scalable node lookup system based on Kademlia and show how it notably hardens the eclipse attack and node fingerprinting. Additionally we provide comparative scalability analyses for our approach and Tor's directory protocol.