CheapBFT
Authors:
Open Access
- 10 April 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 295-308
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 normal-case 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.Keywords
This publication has 20 references indexed in Scilit:
- Fault tolerance and reliability in field-programmable gate arraysIET Computers & Digital Techniques, 2010
- BFTW 3ACM SIGACT News, 2010
- ZyzzyvaACM Transactions on Computer Systems, 2009
- Para-Virtualized TPM SharingLecture Notes in Computer Science, 2008
- A Software-Based Trusted Platform Module EmulatorLecture Notes in Computer Science, 2008
- Reconfigurable trusted computing in hardware2007
- PeerReview2007
- Implementing Trustworthy Services Using Replicated State MachinesIEEE Security & Privacy, 2005
- Separating agreement from execution for byzantine fault tolerant services2003
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002