2013
DOI: 10.1109/tc.2011.221
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Byzantine Fault-Tolerance

Abstract: We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f + 1 replicas, instead of the usual 3f + 1. Second, the trusted service in which this reduction of replicas is based is quite simple, making a verified implementation straightforward (and even feasible using commercial trusted hardware). Third, in nice executions the two algorithms run in the minimum number of communication st… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
165
0
6

Year Published

2014
2014
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 244 publications
(171 citation statements)
references
References 44 publications
(52 reference statements)
0
165
0
6
Order By: Relevance
“…Numerous BFT algorithms have been proposed [19][20][21][22][23][24][25][26][27][28][29]. Many of these algorithms are designed to protect generic stateful servers against Byzantine faulty server replicas and faulty clients.…”
Section: Related Workmentioning
confidence: 99%
“…Numerous BFT algorithms have been proposed [19][20][21][22][23][24][25][26][27][28][29]. Many of these algorithms are designed to protect generic stateful servers against Byzantine faulty server replicas and faulty clients.…”
Section: Related Workmentioning
confidence: 99%
“…CFN shows that, by replicating data and content into 3f + 1 server replicas, CFN can tolerate up to f failures. However, replication increases cost in resources and management, hence [185] proposed an efficient approach to reduce the number of replicas required for Byzantine-attack resiliency to 2f + 1 servers.…”
Section: E Resiliency In Cloud Middleware Infrastructurementioning
confidence: 99%
“…Intrusion tolerant began with Byzantine Fault Tolerance (BFT) replication to maintain the integrity and availability of the system from arbitrary faults [6]- [8]. A BFT system is able to provide system services with correctly functioning n components even if n is greater than fault components f .…”
Section: Related Workmentioning
confidence: 99%