Asymptotically Optimal Validated Asynchronous Byzantine Agreement

DOI10.1145/3293611.3331612OpenAlexW2963873436MaRDI QIDQ5145231

Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3293611.3331612

zbMATH Keywords

asynchronousByzantine agreementoptimal protocolvalidated

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback ⋮ Quick order fairness ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Expected linear round synchronization: the missing link for linear Byzantine SMR ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ On the Validity of Consensus ⋮ Aggregatable distributed key generation

This page was built for publication: Asymptotically Optimal Validated Asynchronous Byzantine Agreement