Combining Asynchronous and Synchronous Byzantine Agreement:Synchronous Byzantine Agreement • December 26th, 2023
For the remainder of the following sections, let us call a message (i, v, L) correctly formed, if it L contains at least 3n valid signatures on v from distinct parties.
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal ResilienceSynchronous Byzantine Agreement • January 6th, 2019
Abstract. We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among n = 2f +1 parties. Our protocols achieve an expected O(1) round complexity and an expected O(n2) communication complexity. The exact round complexity in expectation is 10 for a static adversary and 16 for a strongly rushing adaptive adversary. For comparison, previous protocols in the same setting require expected 29 rounds and expected Ω(n3) communication.
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal ResilienceSynchronous Byzantine Agreement • March 1st, 2019
Abstract. We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among n = 2f + 1 parties. Our protocols achieve an expected O(1) round complexity and an expected O(n2) communication complexity. The exact round complexity in expectation is 10 for a static adversary and 16 for a strongly rushing adaptive adversary. For comparison, previous protocols in the same setting require expected 29 rounds.
