On the Round Complexity of Randomized Byzantine Agreement

Matan Orland
Matan Orland
Alex Samorodnitsky
Alex Samorodnitsky

DISC, 2019.

Cited by: 0|Bibtex|Views24|Links
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:

Your rating :
0

 

Tags
Comments