An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience

From MaRDI portal
Publication:2934364

DOI10.1145/1400751.1400804zbMath1301.68047OpenAlexW2039727452MaRDI QIDQ2934364

Joseph Y. Halpern, Danny Dolev, Ittai Abraham

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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




Related Items (12)







This page was built for publication: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience