Message-optimal protocols for Byzantine Agreement

DOI10.1007/BF01187074MaRDI QIDQ4031321zbMATH OpenOpenAlexFDO

Authors Vassos Hadzilacos, Joseph Y. Halpern

Publication date 1 April 1993

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01187074

zbMATH Keywords

Byzantine agreementdistributed systemfailure-freeomission failuresprotocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the message complexity of binary Byzantine agreement under crash failures
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Bounds on information exchange for Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• Optimally efficient multi-valued byzantine agreement

Cites work

• A lower bound for the time to assure interactive consistency
• Are wait-free algorithms fast?
• Authenticated Algorithms for Byzantine Agreement
• Automatically increasing the fault-tolerance of distributed algorithms
• Bounds on information exchange for Byzantine agreement
• Early stopping in Byzantine agreement
• scientific article; zbMATH DE number 3819094 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 4121395 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Knowledge and common knowledge in a distributed environment
• On the message complexity of binary Byzantine agreement under crash failures
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Failure Discovery problem

Cited in

(29)

• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• On the message complexity of binary Byzantine agreement under crash failures
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
• Round-optimal Byzantine agreement
• Optimistically tuning synchronous Byzantine consensus: another win for null messages
• Optimal decision strategies in Byzantine environments
• Optimal extension protocols for Byzantine broadcast and agreement
• Message Lower Bounds via Efficient Network Synchronization
• Agreement under faulty interfaces
• Authenticated Algorithms for Byzantine Agreement
• Early stopping in Byzantine agreement
• Bounds on information exchange for Byzantine agreement
• scientific article; zbMATH DE number 4085017 (Why is no real title available?)
• The Failure Discovery problem
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Hundreds of impossibility results for distributed computing
• Using counterfactuals in knowledge-based programming
• Optimally efficient multi-valued byzantine agreement
• Structural Information and Communication Complexity
• Brief Announcement: Improved Consensus in Quantum Networks
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Scalable and secure computation among strangers: message-competitive Byzantine protocols
• Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency
• Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
• Sublinear message bounds of authenticated implicit Byzantine agreement
• Distributed fast crash-tolerant consensus with nearly-linear quantum communication
• Consensus algorithms with one-bit messages
• Robust gossiping with an application to consensus
• Knowledge and common knowledge in a Byzantine environment: Crash failures

This page was built for publication: Message-optimal protocols for Byzantine Agreement

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