Optimistically tuning synchronous Byzantine consensus: another win for null messages

DOI10.1007/S00446-021-00393-8MaRDI QIDQ2241306OpenAlexFDO

Authors Guy Goren, Yoram Moses

Publication date 8 November 2021

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-021-00393-8

zbMATH Keywords

fault-tolerancesynchronous systemsByzantine consensusnull messagessilent validation round

Mathematics Subject Classification ID

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

Recommendations

• Brief Announcement: On Using Null Messages in a Byzantine Setting
• Message-optimal protocols for Byzantine Agreement
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Asynchronous Byzantine agreement with optimal resilience
• Byzantine lattice agreement in synchronous message passing systems
• scientific article; zbMATH DE number 4121395
• Synchronous consensus with optimal asynchronous fallback guarantees
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Using asynchrony and zero degradation to speed up indulgent consensus protocols

Cites work

• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Authenticated Algorithms for Byzantine Agreement
• Beyond Lamport's Happened-before
• Bounds on information exchange for Byzantine agreement
• Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
• Consensus and collision detectors in radio networks
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Distributed consensus revisited
• Early stopping in Byzantine agreement
• Fast Paxos
• How processes learn
• Knowledge and common knowledge in a distributed environment
• Message-optimal protocols for Byzantine Agreement
• Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
• On the message complexity of binary Byzantine agreement under crash failures
• Reaching Agreement in the Presence of Faults
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Silence
• The Byzantine Generals Problem
• The Failure Discovery problem
• Time, clocks, and the ordering of events in a distributed system

Cited in

(2)

• Making Byzantine consensus live
• Making Byzantine consensus live

This page was built for publication: Optimistically tuning synchronous Byzantine consensus: another win for null messages

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