Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case - Irisa Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case

Résumé

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct, and an essential property for practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained under a Byzantine majority. In this work, we answer this open question positively and propose a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of max(2, t + 3 − c) rounds, where t is the upper bound on the number of Byzantine processes, and c the number of effectively correct processes.
Fichier principal
Vignette du fichier
main.pdf (734.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03791921 , version 1 (29-09-2022)

Identifiants

Citer

Timothé Albouy, Davide Frey, Michel Raynal, François Taïani. Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case. DISC 2022 - 36th International Symposium on Distributed Computing, Oct 2022, Augusta, GA, United States. ⟨10.4230/LIPIcs.DISC.2022.4⟩. ⟨hal-03791921⟩
89 Consultations
50 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More