Change search
ReferencesLink to record
Permanent link

Direct link
CheapBFT: Resource-efficient Byzantine fault tolerance
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
Show others and affiliations
2012 (English)In: EuroSys'12 - Proceedings of the EuroSys 2012 Conference, New York: Association for Computing Machinery (ACM), 2012, 295-308 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
New York: Association for Computing Machinery (ACM), 2012. 295-308 p.
Keyword [en]
Byzantine failures, Resource efficiency
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-98161DOI: 10.1145/2168836.2168866ScopusID: 2-s2.0-84860593656ISBN: 978-145031223-3OAI: diva2:536078
7th ACM European Conference on Computer Systems, EuroSys'12;Bern;10 April 2012 through 13 April 2012
QC 20120621Available from: 2012-06-21 Created: 2012-06-20 Last updated: 2012-06-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Mohammadi, Seyed Vahid
By organisation
Electronic, Computer and Software Systems, ECS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 28 hits
ReferencesLink to record
Permanent link

Direct link