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