DMCA
CheapBFT: resource-efficient byzantine fault tolerance (2012)
| Venue: | In European Conference on Computer Systems (EuroSys |
| Citations: | 19 - 6 self |
BibTeX
@INPROCEEDINGS{Kapitza12cheapbft:resource-efficient,
author = {Rüdiger Kapitza and Johannes Behl and Christian Cachin and Tobias Distler and Simon Kuhnle and Seyed Vahid and Mohammadi Wolfgang and Schröder-preikschat Klaus Stengel and Tu Braunschweig},
title = {CheapBFT: resource-efficient byzantine fault tolerance},
booktitle = {In European Conference on Computer Systems (EuroSys},
year = {2012},
pages = {295--308}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
One of the main reasons why Byzantine fault-tolerant (BFT) systems are not widely used lies in their high resource consumption: 3f + 1 replicas are necessary to tolerate only f faults. Recent works have been able to reduce the minimum number of replicas to 2f + 1 by relying on a trusted subsystem that prevents a replica from making conflicting statements to other replicas without being detected. Nevertheless, having been designed with the focus on fault handling, these systems still employ a majority of replicas during normalcase operation for seemingly redundant work. Furthermore, the trusted subsystems available trade off performance for security; that is, they either achieve high throughput or they come with a small trusted computing base. This paper presents CheapBFT, a BFT system that, for the first time, tolerates that all but one of the replicas active in normal-case operation become faulty. CheapBFT runs a composite agreement protocol and exploits passive replication to save resources; in the absence of faults, it requires that only f + 1 replicas actively agree on client requests and execute them. In case of suspected faulty behavior, CheapBFT triggers a transition protocol that activates f extra passive replicas and brings all non-faulty replicas into a consistent state again. This approach, for example, allows the system to safely switch to another, more resilient agreement protocol. CheapBFT relies on an FPGA-based trusted subsystem for the authentication of protocol messages that provides high performance and comprises a small trusted computing base.
Keyphrases
resource-efficient byzantine fault tolerance extra passive replica minimum number non-faulty replica normalcase operation recent work bft system fault handling high resource consumption composite agreement protocol trusted subsystem faulty behavior high performance protocol message redundant work consistent state byzantine fault-tolerant normal-case operation client request high throughput main reason first time fpga-based trusted subsystem trusted subsystem available trade transition protocol exploit passive replication resilient agreement protocol
