Optimistically tuning synchronous Byzantine consensus: another win for null messages
From MaRDI portal
Publication:2241306
DOI10.1007/S00446-021-00393-8OpenAlexW3172044144MaRDI QIDQ2241306FDOQ2241306
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
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
- Title not available (Why is that?)
- Time, clocks, and the ordering of events in a distributed system
- Authenticated Algorithms for Byzantine Agreement
- Early stopping in Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Knowledge and common knowledge in a distributed environment
- Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
- A lower bound for the time to assure interactive consistency
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- How processes learn
- Fast Paxos
- Bounds on information exchange for Byzantine agreement
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Consensus and collision detectors in radio networks
- Message-optimal protocols for Byzantine Agreement
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- The Failure Discovery problem
- Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
- On the message complexity of binary Byzantine agreement under crash failures
- Distributed consensus revisited
- Silence
- Beyond Lamport's Happened-before
Cited In (1)
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)
