Causal Mutual Byzantine Broadcast
Résumé
Recently, a new communication abstraction called Mutual Broadcast has been proposed for message-passing distributed systems where some processes may fail by crashing. It is a one-to-all broadcast abstraction providing an ordering property that allows it to be computationally equivalent to atomic registers. This paper proposes an adaptation of this abstraction, Causal Mutual Byzantine Broadcast (in short CMB-Broadcast) for message-passing systems where some processes may experience Byzantine faults. Byzantine faults are a more severe failure model compared to crash failures. A Byzantine process can behave arbitrarily. After defining this new communication abstraction, we show how it can be used to emulate atomic registers and also how it can be implemented using quorums and the famous Byzantine reliable broadcast abstraction of Bracha. We also prove a necessary condition on the size of the quorums.
Origine | Fichiers produits par l'(les) auteur(s) |
---|