A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary

Résumé

This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous n-process message-passing system in which up to t processes are Byzantine and where, at the network level, for each message broadcast by a correct process, an adversary can prevent up to d processes from receiving it (the integer d defines the power of the message adversary). So, unlike previous works, this work considers that not only can computing entities be faulty (Byzantine processes), but, in addition, that the network can also lose messages. To this end, the paper adopts a modular strategy and first introduces a new basic communication abstraction denoted k2-cast, which simplifies quorum engineering, and studies its properties in this new adversarial context. Then, the paper deconstructs existing signature-free Byzantine-tolerant asynchronous broadcast algorithms and, with the help of the k2-cast communication abstraction, reconstructs versions of them that tolerate both Byzantine processes and message adversaries. Interestingly, these reconstructed algorithms are also more efficient than the Byzantine-tolerant-only algorithms from which they originate.
Fichier principal
Vignette du fichier
main.pdf (620.81 Ko) Télécharger le fichier
main (1).pdf (620.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03906141 , version 1 (19-12-2022)

Licence

Paternité

Identifiants

  • HAL Id : hal-03906141 , version 1

Citer

Timothé Albouy, Davide Frey, Michel Raynal, François Taïani. A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary. OPODIS 2022 - 26th Conference on Principles of Distributed Systems, Dec 2022, Brussels, Belgium. pp.1-44. ⟨hal-03906141⟩
56 Consultations
53 Téléchargements

Partager

Gmail Facebook X LinkedIn More