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

From Navigators

Revision as of 16:08, 29 September 2021 by Bessani (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Christian Berger, Hans P. Reiser, Alysson Bessani

in Proceedings of the 40th International Symposium on Reliable Distributed Systems (SRDS'21), Sept. 2021.

Prof. C.V. Ramamoorthy Best Paper Award
Abstract: Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. A reason for such high performance is the set of optimizations introduced in the protocol. One of these optimizations is read-only requests, a particular type of client request which avoids running the three-step agreement protocol and allows replicas to respond directly, thus reducing the latency of reads from five to two communication steps. Given PBFT's broad influence, its design and optimizations influenced many BFT protocols and systems that followed, e.g., BFT-SMaRt. We show, for the first time, that the read-only request optimization introduced in PBFT more than 20 years ago can violate its liveness. Notably, the problem affects not only the optimized read-only operations but also standard, totally-ordered operations. We show this weakness by presenting an attack in which a malicious leader blocks correct clients and present two solutions for patching the protocol, making read-only operations fast and correct. The two solutions were implemented on BFT-SMaRt and evaluated in different scenarios, showing their effectiveness in preventing the identified attack.

Download paper

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

Export citation


Project(s): Project:ThreatAdapt

Research line(s): Fault and Intrusion Tolerance in Open Distributed Systems (FIT)

Personal tools
Navigators toolbox