Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience

Ittai Abraham; Srinivas Devadas; Danny Dolev; Kartik Nayak; Ling Ren

Conference Proceedings

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11598 LNCS 320-334

DOI: 10.1007/978-3-030-32101-7_20

35Citations

38Readers

Get full text

Abstract

We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among parties. Our protocols achieve an expected O(1) round complexity and an expected 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.

Cite

CITATION STYLE

APA

Abraham, I., Devadas, S., Dolev, D., Nayak, K., & Ren, L. (2019). Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11598 LNCS, pp. 320–334). Springer. https://doi.org/10.1007/978-3-030-32101-7_20

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience

Abstract

Cite

Register to see more suggestions