Consensus in Synchronous Systems Prone to Byzantine Process Failures
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.
KeywordsBinary 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.