{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:30:51Z","timestamp":1783110651112,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354225","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"1041-1053","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Flexible Byzantine Fault Tolerance"],"prefix":"10.1145","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[{"name":"Calibra, Menlo Park, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected $O(1)$ Rounds Expected O(n2) Communication and Optimal Resilience. In Financial Cryptography and Data Security (FC) .  Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected $O(1)$ Rounds Expected O(n2) Communication and Optimal Resilience. In Financial Cryptography and Data Security (FC) .","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146393"},{"key":"e_1_3_2_2_5_1","volume-title":"ACM SIGOPS operating systems review","author":"Aiyer Amitanand S"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","DOI":"10.1002\/0471478210"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Erica Blum Jonathan Katz and Julian Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. Cryptology ePrint Archive. (2019).  Erica Blum Jonathan Katz and Julian Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. Cryptology ePrint Archive. (2019).","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_2_8_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation.  Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation."},{"key":"e_1_3_2_2_9_1","volume-title":"Casper the Friendly Finality Gadget. CoRR","author":"Buterin Vitalik","year":"2017"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_2_11_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","journal-title":"OSDI"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_16"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","volume-title":"Byzantine Agreement with a Rational Adversary","author":"Groce Adam","DOI":"10.1007\/978-3-642-31585-5_50"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Guy Golan Gueta Ittai Abraham Shelly Grossman Dahlia Malkhi Benny Pinkas Michael K Reiter Dragos-Adrian Seredinschi Orr Tamir and Alin Tomescu. 2019. SBFT: a scalable decentralized trust infrastructure for blockchains. In DSN.  Guy Golan Gueta Ittai Abraham Shelly Grossman Dahlia Malkhi Benny Pinkas Michael K Reiter Dragos-Adrian Seredinschi Orr Tamir and Alin Tomescu. 2019. SBFT: a scalable decentralized trust infrastructure for blockchains. In DSN.","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_2_18_1","volume-title":"Consensus System. arXiv preprint arXiv:1805.04548","author":"Hanke Timo","year":"2018"},{"key":"e_1_3_2_2_19_1","volume-title":"OPODIS (LIPIcs)","volume":"70","author":"Howard Heidi","year":"2016"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_18"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0005-x"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_25_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation. USENIX Association, 485--500","author":"Liu Shengyun","year":"2016"},{"key":"e_1_3_2_2_26_1","volume-title":"Distributed algorithms","author":"Lynch Nancy A"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_11"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258650"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_2_30_1","unstructured":"David Mazieres. 2015. The stellar consensus protocol: A federated model for internet-level consensus. (2015).  David Mazieres. 2015. The stellar consensus protocol: A federated model for internet-level consensus. (2015)."},{"key":"e_1_3_2_2_31_1","volume-title":"Algorand: The efficient and democratic ledger. arXiv:1607.01341.","author":"Micali Silvio","year":"2016"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945470"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354225","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:03Z","timestamp":1750202643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":34,"alternative-id":["10.1145\/3319535.3354225","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354225","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}