POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
UMAC: Fast and Secure Message Authentication
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
A High-Throughput Secure Reliable Multicast Protocol
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
COCA: A Secure Distributed On-line Certification Authority
COCA: A Secure Distributed On-line Certification Authority
Proactive recovery in a Byzantine-fault-tolerant system
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Checking a Non-Byzantine FT Scheme against Byzantine Faults
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Abstract: Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behavior from faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow to be used in practice - BFT performs well so that it can be used to implement real systems. We implemented a replicated NFS file system using BFT that performs 2% faster to 24% slower than production implementations of the NFS protocol that are not fault-tolerant.