Byzantine fault tolerance
E471415
Byzantine fault tolerance is a property of distributed systems that enables them to continue operating correctly even when some components behave arbitrarily or maliciously.
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
consensus property
ⓘ
distributed computing concept ⓘ fault tolerance model ⓘ |
| addresses |
Byzantine faults
ⓘ
arbitrary node failures ⓘ inconsistent or conflicting messages from faulty nodes ⓘ malicious node behavior ⓘ |
| alsoKnownAs | BFT ⓘ |
| appliesTo |
blockchain systems
ⓘ
distributed databases ⓘ mission-critical distributed systems ⓘ replicated services ⓘ |
| assumes |
bounded number of Byzantine nodes
ⓘ
reliable cryptographic primitives in many protocols ⓘ |
| constrains | maximum fraction of faulty nodes that can be tolerated ⓘ |
| contrastsWith | crash fault tolerance ⓘ |
| definedAs | ability of a distributed system to function correctly despite arbitrary faults ⓘ |
| enables |
operation in presence of compromised nodes
ⓘ
robustness against insider attacks in distributed systems ⓘ |
| formalizedIn | Byzantine Generals Problem NERFINISHED ⓘ |
| goal |
maintain correct overall system behavior
ⓘ
prevent faulty nodes from breaking safety ⓘ reach agreement among honest nodes ⓘ |
| hasProperty |
ensures liveness under certain network assumptions
ⓘ
ensures safety despite faulty nodes ⓘ tolerates arbitrary faults up to a threshold ⓘ |
| implies | system can mask arbitrary node misbehavior up to a limit ⓘ |
| influences |
design of consensus algorithms
ⓘ
security models for distributed ledgers ⓘ |
| oftenFormalizedAs | Byzantine agreement problem NERFINISHED ⓘ |
| oftenRequires | at least 3f+1 replicas to tolerate f Byzantine faults in classical models ⓘ |
| relatedTo |
Byzantine Generals Problem
NERFINISHED
ⓘ
Byzantine agreement protocols NERFINISHED ⓘ PBFT NERFINISHED ⓘ Practical Byzantine Fault Tolerance NERFINISHED ⓘ blockchain consensus ⓘ distributed consensus ⓘ state machine replication ⓘ |
| requires |
agreement among non-faulty nodes
ⓘ
message authentication or integrity mechanisms ⓘ redundant nodes ⓘ |
| studiedIn |
cryptography and security
ⓘ
distributed systems research ⓘ fault-tolerant computing ⓘ |
| usedIn |
Byzantine fault-tolerant replicated state machines
ⓘ
critical control systems requiring high reliability ⓘ permissioned blockchain platforms ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.