Signature-Free Asynchronous Byzantine Consensus with $ - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Signature-Free Asynchronous Byzantine Consensus with $

Résumé

where n is the total number of processes. In addition of being signature-free and optimal with respect to the value of t, this algorithm has several noteworthy properties: the expected number of rounds to decide is four, each round is composed of two or three communication steps and involves O(n2) messages, and a message is composed of a round number plus a single bit. To attain this goal, the consensus algorithm relies on a common coin as defined by Rabin, and a new extremely simple and powerful broadcast abstraction suited to binary values. The main target when designing this algorithm was to obtain a cheap and simple algorithm. This was motivated by the fact that, among the first-class properties, simplicity -albeit sometimes under-estimated or even ignored- is a major one.
Cet article présente un algorithme de consensus binaire en présence de processus Byzantins. Cet algorithme satisfait plusieurs propriétés d'optimalité.
Fichier principal
Vignette du fichier
RR-2016-Consensus-optimal-V4.pdf (153.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00944019 , version 1 (10-02-2014)
hal-00944019 , version 2 (11-02-2014)

Identifiants

  • HAL Id : hal-00944019 , version 1

Citer

Achour Mostefaoui, Moumen Hamouna, Michel Raynal. Signature-Free Asynchronous Byzantine Consensus with $. 2014. ⟨hal-00944019v1⟩

Collections

LINA-GDD
1417 Consultations
5202 Téléchargements

Partager

Gmail Facebook X LinkedIn More