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
Book ChapterDOI
The Sybil Attack
TL;DR: It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Journal ArticleDOI
OceanStore: an architecture for global-scale persistent storage
John Kubiatowicz,David Bindel,Yan Chen,Steven E. Czerwinski,Patrick Eaton,Dennis Geels,Ramakrishna Gummadi,Sean Rhea,Hakim Weatherspoon,Westley Weimer,Chris Wells,Ben Y. Zhao +11 more
TL;DR: OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.
Journal ArticleDOI
Blockchains and Smart Contracts for the Internet of Things
TL;DR: The conclusion is that the blockchain-IoT combination is powerful and can cause significant transformations across several industries, paving the way for new business models and novel, distributed applications.
Journal ArticleDOI
Secure routing in wireless sensor networks: attacks and countermeasures
Chris Karlof,David Wagner +1 more
TL;DR: This work proposes security goals for routing in sensor networks, shows how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensors, and introduces two classes of novel attacks against sensor networks sinkholes and HELLO floods.
Journal ArticleDOI
Securing ad hoc networks
Lidong Zhou,Zygmunt J. Haas +1 more
TL;DR: This article takes advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks and uses replication and new cryptographic schemes to build a highly secure and highly available key management service, which terms the core of this security framework.
References
More filters
Journal ArticleDOI
Watermarking, tamper-proofing, and obfuscation - tools for software protection
TL;DR: Three types of attack on the intellectual property contained in software and three corresponding technical defenses are identified, including obfuscation, watermarking, and tamper-proofing.
An Approach to Designing Fault-Tolerant Computing Systems
TL;DR: A methodology that facilitates the design of fault-tolerant computing systems is presented, based on the notion of a fail-stop processor, which automatically halts in response to any internal failure and does so before the effects of that failure become visible.
Journal ArticleDOI
Fail-stop processors: an approach to designing fault-tolerant computing systems
Journal ArticleDOI
Byzantine quorum systems
Dahlia Malkhi,Michael K. Reiter +1 more
TL;DR: In this paper, the authors consider the Byzantine failure of data repositories and present the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and also consider the load associated with their quorum systems, i.e., the minimal access probability of the busiest server.
Journal ArticleDOI
Scale and performance in a distributed file system
John H. Howard,Michael Kazar,Sherri G. Menees,David A. Nichols,Mahadev Satyanarayanan,Robert N. Sidebotham,Michael J. West +6 more
TL;DR: This paper examines the consequences of the design decision to transfer whole files between servers and workstations rather than some smaller unit such as records or blocks, as almost all other distributed file systems do, and compares the whole file transfer strategy with that of a block-oriented file system, Sun Microsystems' NFS.