Consensus in Synchronous Systems Prone to Byzantine Process Failures

  • Michel Raynal


This chapter addresses the interactive consistency and consensus agreement abstractions in the system model BSMPn,t\([\emptyset]\), i.e., in synchronous systems where up to t processes can be Byzantine. Let us remember that a Byzantine process is a process that behaves in an arbitrary way.


Binary consensus Byzantine process Common coin Consensus Constant message size Fair message scheduling Impossibility Interactive consistency Local coin Message authentication Message-passing Multivalued consensus Random number Reduction algorithm Signature-based algorithm Synchronous system 


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