Communication Complexity. Our protocol incurs a communication com- plexity of O(n4(κ + r log(r))) bits, where κ is the size of a signature and r is the number of rounds. Using threshold signatures for the (conditional) graded broadcast primitive, we can save a linear factor n. It remains open to explore solutions with improved communication.
Appears in 2 contracts
Sources: Byzantine Agreement, Byzantine Agreement