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
A Systematic Review and Empirical Analysis of Blockchain Simulators
TL;DR: In this article, the authors provide a systematic review and empirical analysis of blockchain simulators, which are easily extensible and can test the performance of distributed ledgers using different settings and parameters on a single computer.
A Decentralized Voting Algorithm for Increasing Dependability in Distributed Systems
TL;DR: The Timed-Buffer Distributed Voting Algorithm (TB-DVA), a secure distributed voting protocol, is introduced for this purpose and is contrasted with several other distributed voting schemes in order to show its unique contribution for both fault-tolerance and security.
Journal ArticleDOI
Technological revolutions in smart farming: Current trends, challenges & future directions
TL;DR: A detailed survey on ten hot-spots of smart farming is presented in this article , which covers the technology-wise state-of-the-art methods along with their application domains.
Proceedings ArticleDOI
SMChain: a scalable blockchain protocol for secure metering systems in distributed industrial plants
TL;DR: SMChain this paper adopts a two-layer blockchain structure, consisting of independent local blockchains stored at individual plants and one state blockchain stored in the cloud to provide strong security, trustworthy guarantee, and immutable services.
Journal ArticleDOI
SIoTFog: Byzantine-resilient IoT fog networking
TL;DR: A Byzantine fault-tolerant networking method and two resource allocation strategies for IoT fog computing are proposed to tolerate the Byzantine faults and improve the efficiency of transmitting and processing IoT big data.
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.