Causal Mutual Byzantine Broadcast - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Working Paper) Année : 2024

Causal Mutual Byzantine Broadcast

Mathieu Féry
  • Fonction : Auteur
  • PersonId : 1285464
Vincent Kowalski
  • Fonction : Auteur
  • PersonId : 1393784
Florian Monsion
  • Fonction : Auteur
  • PersonId : 1285465
Achour Mostefaoui
Samuel Pénault
  • Fonction : Auteur
  • PersonId : 1285466
Matthieu Perrin
Guillaume Poignant
  • Fonction : Auteur
  • PersonId : 1285467

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.
Fichier principal
Vignette du fichier
CMB_Broadcast-1.pdf (432.95 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04617873 , version 1 (19-06-2024)

Identifiants

  • HAL Id : hal-04617873 , version 1

Citer

Mathieu Féry, Vincent Kowalski, Florian Monsion, Achour Mostefaoui, Samuel Pénault, et al.. Causal Mutual Byzantine Broadcast. 2024. ⟨hal-04617873⟩
0 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More