Making Speculative BFT Resilient with Trusted Monotonic Counters

05/24/2019
by   Lachlan J. Gunn, et al.
0

Consensus mechanisms used by popular distributed ledgers are highly scalable but notoriously inefficient. Byzantine fault tolerance (BFT) protocols are efficient but far less scalable. Speculative BFT protocols such as Zyzzyva and Zyzzyva5 are efficient and scalable but require a trade-off: Zyzzyva requires only 3f + 1 replicas to tolerate f faults, but even a single slow replica will make Zyzzyva fall back to more expensive non-speculative operation. Zyzzyva5 does not require a non-speculative fallback, but requires 5f + 1 replicas in order to tolerate f faults. BFT variants using hardware-assisted trusted components can tolerate a greater proportion of faults, but require that every replica have this hardware. We present SACZyzzyva, addressing these concerns: resilience to slow replicas and requiring only 3f + 1 replicas, with only one replica needing an active monotonic counter at any given time. We experimentally evaluate our protocols, demonstrating low latency and high scalability. We prove that SACZyzzyva is optimally robust and that trusted components cannot increase fault tolerance unless they are present in greater than two-thirds of replicas.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2023

Raft-Forensics: High Performance CFT Consensus with Accountability for Byzantine Faults

Crash fault tolerant (CFT) consensus algorithms are commonly used in sce...
research
09/29/2021

Fast B4B: Fast BFT for Blockchains

Low latency is one of the desired properties for partially synchronous B...
research
04/19/2022

Basilic: Resilient Optimal Consensus Protocols With Benign and Deceitful Faults

The problem of Byzantine consensus has been key to designing secure dist...
research
02/03/2021

TBFT: Understandable and Efficient Byzantine Fault Tolerance using Trusted Execution Environment

While the requirements for reliability increasing rapidly in distributed...
research
10/18/2020

Fault Tolerance for Remote Memory Access Programming Models

Remote Memory Access (RMA) is an emerging mechanism for programming high...
research
05/21/2021

Classifying Trusted Hardware via Unidirectional Communication

It is well known that Byzantine fault tolerant (BFT) consensus cannot be...
research
02/03/2022

Dissecting BFT Consensus: In Trusted Components we Trust!

The growing interest in reliable multi-party applications has fostered w...

Please sign up or login with your details

Forgot password? Click here to reset