Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time

DOI10.1145/3382734.3404503OpenAlexW3046584095MaRDI QIDQ5855221

Ashish Choudhury

Publication date: 15 March 2021

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience

This page was built for publication: Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time