Affiliation:
1. The University of Texas at Austin, TX
Abstract
We describe a new architecture for Byzantine fault tolerant state machine replication that separates
agreement
that orders requests from
execution
that processes requests. This separation yields two fundamental and practically significant advantages over previous architectures. First, it reduces replication costs because the new architecture can tolerate faults in up to half of the state machine replicas that execute requests. Previous systems can tolerate faults in at most a third of the combined agreement/state machine replicas. Second, separating agreement from execution allows a general
privacy firewall
architecture to protect confidentiality through replication. In contrast, replication in previous systems hurts confidentiality because exploiting the weakest replica can be sufficient to compromise the system. We have constructed a prototype and evaluated it running both microbenchmarks and an NFS server. Overall, we find that the architecture adds modest latencies to unreplicated systems and that its performance is competitive with existing Byzantine fault tolerant systems.
Publisher
Association for Computing Machinery (ACM)
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Distributed Transaction Processing in Untrusted Environments;Companion of the 2024 International Conference on Management of Data;2024-06-09
2. Dashing and Star: Byzantine Fault Tolerance with Weak Certificates;Proceedings of the Nineteenth European Conference on Computer Systems;2024-04-22
3. Enhancing Permissioned Blockchains with Controlled Data Authorization;Lecture Notes in Computer Science;2024
4. EB-BFT: An elastic batched BFT consensus protocol in blockchain;Future Generation Computer Systems;2023-02
5. SplitBFT;Proceedings of the 23rd ACM/IFIP International Middleware Conference;2022-10-24