TY - GEN
T1 - Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience
AU - Abraham, Ittai
AU - Devadas, Srinivas
AU - Dolev, Danny
AU - Nayak, Kartik
AU - Ren, Ling
N1 - This work was supported by the Deutsche Forschungsgemeinschaft by a grant to E.B. and W.P. Contribution by the Fond der Chemischen Industrie is acknowledged as well. The authors are very grateful to Prof. H. Kende, Plant Research Laboratory, Michigan State University, Mich., USA, and Prof. M.-B. Schröder, Dept. of Botany, State Research Institute Geisenheim, Germany, for assisting W.P. with the measurements of ethylene, and with the determination of the DNA content of the cells by flow cytometry, respectively. They also thank Prof. E. Weiler, Dept. of Plant Physiology, University of Bochum, Germany, for providing the monoclonal antibodies for the quantification of auxin. Finally, the excellent technical assistance by Angelika Fischbach, Tina Leistner and Christiane Meinen is gratefully acknowledged.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85075582597
UR - https://www.scopus.com/pages/publications/85075582597#tab=citedBy
U2 - 10.1007/978-3-030-32101-7_20
DO - 10.1007/978-3-030-32101-7_20
M3 - Conference contribution
AN - SCOPUS:85075582597
SN - 9783030321000
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 320
EP - 334
BT - Financial Cryptography and Data Security - 23rd International Conference, FC 2019, Revised Selected Papers
A2 - Goldberg, Ian
A2 - Moore, Tyler
PB - Springer
T2 - 23rd International Conference on Financial Cryptography and Data Security, FC 2019
Y2 - 18 February 2019 through 22 February 2019
ER -