{'fraction_non_alphanumeric': 0.0136986301369863, 'fraction_numerical': 0.0, 'mean_word_length': 5.585585585585585, '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}}
Byzantine Fault Tolerant Authentication

A Byzantine fault tolerant public key infrastructure is presented. It aims to fulfill the authentication requirements of large distributed systems consisting of semi-trusted parties. The distributed trust model does not demand the existence of predefined trusted parties and provides authentication if more than a threshold of the participants are honest. A voting based protocol implements distributed trust and supports dynamic membership without fail safe multi-cast or synchrony. This paper describes the system design and discusses its applicability to mobile networks and peer-to-peer systems on the Internet. It also demonstrates the Byzantine fault tolerance of distributed authen-