Sökning: onr:"swepub:oai:DiVA.org:kth-98161" >
CheapBFT :
CheapBFT : Resource-efficient Byzantine fault tolerance
-
Kapitza, R. (författare)
-
Behl, J. (författare)
-
- Mohammadi, Seyed Vahid (författare)
- KTH,Elektronik- och datorsystem, ECS
-
visa fler...
-
Cachin, C. (författare)
-
Distler, T. (författare)
-
Kuhnle, S. (författare)
-
Schröder-Preikschat, W. (författare)
-
Stengel, K. (författare)
-
visa färre...
-
(creator_code:org_t)
- 2012-04-10
- 2012
- Engelska.
-
Ingår i: EuroSys'12 - Proceedings of the EuroSys 2012 Conference. - New York : Association for Computing Machinery (ACM). - 9781450312233 ; , s. 295-308
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Byzantine failures
- Resource efficiency
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas