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
Managing QoS of Internet-of-Things Services Using Blockchain
TL;DR: It is argued that the QoS measurement of IoT-based services would be decentralized and the trusts be built from collectively trusted subnetworks, and the blockchain technologies (BCT) with a multi-agent approach to warrantee the trustiness of real-time data for the measurement of QoS in the IoT environment.
Proceedings ArticleDOI
Zero-Trust Hierarchical Management in IoT
Mayra Samaniego,Ralph Deters +1 more
TL;DR: Amatista presents a novel zero-trust hierarchical mining process that allows validating the infrastructure and transactions at different levels of trust in IoT, and is evaluated on Edison Arduino Boards.
Proceedings ArticleDOI
Paxos made transparent
TL;DR: Crane is an SMR system that transparently replicates general server programs that leverages deterministic multithreading (specifically, the authors' prior system Parrot) to make multithreaded replicas deterministic.
Journal ArticleDOI
Food Safety Supervision System Based on Hierarchical Multi-Domain Blockchain Network
TL;DR: The hierarchical multi-domain blockchain (HMDBC) network structure and the secondary-check mechanism is proposed, which can support timely correction and replacement of the malicious supervision nodes by regional nodes co-governance, auxiliary verification of supervision nodes, and arbitration of superior regions.
ReportDOI
Verifiable Secret Redistribution for Threshold Sharing Schemes
TL;DR: A new protocol for the verifiable redistribution of secrets from (m,n) to (m',n') access structures for threshold sharing schemes is presented, which enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage.
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.