Making Reads in BFT State Machine Replication Fast, Linearizable, and
Live

Making Reads in BFT State Machine Replication Fast, Linearizable, and Live

23 July 2021

Hans P. Reiser

Papers citing "Making Reads in BFT State Machine Replication Fast, Linearizable, and Live"

9 / 9 papers shown

Title
Linearizability and State-Machine Replication: Is it a match? F. Hauck Alexander Heß 29 0 0 01 Jul 2024
Vivisecting the Dissection: On the Role of Trusted Components in BFT Protocols A. Bessani Miguel Correia Tobias Distler Rüdiger Kapitza Paulo Esteves-Verissimo Jiangshan Yu 13 5 0 10 Dec 2023
Liveness Checking of the HotStuff Protocol Family Jérémie Decouchant B. Ozkan Yanzhuo Zhou 11 1 0 13 Oct 2023
Scalable Performance Evaluation of Byzantine Fault-Tolerant Systems Using Network Simulation Christian Berger Adrian Groza Hans P. Reiser 16 3 0 29 Sep 2023
TransEdge: Supporting Efficient Read Queries Across Untrusted Edge Nodes Abhishek A. Singh Aasim Khan S. Mehrotra Faisal Nawab 20 2 0 16 Feb 2023
Simulating BFT Protocol Implementations at Scale Christian Berger Sadok Ben Toumia Hans P. Reiser 11 0 0 31 Aug 2022
Automatic Integration of BFT State-Machine Replication into IoT Systems Christian Berger Hans P. Reiser F. Hauck Florian Held Jörg Domaschka 22 3 0 01 Jul 2022
SplitBFT: Improving Byzantine Fault Tolerance Safety Using Trusted Compartments I. Messadi M. Becker Kai Bleeke Leander Jehl Sonia Ben Mokhtar R. Kapitza 24 8 0 18 May 2022
Liveness and Latency of Byzantine State-Machine Replication (Extended Version) Manuel Bravo G. Chockler Alexey Gotsman 11 13 0 14 Feb 2022