On the Round Complexity of Randomized Byzantine Agreement
IACR Cryptology ePrint Archive, pp. 8682019.
EI
Abstract:
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In particular, we prove that: (1) BA protocols resilient against $n/3$ [resp., $n/4$] corruptions terminate (under attack) at the end of the first round with proba...More
Code:
Data:
Full Text
Tags
Comments