Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Byzantine fault tolerance

Known as: Byzantine Agreement Problem, Byzantine agreement, Byzantine Node 
In fault-tolerant computer systems, and in particular distributed computing systems, Byzantine fault toleranceis the characteristic of a system that… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
One of the main reasons why Byzantine fault-tolerant (BFT) systems are not widely used lies in their high resource consumption… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Most Byzantine fault-tolerant state machine replication(BFT) algorithms have a primary replica that is in charge of ordering the… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A longstanding vision in distributed systems is to build reliable systems from unreliable components. An enticing formulation of… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • R. Kotla, M. Dahlin
  • International Conference on Dependable Systems…
  • 2004
  • Corpus ID: 2304023
This paper argues for a simple change to Byzantine fault tolerant (BFT) state machine replication libraries. Traditional BFT… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Since its introduction nearly 20 years ago, the Byzantine Generals Problem has been the subject of many papers having the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
1999
1999
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?