Practical Byzantine Fault Tolerance

Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance. Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI 1999), 173-186.

Type

Conference paper

Intellectual base

Primary research

Year

1999

Link

http://pmg.csail.mit.edu/papers/osdi99.pdf

Cited from

computer_science

Cited by

2 citations across 2 artifacts.

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

Primes

• Fault Tolerance
  • A common failure is assuming crash-stop guarantees while experiencing byzantine faults in reality (silent data corruption, partial failures, timing attacks), producing incorrect behavior where safety was thought assured

    This sourcePractical BFT replication tolerating arbitrary (Byzantine) behavior, requiring 3f+1 replicas to tolerate f faults versus 2f+1 for crash-only consensus.

Mechanisms

• Byzantine-Fault Quorum Protocol
  • Its strength is tolerating adversarial participants: it holds agreement together when members may forge, conflict, or collude up to the declared bound, and it produces proof that any outsider can check — the property that made the Practical Byzantine Fault Tolerance line of protocols

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:0dcad096f342 · see in the full table