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
Journal ArticleDOI
A Supply-chain System Framework Based on Internet of Things Using Blockchain Technology
TL;DR: Wang et al. as discussed by the authors proposed a new IoT management framework that embraces blockchain technology to help companies to form a supply chain effectively, which consists of an access control system, a backup peer mechanism and an internal data isolation and transmission approach.
Book ChapterDOI
Storage, Mutability and Naming in Pasta
Tim Moreton,Ian Pratt,Tim Harris +2 more
TL;DR: The design and operation of Pasta is outlined, a peer-to-peer storage system that provides traditional file system semantics while offering the wide-spread caching and distribution required for publishing networks.
Book ChapterDOI
Verifying Randomized Byzantine Agreement
Marta Kwiatkowska,Gethin Norman +1 more
TL;DR: This work describes the experience verifying the randomized protocol ABBA (Asynchronous Binary Byzantine Agreement) of Cachin, Kursawe and Shoup, a practical protocol that incorporates modern threshold-cryptographic techniques and forms a core of powerful asynchronous broadcast protocols.
Posted Content
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.
TL;DR: Ditto is designed, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks.
Proceedings ArticleDOI
Middleware support for voting and data fusion
TL;DR: How the simple "byte-by-byte" value comparison schemes used in other voting middleware as well as in byzantine fault tolerant multicast systems do not work in the face of the heterogeneity inherent in distributed systems is described.
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.