Byzantine Fault Tolerance, from Theory to Reality

Driscoll. (2003). Byzantine Fault Tolerance, from Theory to Reality. Lecture Notes in Computer Science.

Type

Journal article

Intellectual base

Primary research

Year

2003

DOI

10.1007/978-3-540-39878-3_19

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/978-3-540-39878-3_19

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Byzantine Generals Problem
  • Permissioned replicated state machines — PBFT, Tendermint, and HotStuff solving the problem for high-throughput permissioned systems (databases, exchanges, internal ledgers), provisioning n replicas against a fault budget f. Blockchain consensus — the family of Byzantine-tolerant mechanisms that exist precisely because the 1982 result formalized the agreement-among-untrusted-participants problem they must solve. Safety-critical avionics and control — triple-modular-redundant flight computers and SAFEbus-style Byzantine-tolerant voting

    This sourceDocuments real Byzantine faults in avionics and why three-way voting sits below the floor for one arbitrary fault, which is the corrected form of this bullet.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:3ab33a2e1789 · see in the full table