Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model

4 January 2022

Papers citing "Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model"

10 / 10 papers shown

Title
Fast Leaderless Byzantine Total Order Broadcast M. Monti Martina Camaioni Pierre-Louis Roman 82 0 0 18 Dec 2024
Lumiere: Making Optimal BFT for Partial Synchrony Practical Andrew Lewis-Pye Dahlia Malkhi O. Naor Kartik Nayak 12 3 0 14 Nov 2023
All Byzantine Agreement Problems are Expensive P. Civit Seth Gilbert R. Guerraoui J. Komatovic Anton Paramonov M. Vidigueira 14 7 0 14 Nov 2023
BBCA-CHAIN: Low Latency, High Throughput BFT Consensus on a DAG Dahlia Malkhi C. Stathakopoulou Maofan Yin 20 5 0 10 Oct 2023
Strong Byzantine Agreement with Adaptive Word Complexity P. Civit Seth Gilbert R. Guerraoui J. Komatovic M. Vidigueira AAML 26 2 0 07 Aug 2023
Every Bit Counts in Consensus P. Civit Seth Gilbert R. Guerraoui J. Komatovic Matteo Monti M. Vidigueira 23 7 0 01 Jun 2023
Lessons from HotStuff Dahlia Malkhi Maofan Yin 30 1 0 22 May 2023
Fever: Optimal Responsive View Synchronisation Andrew Lewis-Pye Ittai Abraham 11 4 0 24 Jan 2023
On the Validity of Consensus P. Civit Seth Gilbert R. Guerraoui J. Komatovic M. Vidigueira 17 10 0 12 Jan 2023
SBFT: a Scalable and Decentralized Trust Infrastructure Guy Golan Gueta Ittai Abraham Shelly Grossman Dahlia Malkhi Benny Pinkas Michael K. Reiter Dragos-Adrian Seredinschi Orr Tamir Alin Tomescu 68 370 0 04 Apr 2018