Corpus ID: 12774343

Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults

@inproceedings{Clement2009MakingBF,
  title={Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults},
  author={Allen Clement and Edmund L. Wong and Lorenzo Alvisi and Michael Dahlin and Mirco Marchetti},
  booktitle={NSDI},
  year={2009}
}
This paper argues for a new approach to building Byzantine fault tolerant replication systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don't tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this paper, we (1) demonstrate that existing protocols are dangerously fragile, (2) define a set of principles for constructing BFT services that… 
CheapBFT: resource-efficient byzantine fault tolerance
TLDR
CheapBFT is presented, a BFT system that tolerates that all but one of the replicas active in normal-case operation become faulty, and which allows the system to safely switch to another, more resilient agreement protocol.
XFT: Practical Fault Tolerance beyond Crashes
TLDR
This paper introduces cross fault tolerance or XFT, a novel approach to building reliable and secure distributed systems and applies it to the classical state-machine replication (SMR) problem, which provides the reliability guarantees of widely used asynchronous CFT SMR protocols such as Paxos and Raft, but also tolerates Byzantine faults in combination with network asynchrony.
Experiences with Fault-Injection in a Byzantine Fault-Tolerant Protocol
TLDR
Her Hermes, a fault-injector framework that provides an infrastructure for injecting faults in a Byzantine fault-tolerant state machine, is developed to help practitioners in the complex process of debugging their implementations of these algorithms, and increase the confidence of possible adopters, e.g., systems researchers, industry, by allowing them to test the implementations.
On the Practicality of Practical Byzantine Fault Tolerance
TLDR
It is found that, while many of the obstacles could be overcome, they require significant engineering effort and time and their performance implications for the end-application are unclear, and an application developer is thus unlikely to be willing to invest the time and effort to leverage the BFT approach.
Supr: Adaptive Byzantine Fault-Tolerant Replication
TLDR
This article introduces Supr, a novel method for effortlessly combining multiple replication protocols into adaptive BFT solutions, which accommodate to a much wider spectrum of environment conditions than the existing BFT systems.
Byzantine Fault-tolerant State-machine Replication from a Systems Perspective
TLDR
This survey aims at facilitating the task of building BFT systems by presenting an overview of state-of-the-art techniques and analyzing their practical implications, for example, with respect to applicability and composability.
Zyzzyva: Speculative Byzantine fault tolerance
TLDR
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.
EFS: Efficient and Fault-Scalable Byzantine Fault Tolerant Systems Against Faulty Clients
TLDR
EFS is a hybrid BFT system consisting of an efficient and fault scalable quorum protocol for the contention-free case and a fast agreement protocol to resolve contention in a fault-scalable manner that demonstrates robust fault tolerance.
hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the
Efficient Byzantine Fault Tolerance for Scalable Storage and Services
TLDR
New protocols that provide substantially better performance than previously demonstrated, including homomorphic fingerprinting, partial encoding, and Byzantine Locking, that provide unprecedented scalability, higher throughput, lower latency, and lower computational overhead are presented.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 70 REFERENCES
Practical byzantine fault tolerance and proactive recovery
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.
High throughput Byzantine fault tolerance
  • R. Kotla, M. Dahlin
  • Computer Science
    International Conference on Dependable Systems and Networks, 2004
  • 2004
TLDR
This paper proposes a high throughput Byzantine fault tolerant architecture that uses application-specific information to identify and concurrently execute independent requests and provides a general way to exploit application parallelism in order to provide high throughput without compromising correctness.
Zyzzyva: speculative Byzantine fault tolerance
TLDR
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.
Practical Byzantine fault tolerance
TLDR
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.
Separating agreement from execution for byzantine fault tolerant services
TLDR
A new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests is described, which reduces replication costs and allows a general privacy firewall architecture to protect confidentiality through replication.
Byzantine replication under attack
TLDR
This paper proposes a new performance-oriented correctness criterion, and shows how failure to meet this criterion can lead to performance degradation, and presents a new Byzantine replication protocol that achieves the criterion and is evaluated in fault-free configurations and when under attack.
Low-overhead byzantine fault-tolerant storage
TLDR
An erasure-coded Byzantine fault-tolerant block storage protocol that is nearly as efficient as protocols that tolerate only crashes and achieves throughput within 10% of the crash-tolerance protocol for writes and reads in failure-free runs.
Fault-scalable Byzantine fault-tolerant services
TLDR
The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services that provide better throughput and fault- scalability than replicated state machines using agreement-based protocols.
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
TLDR
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.
The next 700 BFT protocols
TLDR
AZyzzyva is a new protocol that mimics the behavior of Zyzzyva in best-case situations using less than 24% of the actual code of Zy Izzyva, and Aliph, a new BFT protocol that outperforms previous BFT protocols both in terms of latency and throughput.
...
1
2
3
4
5
...