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
Posted Content
RCC: Resilient Concurrent Consensus for High-Throughput Secure Transaction Processing
TL;DR: This work proposes a RCC paradigm that can turn any primary-backup consensus protocol into a concurrent consensus protocol by running many consensus instances concurrently and achieves up to 2.75× higher throughput than other consensus protocols and can be scaled to 91 replicas.
Journal ArticleDOI
MBFT: A New Consensus Algorithm for Consortium Blockchain
TL;DR: This paper proposes a new type of consensus algorithm: mixed Byzantine fault tolerance (MBFT), which functionally partitions the nodes that participate in the consensus process and improves the scalability and efficiency without sacrificing security.
Journal ArticleDOI
BEMPAS: A Decentralized Employee Performance Assessment System Based on Blockchain for Smart City Governance
TL;DR: A decentralized employee evaluation system based on blockchain that achieves trust, transparency, security and accountability among government workers under a Smart City governing environment is proposed.
Journal ArticleDOI
Blockchain Token Economics: A Mean-Field-Type Game Perspective
TL;DR: The results suggest that the number of tokens in circulation needs to be adjusted in order to capture risk-awareness and self-regulatory behavior in blockchain token economics.
Journal ArticleDOI
Dynamic reputation–based consensus mechanism: Real-time transactions for energy blockchain:
TL;DR: Compared with the algorithm of the fabric platform, the dynamic-reputation practical Byzantine fault tolerance algorithm improves the transaction processing speed and is suitable for the blockchain application in the energy field.
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.