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
Ivy: a read/write peer-to-peer file system
TL;DR: Ivy is a multi-user read/write peer-to-peer file system that provides useful integrity properties without requiring users to fully trust either the underlying peer- to-peer storage system or the other users of the file system.
Patent
On-disk file format for a serverless distributed file system
TL;DR: A file format for a serverless distributed file system is composed of two parts: a primary data stream and a metadata stream as discussed by the authors, and each file is encrypted using a hash of the block as the encryption key.
Proceedings ArticleDOI
The Blockchain as a Software Connector
Xiwei Xu,Cesare Pautasso,Liming Zhu,Vincent Gramoli,Alexander Ponomarev,An Binh Tran,Shiping Chen +6 more
TL;DR: This paper provides rationales to support the architectural decision on whether to employ a decentralized blockchain as opposed to other software solutions, like traditional shared data storage and explores specific implications of using the blockchain as a software connector including design trade-offs regarding quality attributes.
Proceedings Article
Making Byzantine fault tolerant systems tolerate Byzantine faults
TL;DR: Aardvark can achieve peak performance within 40% of that of the best existing protocol in the authors' tests and provide a significant fraction of that performance when up to f servers and any number of clients are faulty.
Journal ArticleDOI
Security and Privacy on Blockchain
Rui Zhang,Rui Xue,Ling Liu +2 more
TL;DR: This article presents a comprehensive overview of the security and privacy of blockchain with respect to concept, attributes, techniques, and systems, and describes the basic security properties that are supported as the essential requirements and building blocks for Bitcoin-like cryptocurrency systems.
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.