Journal ArticleDOI
Practical byzantine fault tolerance and proactive recovery
Miguel Castro,Barbara Liskov +1 more
Reads0
Chats0
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.Abstract:
Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build highly available systems that tolerate Byzantine faults. BFT can be used in practice to implement real services: it performs well, it is safe in asynchronous environments such as the Internet, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery mechanism allows the algorithm to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a small window of vulnerability. BFT has been implemented as a generic program library with a simple interface. We used the library to implement the first Byzantine-fault-tolerant NFS file system, BFS. The BFT library and BFS perform well because the library incorporates several important optimizations, the most important of which is the use of symmetric cryptography to authenticate messages. The performance results show that BFS performs 2p faster to 24p slower than production implementations of the NFS protocol that are not replicated. This supports our claim that the BFT library can be used to build practical systems that tolerate Byzantine faults.read more
Citations
More filters
Proceedings ArticleDOI
FuturesMEX: Secure, Distributed Futures Market Exchange
TL;DR: This work describes all key operations for a secure, fully distributed Futures-Exchange and shows the security properties that guarantee an Exchange's economic viability, and considers security with abort (in absence of honest majority) and extend it to penalties.
Journal ArticleDOI
An Improved Blockchain Consensus Algorithm Based on Raft
Wei Fu,Wei Xuefeng,Shihua Tong +2 more
TL;DR: This paper optimizes the Raft consensus algorithm for the Hyperledger Fabric platform in terms of both log replication and leader election and demonstrates that the improved AdRaft algorithm improves 5.8% in throughput and reduces 1.3% in latency over the original Raft algorithm.
Journal ArticleDOI
SDN-RDCD: A Real-Time and Reliable Method for Detecting Compromised SDN Devices
TL;DR: A real-time method to detect compromised SDN devices in a reliable way by recognizing inconsistent or unexpected handling behaviors among the primary controller, backup controllers, and switches and it is complementary with existing detection methods.
Journal ArticleDOI
Block-CLAP: Blockchain-Assisted Certificateless Key Agreement Protocol for Internet of Vehicles in Smart Transportation
TL;DR: In this article, the authors proposed a new blockchain-assisted certificateless key agreement protocol for IoV in smart transportation context, called Block-CLAP, through authentication key management, traffic-centric data reach to a cluster head and then to its nearby road-side unit securely using the established secret keys.
Proceedings ArticleDOI
A Fair Consensus Protocol for Transaction Ordering
Avi Asayag,Gad Cohen,Ido Grayevsky,Maya Leshkowitz,Ori Rottenstreich,Ronen Tamari,David Yakira +6 more
TL;DR: A quantitative measure of fairness in the protocol is defined, it is proved theoretically that fairness manipulation in Helix is significantly limited, and experiments evaluating fairness in practice are presented.
References
More filters
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
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, 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.
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.