{'fraction_non_alphanumeric': 0.018912529550827423, 'fraction_numerical': 0.0, 'mean_word_length': 5.235294117647059, '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}}
Practical improvements to bus-based strategies for reliable anonymous networking

We design a class of anonymous networking strategies generalizing the “buses” strategy of Biemel and Dolev. Our strategies provide a better tradeoff between resource usage and reliability, as well as allow a tradeoff with the level of anonymity. The idea behind these strategies is to send coded or uncoded redundancy, or use multiple buses.