Download Now Free registration required
Deployed anonymous networks such as Tor focus on delivering messages through end-to-end paths with high anonymity. Selection of routers in the anonymous path construction is either performed randomly, or relies on self-described resource availability from each router, which makes the system vulnerable to low-resource attacks. In this paper, the authors investigate an alternative router and path selection mechanism for constructing efficient end-to-end paths with low loss of path anonymity. They propose a novel construct called a "Route mesh," and a dynamic programming algorithm that determines optimal-latency paths from many random samples using only a small number of end-to-end measurements.
- Format: PDF
- Size: 297.7 KB