{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:53:21Z","timestamp":1771703601982,"version":"3.50.1"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T00:00:00Z","timestamp":1489795200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["N660001-1-2-4014"],"award-info":[{"award-number":["N660001-1-2-4014"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Loewe CASED projects"},{"name":"TUD EC-SPRIDE"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2016,5,2]]},"abstract":"<jats:p>\n                    Byzantine Fault Tolerant (BFT) protocols have the ability to work correctly even when up to a threshold\n                    <jats:italic toggle=\"yes\">f<\/jats:italic>\n                    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.\n                  <\/jats:p>\n                  <jats:p>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.<\/jats:p>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1145\/2886780","type":"journal-article","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T09:50:44Z","timestamp":1458294644000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["On Choosing Server- or Client-Side Solutions for BFT"],"prefix":"10.1145","volume":"48","author":[{"given":"Marco","family":"Platania","sequence":"first","affiliation":[{"name":"Computer Science Department, Johns Hopkins University, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Obenshain","sequence":"additional","affiliation":[{"name":"Computer Science Department, Johns Hopkins University, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Tantillo","sequence":"additional","affiliation":[{"name":"Computer Science Department, Johns Hopkins University, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Amir","sequence":"additional","affiliation":[{"name":"Computer Science Department, Johns Hopkins University, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeraj","family":"Suri","sequence":"additional","affiliation":[{"name":"Computer Science Department, TU Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,3,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095817"},{"key":"e_1_2_1_2_1","volume-title":"Wattenhofer","author":"Adya Atul","year":"2002","unstructured":"Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, and Roger P. Wattenhofer. 2002. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Operating Systems Review 36, SI (2002), 1--14."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2008.4630088"},{"key":"e_1_2_1_4_1","unstructured":"Yair Amir Jonathan Kirsch John Lane and Marco Platania. 2014. Prime 2.0. Retrieved from http:\/\/www.dsn. jhu.edu\/download.html."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 10th USENIX Conference on Hot Topics in System Dependability. USENIX Association, 9--14","author":"Behl Johannes","year":"2014","unstructured":"Johannes Behl, Tobias Distler, and R\u00fcdiger Kapitza. 2014. Scalable BFT for multi-cores: Actor-based decomposition and consensus-oriented parallelization. In Proceedings of the 10th USENIX Conference on Hot Topics in System Dependability. USENIX Association, 9--14."},{"key":"e_1_2_1_6_1","volume-title":"Advances in Cryptology\u2014CRYPTO\u201996","author":"Bellare Mihir","unstructured":"Mihir Bellare, Ran Canetti, and Hugo Krawczyk. 1996. Keying hash functions for message authentication. In Advances in Cryptology\u2014CRYPTO\u201996. Springer, 1--15."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535929"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_2_1_9_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 6th USENIX Symposium on Networked System Design and Implementation (NSDI)","volume":"9","author":"Clement Allen","year":"2009","unstructured":"Allen Clement, Edmund L. Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009b. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of the 6th USENIX Symposium on Networked System Design and Implementation (NSDI), Vol. 9. USENIX, 153--168."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(93)90054-9"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 177--190","author":"Cowling James","year":"2006","unstructured":"James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. 2006. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 177--190."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1308172.1308232"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516750"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111337"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSNW.2013.6615538"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the USENIX Security Symposium.","author":"Giuffrida Cristiano","unstructured":"Cristiano Giuffrida, Anton Kuijsten, and Andrew S. Tanenbaum. 2012. Enhanced operating system security through efficient and fine-grained address space randomization. In Proceedings of the USENIX Security Symposium."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 2004 International Conference on Dependable Systems and Networks. IEEE, 135--144","author":"Goodson Garth R.","unstructured":"Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger, and Michael K. Reiter. 2004. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the 2004 International Conference on Dependable Systems and Networks. IEEE, 135--144."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_2_1_24_1","volume-title":"Reiter","author":"Hendricks James","year":"2007","unstructured":"James Hendricks, Gregory R. Ganger, and Michael K. Reiter. 2007. Low-overhead Byzantine fault-tolerant storage. In ACM SIGOPS Operating Systems Review, Vol. 41. ACM, 73--86."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6494997"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the USENIX Annual Technical Conference","volume":"8","author":"Hunt Patrick","year":"2010","unstructured":"Patrick Hunt, Mahadev Konar, Flavio Paiva Junqueira, and Benjamin Reed. 2010. ZooKeeper: Wait-free coordination for internet-scale systems. In Proceedings of the USENIX Annual Technical Conference, Vol. 8. 9."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2013.2269541"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786228"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_33_1","first-page":"18","article-title":"Paxos made simple","volume":"32","author":"Lamport Leslie","year":"2001","unstructured":"Leslie Lamport. 2001. Paxos made simple. ACM Sigact News 32, 4 (2001), 18--25.","journal-title":"ACM Sigact News"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.83"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems. IEEE, 51--58","author":"Malkhi Dahlia","unstructured":"Dahlia Malkhi and Michael K. Reiter. 1998b. Secure and scalable replication in Phalanx. In Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems. IEEE, 51--58."},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems. IEEE, 271--279","author":"Malkhi Dahlia","unstructured":"Dahlia Malkhi and Michael K. Reiter. 1998c. Survivable consensus objects. In Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems. IEEE, 271--279."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_2_1_40_1","volume-title":"Reiter","author":"Merideth Michael G.","year":"2010","unstructured":"Michael G. Merideth and Michael K. Reiter. 2010. Selected results from the latest decade of quorum systems research. In Replication. Springer, 185--206."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2013.15"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the IEEE Symposium on Security and Privacy (SP). IEEE, 601--615","author":"Pappas Vasilis","unstructured":"Vasilis Pappas, Michalis Polychronakis, and Angelos D. Keromytis. 2012. Smashing the gadgets: Hindering return-oriented programming using in-place code randomization. In Proceedings of the IEEE Symposium on Security and Privacy (SP). IEEE, 601--615."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2014.16"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/502059.502037"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1813654.1813655"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.221197"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2010.5544295"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDCC.2012.32"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.83"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945470"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the International Conference on Embedded Software and Systems (ICESS\u201908)","author":"Zhao Wenbing","unstructured":"Wenbing Zhao and F. Eugenio Villaseca. 2008. Byzantine fault tolerance for electric power grid monitoring and control. In Proceedings of the International Conference on Embedded Software and Systems (ICESS\u201908). IEEE, 129--135."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571638"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2886780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2886780","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2886780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:17:00Z","timestamp":1763457420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2886780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,18]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5,2]]}},"alternative-id":["10.1145\/2886780"],"URL":"https:\/\/doi.org\/10.1145\/2886780","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,18]]},"assertion":[{"value":"2015-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}