Efficient Byzantine Fault-Tolerance

@article{Veronese2013EfficientBF,
  title={Efficient Byzantine Fault-Tolerance},
  author={G. Veronese and M. Correia and A. Bessani and L. Lung and P. Ver{\'i}ssimo},
  journal={IEEE Transactions on Computers},
  year={2013},
  volume={62},
  pages={16-30}
}
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. [...] Key Result The performance evaluation shows that, even with the trusted component access overhead, they can have better throughput than Castro and Liskov's PBFT, and better latency in networks with nonnegligible communication delays.Expand
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. Expand
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. Expand
Parallel Byzantine Fault Tolerance
TLDR
This work proposes Apex, a parallel Byzantine fault-tolerant execution algorithm, which can execute the incoming packs of requests even several times faster than other similar algorithms. Expand
Asphalion: trustworthy shielding against Byzantine faults
TLDR
Asphalion is introduced, the first theorem prover-based framework for verifying implementations of hybrid systems and protocols, and supports compositional reasoning, e.g., through mechanisms to lift properties about trusted-trustworthy components, to the level of the distributed systems they are integrated in. Expand
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. Expand
Making Reads in BFT State Machine Replication Fast, Linearizable, and Live
TLDR
It is shown, for the first time, that the read-only request optimization introduced in PBFT more than 20 years ago can violate its liveness, affecting not only the optimized readonly operations but also standard, totally-ordered operations. Expand
Velisarios: Byzantine Fault-Tolerant Protocols Powered by Coq
TLDR
This paper presents Velisarios, a logic-of-events based framework implemented in Coq, which is developed to implement and reason about BFT-SMR protocols and presents the first machine-checked proof of a crucial safety property of an implementation of the area’s reference protocol: PBFT. Expand
Towards scalable Byzantine fault-tolerant replication
  • Maciej Zbierski
  • Computer Science, Engineering
  • Symposium on Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments (WILGA)
  • 2017
TLDR
A universal architecture facilitating the creation of load-scalable distributed services based on BFT replication is proposed, which exploits parallel request processing to fully utilize the available resources, and uses a load balancer module to dynamically adapt to the properties of the observed client workload. Expand
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. Expand
BFT-TO: Intrusion Tolerance with Less Replicas
TLDR
This work shows that it is possible to implement a Byzantine SMR algorithm with only 2f+1 replicas by extending the system with a simple trusted distributed component and shows that the algorithm, BFT-TO, fares well in comparison with others in the literature. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 62 REFERENCES
Minimal Byzantine Storage
TLDR
A new algorithm that uses a "Listeners" pattern of network communication to detect and resolve ordering ambiguities created by concurrent accesses to the system and provides atomic consistency semantics, which is stronger than the regular or pseudo-atomic semantics provided by these existing protocols. Expand
Efficient middleware for byzantine fault tolerant database replication
TLDR
BFT database replication middleware that provides snapshot isolation semantics and is the first BFT database system that allows for concurrent transaction execution without relying on a centralized component, which is essential for having both performance and robustness. Expand
Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
TLDR
This paper argues that BFT2F, an extension to the well-known Castro-Liskov PBFT algorithm, can and should bound the system behavior beyond f failures, and has the same liveness and consistency guarantees as PBFT when no more than f replicas fail. Expand
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. Expand
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. Expand
How to tolerate half less one Byzantine nodes in practical distributed systems
TLDR
This paper extends the normal asynchronous system with a special distributed oracle called TTCB to implement an intrusion-tolerant service based on the state machine approach with only 2f + 1 replicas, this is the first time the number of replicas is reduced. Expand
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. Expand
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks
TLDR
This paper presents the first hierarchical byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites, and presents proofs that the algorithm provides safety and liveness properties. Expand
Zyzzyva: speculative byzantine fault tolerance
TLDR
In Zyzzyva, replicas respond to a client's request without first running an expensive three-phase commit protocol to reach agreement on the order in which the request must be processed. Expand
BFT Protocols Under Fire
TLDR
This work presents a simulation environment for protocols with improved performance under benign conditions that combines a declarative networking system with a robust network simulator and shows that Zyzzyva outperforms protocols like PBFT and Q/U undermost but not all conditions, indicating that one-size-fits-all protocols may be hard if not impossible to design in practice. Expand
...
1
2
3
4
5
...