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
LedgerDB: a centralized ledger database for universal audit and verification
TL;DR: This work proposes LedgerDB on Alibaba Cloud, which is a centralized ledger database with tamper-evidence and non-repudiation features similar to blockchain, and provides strong auditability, and has much higher throughput compared to blockchains.
Proceedings Article
Fine-Grained, Secure and Efficient Data Provenance for Blockchain.
TL;DR: LineageChain captures provenance during contract execution, and efficiently stores it in a Merkle tree, and provides a novel skip list index designed for supporting efficient provenance query processing.
Journal ArticleDOI
Blockchain and smart contract for access control in healthcare: A survey, issues and challenges, and open issues
TL;DR: In this paper, an extensive survey on the state-of-the-art blockchain-based access control methods in healthcare domain is presented as a basis for categorizing the existing and future developments in access control area.
Journal ArticleDOI
Secure and Efficient Data Collection and Storage of IoT in Smart Ocean
TL;DR: This article presents a secure, efficient, and complete data collection, and transmission and storage scheme for IoT in smart ocean, able to resist many typical attacks for underwater nodes, such as manipulation attacks, Distributed Denial-of-Service (DDoS) attacks, malicious node injection attacks, and so on.
Journal ArticleDOI
Coalition Game-Based Computation Resource Allocation for Wireless Blockchain Networks
Ning Zhao,Hao Wu,Yali Chen +2 more
TL;DR: This paper first formulate the computation resource allocation problem of PBN from the viewpoint of coalition game theory under the MEC environment, and proposes a coalition formation game-based algorithm to maximize the system sum utility and take both the individual profit of IMD and coalition profit into consideration.
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.