{'fraction_non_alphanumeric': 0.026436781609195402, 'fraction_numerical': 0.0022988505747126436, 'mean_word_length': 4.885135135135135, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
SurePath: An Approach to Resilient Anonymous Routing

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 distributed 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 infrastructure 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.