Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
TENDERMINT: BYZANTINE FAULT TOLERANCE IN THE AGE OF BLOCKCHAINS Ethan Buchman Advisor: University of Guelph, 2016 Professor… 
Highly Cited
2013
Highly Cited
2013
Byzantine Fault Tolerant state machine replication (BFT) protocols are replication protocols that tolerate arbitrary faults of a… 
Highly Cited
2013
Highly Cited
2013
We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous… 
Highly Cited
2010
Highly Cited
2010
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state… 
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… 
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… 
Highly Cited
2004
Highly Cited
2004
  • R. KotlaM. 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… 
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… 
Highly Cited
2002
Highly Cited
2002
Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service… 
Highly Cited
1999
Highly Cited
1999
  • M. Castro
  • USENIX Symposium on Operating Systems Design and…
  • 1999
  • Corpus ID: 221599614
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault…