Byzantine Agreement Decomposed: Honest Majority Asynchronous Total-Order Broadcast from Reliable Broadcast

ePrint Report: Byzantine Agreement Decomposed: Honest Majority Asynchronous Total-Order Broadcast from Reliable Broadcast

Simon Holmgaard Kamp, Jesper Buus Nielsen

It is well-known that Asynchronous Total Order Broadcast (ATOB) requires randomisation and that at most $t < n/3$ out of $n$ players are corrupted.
This is opposed to synchronous total-order broadcast (STOB) which can tolerate $t < n/2$ corruptions and can be deterministic.
We show that these requirements can be conceptually separated, by constructing an ATOB protocol which tolerates $t < …

asynchronous broadcast eprint report order players report well-known