{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:44:50Z","timestamp":1773330290493,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Novi"},{"DOI":"10.13039\/100016682","name":"VMware","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016682","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484554","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1686-1699","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Multi-Threshold Byzantine Fault Tolerance"],"prefix":"10.1145","author":[{"given":"Atsuki","family":"Momose","sequence":"first","affiliation":[{"name":"Intelligent Systems Laboratory, SECOM CO., LTD. & Nagoya University, Mitaka, Tokyo, Japan"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Expected O(n2) Communication, and Optimal Resilience. In Financial Cryptography and Data Security (FC)","author":"Abraham Ittai","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). Springer, 320--334."},{"key":"e_1_3_2_2_2_1","volume-title":"Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy (S&P). IEEE, 106--118","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020 a. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In IEEE Symposium on Security and Privacy (S&P). IEEE, 106--118."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_2_4_1","volume-title":"2020 b. Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. arXiv preprint arXiv:2003.13155","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2020 b. Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. arXiv preprint arXiv:2003.13155 (2020)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"e_1_3_2_2_6_1","unstructured":"Mathieu Baudet Avery Ching Andrey Chursin George Danezis Francc ois Garillot Zekun Li Dahlia Malkhi Oded Naor Dmitri Perelman and Alberto Sonnino. [n.d.]. State machine replication in the Libra Blockchain."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_2_8_1","volume-title":"2020 a. Network-Agnostic State Machine Replication. arXiv preprint arXiv:2002.03437","author":"Blum Erica","year":"2020","unstructured":"Erica Blum, Jonathan Katz, and Julian Loss. 2020 a. Network-Agnostic State Machine Replication. arXiv preprint arXiv:2002.03437 (2020)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298487"},{"key":"e_1_3_2_2_12_1","volume-title":"Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_2_14_1","volume-title":"3rd Symposium on Operating Systems Design and Implementation (OSDI). USENIX, 173--186","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In 3rd Symposium on Operating Systems Design and Implementation (OSDI). USENIX, 173--186."},{"key":"e_1_3_2_2_15_1","unstructured":"T-H Hubert Chan Rafael Pass and Elaine Shi. 2018. PiLi: An Extremely Simple Synchronous Blockchain. IACR Cryptology ePrint Archive Report 2018\/980 (2018)."},{"key":"e_1_3_2_2_16_1","volume-title":"https:\/\/github.com\/jpmorganchase\/quorum\/blob\/master\/docs\/Quorum Whitepaper v0.2.pdf","author":"Morgan Chase J.P.","year":"2018","unstructured":"J.P.Morgan Chase. 2018. Quorum Whitepaper. (2018). https:\/\/github.com\/jpmorganchase\/quorum\/blob\/master\/docs\/Quorum Whitepaper v0.2.pdf."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332490"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491245"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_18"},{"key":"e_1_3_2_2_28_1","volume-title":"Multi-Threshold Asynchronous Reliable Broadcast and Consensus. In 24th International Conference on Principles of Distributed Systems (OPODIS) .","author":"Hirt Martin","year":"2020","unstructured":"Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang. 2020. Multi-Threshold Asynchronous Reliable Broadcast and Consensus. In 24th International Conference on Principles of Distributed Systems (OPODIS) ."},{"key":"e_1_3_2_2_29_1","volume-title":"Flavio Paiva Junqueira, and Benjamin Reed","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 USENIX annual technical conference, Vol. 8."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Michael Kumhof and Clare Noone. 2018. Central bank digital currencies-design principles and balance sheet implications. (2018).","DOI":"10.2139\/ssrn.3180713"},{"key":"e_1_3_2_2_33_1","unstructured":"Leslie Lamport. 2019. The part-time parliament. In Concurrency: the Works of Leslie Lamport. 277--317."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_35_1","volume-title":"USENIX Symposium on Operating Systems Design and Implementation (OSDI). 485--500","author":"Liu Shengyun","year":"2016","unstructured":"Shengyun Liu, Paolo Viotti, Christian Cachin, Vivien Qu\u00e9ma, and Marko Vukoli?. 2016. XFT: Practical fault tolerance beyond crashes. In USENIX Symposium on Operating Systems Design and Implementation (OSDI). 485--500."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354225"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_39_1","volume-title":"Jason Paul Cruz, and Yuichi Kaji","author":"Momose Atsuki","year":"2020","unstructured":"Atsuki Momose, Jason Paul Cruz, and Yuichi Kaji. 2020. Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience. IACR Cryptology ePrint Archive, Report 2020\/406 (2020)."},{"key":"e_1_3_2_2_40_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system.","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_3_2_2_41_1","volume-title":"Ertem Nusret Tas, and David Tse","author":"Neu Joachim","year":"2020","unstructured":"Joachim Neu, Ertem Nusret Tas, and David Tse. 2020. Ebb-and-flow protocols: A resolution of the availability-finality dilemma. arXiv preprint arXiv:2009.04987 (2020)."},{"key":"e_1_3_2_2_42_1","volume-title":"International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.","author":"Pass Rafael","year":"2017","unstructured":"Rafael Pass and Elaine Shi. 2017. Hybrid consensus: Efficient consensus in the permissionless model. In International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_2_46_1","volume-title":"On the Optimality of Optimistic Responsiveness. In ACM SIGSAC Conference on Computer and Communications Security (CCS). 839--857","author":"Shrestha Nibesh","year":"2020","unstructured":"Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. 2020. On the Optimality of Optimistic Responsiveness. In ACM SIGSAC Conference on Computer and Communications Security (CCS). 839--857."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484554","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:53:39Z","timestamp":1763499219000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":47,"alternative-id":["10.1145\/3460120.3484554","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484554","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}