Affiliation:
1. Computer Science Department, Johns Hopkins University, MD, USA
2. Computer Science Department, TU Darmstadt, Darmstadt, Germany
Abstract
Byzantine Fault Tolerant (BFT) protocols have the ability to work correctly even when up to a threshold
f
of system servers are compromised. This makes them appealing for the construction of critical systems connected to the Internet, which are constantly a target for cyber attacks.
BFT protocols differ based on the kind of application, deployment settings, performance, access control mechanisms, number of servers in the system, and protocol implementation. The large number of protocols present in the literature and their differences make it difficult for a system builder to choose the solution that best satisfies the requirements of the system that he wants to build. In particular, the main difference among BFT protocols lies in their system models: server-side versus client-side. In the server-side model each client relies on the system to consistently order and replicate updates, while in the client-side model each client actively participates in the protocol.
In this article, we classify BFT protocols as server-side or client-side. We analyze the trade-offs between the two models, describe systems that use these models and the trade-offs they choose, highlight the research gaps, and provide guidelines to system builders in order to choose the solution that best satisfies their needs.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference57 articles.
1. Fault-scalable Byzantine fault-tolerant services
2. Farsite
3. Byzantine replication under attack
4. Yair Amir Jonathan Kirsch John Lane and Marco Platania. 2014. Prime 2.0. Retrieved from http://www.dsn. jhu.edu/download.html. Yair Amir Jonathan Kirsch John Lane and Marco Platania. 2014. Prime 2.0. Retrieved from http://www.dsn. jhu.edu/download.html.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献