Corpus ID: 7186494

Adaptive BFT protocols

  title={Adaptive BFT protocols},
  author={F. Sabino},
Byzantine fault-tolerant (BFT) protocols have been proposed mostly as a means to support the execution of highly-resilient services, i.e., of services that keep their availability, integrity, and confidentiality even if there are accidental or malicious faults (attacks, intrusions). Several distinct BFT protocols have been proposed in the literature and each of these protocols excels for different operational conditions. Furthermore, even for the same protocol, the configuration and deployment… Expand

Figures from this paper


Making BFT Protocols Really Adaptive
This paper reconciles existing state-machine Byzantine Fault Tolerant protocols in a single adaptive BFT system, called ADAPT, aiming at covering a larger set of conditions and use-cases, probably the union of individual subsets of these protocols. Expand
Proactive recovery in a Byzantine-fault-tolerant system
An asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors, and is the first to recover Byzantine-faulty replicas proactively, which performs well because it uses symmetric rather than public-key cryptography for authentication. Expand
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
HQ is presented, a hybrid Byzantine-fault-tolerant state machine replication protocol that employs a lightweight quorum-based protocol when there is no contention, but uses BFT to resolve contention when it arises and shows that both HQ and the new implementation of BFT scale as f increases. Expand
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
Aardvark can achieve peak performance within 40% of that of the best existing protocol in the authors' tests and provide a significant fraction of that performance when up to f servers and any number of clients are faulty. Expand
State Machine Replication for the Masses with BFT-SMART
BFT-SMART is an open-source Java-based library implementing robust BFT state machine replication with improved reliability, modularity as a first-class property, multicore-awareness, reconfiguration support and a flexible programming interface. Expand
The Next 700 BFT Protocols
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowedExpand
Practical Byzantine fault tolerance
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
Zyzzyva: speculative Byzantine fault tolerance
In Zyzzyva, replicas reply to a client's request without first running an expensive three-phase commit protocol to agree on the order to process requests, making BFT replication practical for a broad range of demanding services. Expand
On the Efficiency of Durable State Machine Replication
This work shows that the classical durability enforcing mechanisms - logging, checkpointing, state transfer - can have a high impact on the performance of SMR-based services even if SSDs are used instead of disks, and proposes three techniques that can be used in a transparent manner without modifying the SMR programming model or requiring extra resources. Expand
BAR fault tolerance for cooperative services
An implementation of BAR-B the first cooperative backup service to tolerate both Byzantine users and an unbounded number of rational users is described, an asynchronous replicated state machine that provides the customary safety and liveness guarantees despite nodes exhibiting both Byzantine and rational behaviors. Expand