Practical byzantine fault tolerance and proactive recovery

@article{Castro2002PracticalBF,
  title={Practical byzantine fault tolerance and proactive recovery},
  author={M. Castro and B. Liskov},
  journal={ACM Trans. Comput. Syst.},
  year={2002},
  volume={20},
  pages={398-461}
}
Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. [...] Key Method BFT has been implemented as a generic program library with a simple interface. We used the library to implement the first Byzantine-fault-tolerant NFS file system, BFS. The BFT library and BFS perform well because the library incorporates several important optimizations, the most important of which is the use of symmetric cryptography to…Expand
Byzantine Fault Tolerance for Distributed Systems
The growing reliance on online services imposes a high dependability requirement on the computer systems that provide these services. Byzantine fault tolerance (BFT) is a promising technology toExpand
Using abstraction to improve fault tolerance
TLDR
BFTA is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors, and an NFS service is built that allows each replica to run a different operating system. Expand
Eventual fault recovery strategies for Byzantine failures
TLDR
This work describes a reactive protocol for recovering from Byzantine failures in replicated state machines and extends prior work on Byzantine detection to provide an integrated system that can not only eventually detect, but also respond to Byzantine faults with provable consistency semantics while preserving many of the important properties of Byzantine detection. 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
Enhancing Service Integrity of Byzantine Fault Tolerant Applications
TLDR
This article presents a novel replica coordination algorithm, referred to as the CollectiveDetermination BFT algorithm, or CD-BFT algorithm in short, towards the reconciliation of the conflicting requirements for security and for strongly consistent replication. Expand
BASE: using abstraction to improve fault tolerance
TLDR
A replication technique, BASE, is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors. Expand
APPLICATION AWARE FOR BYZANTINE FAULT TOLERANCE
Driven by the need for higher reliability of many distributed systems, various replication-based fault tolerance technologies have been widely studied. A prominent technology is Byzantine faultExpand
Byzantine Fault Tolerance with Window Mechanism for Replicated Services
  • Liu Chen, W. Zhou
  • Computer Science
  • 2015 Fifth International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)
  • 2015
TLDR
This paper proposes a new Byzantine fault tolerant algorithm CLBFT (Castro Liskov Byzantine Fault Tolerance) for replicated services in the calling endpoint that works in asynchronous environments and support replicated calling services. Expand
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
TLDR
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
BASE: Using abstraction to improve fault tolerance
TLDR
A replication technique, BASE, is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
BASE: using abstraction to improve fault tolerance
TLDR
A replication technique, BASE, is described, which uses abstraction to reduce the cost of Byzantine fault tolerance and to improve its ability to mask software errors. Expand
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. Expand
COCA: a secure distributed online certification authority
TLDR
Experimental results give a quantitative evaluation for the cost and effectiveness of the protocols of COCA, the first system to integrate a Byzantine quorum system used to achieve availability with proactive recovery. Expand
Dynamic byzantine quorum systems
TLDR
Protocols for dynamically raising and lowering the resilience threshold of a quorum-based Byzantine fault-tolerant data service in response to current information on the number of server failures are presented. Expand
A Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication Algorithm
TLDR
This work has developed a practical algorithm for state-machine replication that tolerates Byzantine faults and incorporates important optimizations that enable it to outperform previous systems by more than an order of magnitude. Expand
Abstractions for devising Byzantine-resilient state machine replication
TLDR
The work is to break the complexity of devising a Byzantine-resilient state machine replication protocol by decomposing it into key modular abstractions, and always preserves safety in the presence of less than one third of Byzantine processes, independently of any synchrony assumptions. Expand
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
TLDR
This paper presents a new replication algorithm that has desirable performance properties, based on the primary copy technique, and uses a special kind of timestamp called a viewstamp to detect lost information. Expand
Muteness Failure Detectors: Specification and Implementation
TLDR
It is shown that, modulo a simple modification a consensus algorithm that has been designed in a crash-stop model with⋄S, can be reused in the presence of muteness failures simply by replacing ⋄MA with ⋅S. Expand
The Rampart Toolkit for Building High-Integrity Services
  • M. Reiter
  • Computer Science
  • Dagstuhl Seminar on Distributed Systems
  • 1994
TLDR
A brief overview of Rampart is given, focusing primarily on its protocol architecture, and its performance in the prototype implementation and ongoing work is sketched. Expand
Fault detection for Byzantine quorum systems
TLDR
This work proposes two statistical approaches for estimating the number of faulty servers based on responses to read requests in a system where each client accesses the replicated data at only a subset of servers in each operation. Expand
...
1
2
3
4
5
...