AbstractA 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 authentication.
RightsThis Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).