The Byzantine generals problem

DOI10.1145/3335772.3335936zbMath1448.68139OpenAlexW2120510885MaRDI QIDQ5133676

Leslie Lamport, M. C. III Pease, Robert E. Shostak

Publication date: 10 November 2020

Published in: Concurrency: the Works of Leslie Lamport (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsreliabilityinteractive consistency

Mathematics Subject Classification ID

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

Related Items (8)

Improving the implementation of quantum blockchain based on hypergraphs ⋮ Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents ⋮ Multidimensional Byzantine agreement in a synchronous setting ⋮ Divide \& Scale: formalization and roadmap to robust sharding ⋮ On the Validity of Consensus ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Secure reliable multicast protocols in a WAN ⋮ Communication-Efficient Distributed Eigenspace Estimation

This page was built for publication: The Byzantine generals problem