Practical Byzantine fault tolerance

DMCA

Practical Byzantine fault tolerance (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Miguel Castro, Barbara Liskov

Citations:

673 - 15 self

BibTeX

@MISC{Castro99practicalbyzantine,
    author = {Miguel Castro and Barbara Liskov},
    title = {Practical Byzantine fault tolerance},
    year = {1999}
}

OpenURL

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.

Keyphrases

byzantine-fault-tolerant nfs service new replication algorithm faulty node several important optimization arbitrary behavior asynchronous environment byzantinefault-tolerant algorithm byzantine fault standard unreplicated nfs previous algorithm synchronous system response time malicious attack software error whereas previous algorithm

DMCA