Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited

ePrint Report: Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited

Ran Cohen, Pouyan Forghani, Juan Garay, Rutvik Patel, Vassilis Zikas

It is well known that without randomization, Byzantine agreement (BA) requires a linear number of rounds in the synchronous setting, while it is flat out impossible in the asynchronous setting. The primitive which allows to bypass the above limitation is known as oblivious common coin (OCC). It allows parties to agree with constant probability on a random coin, where agreement …

asynchronous eprint report linear randomization report