Download Now Free registration required
The authors examine peer-to-peer anonymous communication systems that use Distributed Hash Table algorithms for relay selection. They show that common design flaws in these schemes lead to highly effective attacks against the anonymity provided by the schemes. These attacks stem from attacks on DHT routing, and are not mitigated by the well-known DHT security mechanisms due to a fundamental mismatch between the security requirements of DHT routing's put-get functionality and anonymous routing's relay selection functionality.
- Format: PDF
- Size: 708.3 KB