An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

DOI10.1145/248052.248091MaRDI QIDQ2942733zbMATH OpenOpenAlexFDO

Authors Arkady Zamsky

Publication date 11 September 2015

Published in Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cited in

(4)

• Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
• Randomized protocols for asynchronous consensus
• Randomization and failure detection: a hybrid approach to solve consensus
• Early stopping Byzantine agreement in (1+ ) f rounds

This page was built for publication: An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942733)