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
APUS: fast and scalable paxos on RDMA
TL;DR: This paper presents APUS, the first RDMA-based Paxos protocol that aims to be fast and scalable to client connections and hosts, and evaluated APUS on nine widely-used server programs.
Patent
File Availability in Distributed File Storage Systems
TL;DR: In this paper, file availability in distributed file storage systems is improved by initially placing replicas of a file or other object on different ones of multiple devices using a first process, and then the placement of the replicas can be improved by evaluating whether any replica of a first file can be swapped with any replica of a second file without a reduction in the combined file availability of the first and second files.
Proceedings ArticleDOI
A Prototype Evaluation of a Tamper-Resistant High Performance Blockchain-Based Transaction Log for a Distributed Database
Leonardo Aniello,Roberto Baldoni,Edoardo Gaetani,Federico Lombardi,Andrea Margheri,Vladimiro Sassone +5 more
TL;DR: To improve availability and scalability, the proposed layered blockchain-based architecture for distributed (federated) database redo logs is refined by investigating, respectively, a Byzantine Fault Tolerant consensus and a Distributed Hash Table solution to shard the first layer blockchain ledger among available nodes.
Proceedings Article
POST: a secure, resilient, cooperative messaging system
Alan Mislove,Ansley Post,Charles Reis,Paul Willmann,Peter Druschel,Dan S. Wallach,Xavier Bonnaire,Pierre Sens,Jean-Michel Busca,Luciana Arantes-Bezerra +9 more
TL;DR: This work sketches POST's basic messaging infrastructure and shows how it can be used to construct a co-operative, secure email service called ePOST, which is based on a peer-to-peer overlay network consisting of participants' desktop computers.
Selecting the Right Data Distribution Scheme for a Survivable Storage System (CMU-CS-01-120)
Jay J. Wylie,Mehmet Bakkaloglu,Vijay Pandurangan,Michael W. Bigrigg,Semih Oguz,Ken Tew,Cory Williams,Gregory R. Ganger,Pradeep K. Khosla +8 more
TL;DR: It is demonstrated that no choice is right for all systems, and an approach to codifying and visualizing this trade-o space is presented, exploring the sensitivity of the space to system characteristics, workload, and desired levels of security and availability.
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.