Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience
Publication
, Conference
Abraham, I; Devadas, S; Dolev, D; Nayak, K; Ren, L
Published in: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
January 1, 2019
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.
Duke Scholars
Published In
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 2019
Volume
11598 LNCS
Start / End Page
320 / 334
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
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). https://doi.org/10.1007/978-3-030-32101-7_20
Abraham, I., S. Devadas, D. Dolev, K. Nayak, and L. Ren. “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, 11598 LNCS:320–34, 2019. https://doi.org/10.1007/978-3-030-32101-7_20.
Abraham I, Devadas S, Dolev D, Nayak K, Ren L. 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. 2019. p. 320–34.
Abraham, I., et al. “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, vol. 11598 LNCS, 2019, pp. 320–34. Scopus, doi:10.1007/978-3-030-32101-7_20.
Abraham I, Devadas S, Dolev D, Nayak K, Ren L. 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. p. 320–334.
Published In
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 2019
Volume
11598 LNCS
Start / End Page
320 / 334
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences