The Weak Byzantine Generals Problem

DOI10.1145/2402.322398MaRDI QIDQ3763581zbMATH OpenOpenAlexWikidataFDO

Authors Leslie Lamport

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

agreementdistributed systemsinteractive consistency

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• The Byzantine generals problem
• The Byzantine generals problem in generic and wireless networks
• A new solution for the Byzantine generals problem
• Lower bounds for weak Byzantine agreement
• scientific article; zbMATH DE number 1113955
• A simple Byzantine generals protocol
• The Do-All problem with Byzantine processor failures
• A new solution for the Byzantine agreement problem
• Two distributed problems involving Byzantine processes

Cited in

(22)

• Wait-free implementations in message-passing systems
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Strong Separations Between Broadcast and Authenticated Channels
• The Do-All problem with Byzantine processor failures
• Hundreds of impossibility results for distributed computing
• Characterization of secure multiparty computation without broadcast
• On Byzantine generals with alternative plans
• Characterization of secure multiparty computation without broadcast
• Agreement under faulty interfaces
• On using temporal logic for refinement and compositional verification of concurrent systems
• A process algebra of communicating shared resources with dense time and priorities
• Easy impossibility proofs for distributed consensus problems
• Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents
• Performance study of Byzantine agreement protocol with artificial neural network
• The Failure Discovery problem
• Lower bounds for weak Byzantine agreement
• Towards permissionless consensus in the standard model via fine-grained complexity
• Communication complexity of Byzantine agreement, revisited
• Money transfer made simple: a specification, a generic algorithm, and its proof
• Interval logics and their decision procedures. I: An interval logic
• Time is not a healer (preliminary version)
• Metric temporal logic with durations

This page was built for publication: The Weak Byzantine Generals Problem

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