Implementing Consensus in Enriched Byzantine Asynchronous Systems

  • Michel Raynal


This chapter is on the implementation of the consensus abstraction in the Byzantine system model BAMPn,t\([\emptyset]\) enriched with appropriate additional assumptions. All the algorithms it presents assume that the network is not controlled by the adversary, and are optimal with respect to the model resilience parameter t (namely, t < n/3).


Asynchronous algorithm Binary consensus Byzantine process Common coin Consensus abstraction Fair message scheduling Local coin Multivalued consensus Random number Reduction algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Michel Raynal
    • 1
  1. 1.IRISA-ISTIC Université de Rennes 1Institut Universitaire de FranceRennesFrance

Personalised recommendations