Practical Byzantine fault tolerance
Miguel Castro,Barbara Liskov +1 more
- pp 173-186
Reads0
Chats0
TLDR
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.Abstract:
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3% slower than a standard unreplicated NFS.read more
Citations
More filters
Proceedings ArticleDOI
Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice
TL;DR: A new construction of asynchronous BFT that replaces RBC instance with a cheaper broadcast component, Speeding MVBA, which is concretely more efficient than all existing MVBAs and reduces the message complexity incurred by n RBCs to O ( n 2 ) , but also saves up to 67% communications.
Book ChapterDOI
Cardinality Abstraction for Declarative Networking Applications
TL;DR: A cardinality abstraction-based verifier successfully proves critical safety properties of a P2 implementation of the Byzantine fault tolerance protocol Zyzzyva, which is a representative and complex declarative networking application.
Proceedings ArticleDOI
HARDFS: hardening HDFS with selective and lightweight versioning
Thanh Do,Tyler Harter,Yingchao Liu,Haryadi S. Gunawi,Andrea C. Arpaci-Dusseau,Remzi H. Arpaci-Dusseau +5 more
TL;DR: It is shown that HARDFS detects and recovers from a wide range of fail-silent behaviors caused by random bit flips, targeted corruptions, and real software bugs, and recovers orders of magnitude faster than full reboot by using micro-recovery.
Proceedings ArticleDOI
A Byzantine Fault Tolerance Model for a Multi-cloud Computing
TL;DR: Using qualitative analysis, it is shown that adopting the Byzantine Agreement protocols in the proposed BFT-MCDB model increases system reliability and enables gains in regard to the three security dimensions (data integrity, data confidentiality, and service availability).
Proceedings ArticleDOI
Survival by defense-enabling
TL;DR: This paper presents a new approach to survivability and intrusion tolerance based on the observation that many applications can be given increased resistance to malicious attack even though the environment in which they run is untrustworthy.
References
More filters
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.