SurePath: An Approach to Resilient Anonymous Routing
Yingwu Zhu, Yiming Hu · 2008
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile and shortlived — that is, a path fails if one of the mixes/nodes fails or leaves the system. In this paper, we propose SurePath, a failure-resilient tunneling approach for anonymity built on dis-tributed hash tables (DHTs). SurePath aims to make anonymous tunnels fault-tolerant to node failures. The basic idea behind SurePath is to decouple anonymous tunnels from “fixed ” nodes and form anonymous tunnels from dynamic mix nodes by relying on DHT routing infrastruc-ture and data replication mechanism. We have implemented SurePath in Java on FreePastry 1.3. We also provide analysis of anonymity and performance evaluation for SurePath.