scispace - formally typeset
Open AccessProceedings ArticleDOI

Practical Byzantine fault tolerance

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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Blockchain enabled verification for cellular-connected unmanned aircraft system networking

TL;DR: This paper proposes a novel blockchain-based approach to mitigate the threats from accessing the malicious BSs, and implements the consensus construction on the authentication of networking access to enhance the efficiency of verification between BSs.
Book ChapterDOI

Integrated platforms for blockchain enablement

TL;DR: This chapter aims to achieve this goal by describing an evaluation framework which can be utilized to select a suitable blockchain platform for a given IoT application.
Journal ArticleDOI

An Effective Yield Estimation System Based on Blockchain Technology

TL;DR: This article will propose a blockchain-based solution that carries out yield estimation of agricultural products and brings all participants interested in agriculture together and produces an early yield estimation.
Book ChapterDOI

Revisiting Practical Byzantine Fault Tolerance Through Blockchain Technologies

TL;DR: It is highlighted that Byzantine fault tolerance should be considered a practical and fundamental building block for modern long-running and safety critical systems and that the principles, mechanisms, and blockchain technologies themselves could help improve the security and quality of such systems.
Posted Content

An AI Based Super Nodes Selection Algorithm in BlockChain Networks.

TL;DR: Experimental results demonstrate that the conceptual framework, fundamental theory and research methodology, based on artificial intelligence technology that exploits nearly complementary information of each nodes, compares favorably to the three state-of-the-art consensus frameworks, in terms of security and the speed of transaction confirmation.
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.
Related Papers (5)