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
Book
Mobile Edge Computing
TL;DR: A wireless network device can receive, at a traffic director in a kernel space, a data packet from a client device and determine whether the data packet is intended for an application cloud server operating in a cloud environment.
ReportDOI
Decentralized Storage Consistency via Versioning Servers
TL;DR: A consistency protocol that exploits versioning storage-nodes that provides linearizability with the possibility of read aborts in an asynchronous system that may suffer client and storage-node crash failures.
Book ChapterDOI
Paxos Consensus, Deconstructed and Abstracted
TL;DR: This work provides novel non-deterministic specifications for each module in the deconstruction of single-decree Paxos and proves that the implementations refine the corresponding specifications, such that the proofs of the modules that remain unchanged can be reused across different implementations.
Journal ArticleDOI
Pruneable sharding-based blockchain protocol
TL;DR: This work presents the pruneable sharding-based blockchain protocol by utilizing the sharding technique and PBFT(Practical Byzantine Fault Tolerance) algorithm in the improved Rollerchain, which has high efficiency, slow cubical dilatation, small capacity expansion and high scalability.
Posted Content
Enhancing Accountability and Trust in Distributed Ledgers
Maurice Herlihy,Mark Moir +1 more
TL;DR: Design principles to make manipulation of decentralized ledgers more difficult are proposed, as well as specific mechanisms to make it easier to detect when violations occur.
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.