{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:07:32Z","timestamp":1778789252879,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"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":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467899","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"331-341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Good-case Latency of Byzantine Broadcast"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"VMware Research, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_2_2_1","volume-title":"Sync HotStuff: Simple and Practical Synchronous State Machine Replication. IEEE Symposium on Security and Privacy (SP)","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. IEEE Symposium on Security and Privacy (SP) (2020). Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020 a. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. IEEE Symposium on Security and Privacy (SP) (2020)."},{"key":"e_1_3_2_2_3_1","volume-title":"Broadcast and State Machine Replication with Optimal Good-Case Latency. In 34th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik.","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang . 2020 b. Brief Announcement: Byzantine Agreement , Broadcast and State Machine Replication with Optimal Good-Case Latency. In 34th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2020 b. Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. In 34th International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_4_1","volume-title":"2020 c. Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-Case Latency. arXiv preprint arXiv:2003.13155","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang . 2020 c. Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-Case Latency. arXiv preprint arXiv:2003.13155 ( 2020 ). Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2020 c. Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-Case Latency. arXiv preprint arXiv:2003.13155 (2020)."},{"key":"e_1_3_2_2_5_1","volume-title":"2021 a. Brief Note: Fast Authenticated Byzantine Consensus. arXiv preprint arXiv:2102.07932","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang . 2021 a. Brief Note: Fast Authenticated Byzantine Consensus. arXiv preprint arXiv:2102.07932 ( 2021 ). Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021 a. Brief Note: Fast Authenticated Byzantine Consensus. arXiv preprint arXiv:2102.07932 (2021)."},{"key":"e_1_3_2_2_6_1","volume-title":"2021 b. Good-case Latency of Byzantine Broadcast: a Complete Categorization. arXiv preprint arXiv:2102.07240","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang . 2021 b. Good-case Latency of Byzantine Broadcast: a Complete Categorization. arXiv preprint arXiv:2102.07240 ( 2021 ). Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021 b. Good-case Latency of Byzantine Broadcast: a Complete Categorization. arXiv preprint arXiv:2102.07240 (2021)."},{"key":"e_1_3_2_2_7_1","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","unstructured":"Hagit Attiya and Jennifer Welch . 2004. Distributed computing: fundamentals, simulations, and advanced topics . Vol. 19 . John Wiley & Sons . Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_10_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_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200870"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_2_20_1","volume-title":"Proceeding of the 8th ACM Symposium on Principles of Distributed Computing (PODC). 339--353","author":"Ierzberg A","year":"1989","unstructured":"A Ierzberg and S Kutten . 1989 . Efficient detection of message forwarding faults . In Proceeding of the 8th ACM Symposium on Principles of Distributed Computing (PODC). 339--353 . A Ierzberg and S Kutten. 1989. Efficient detection of message forwarding faults. In Proceeding of the 8th ACM Symposium on Principles of Distributed Computing (PODC). 339--353."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"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","volume-title":"Revisiting Optimal Resilience of Fast Byzantine Consensus. arXiv preprint arXiv:2102.12825","author":"Kuznetsov Petr","year":"2021","unstructured":"Petr Kuznetsov , Andrei Tonkikh , and Yan X Zhang . 2021. Revisiting Optimal Resilience of Fast Byzantine Consensus. arXiv preprint arXiv:2102.12825 ( 2021 ). Petr Kuznetsov, Andrei Tonkikh, and Yan X Zhang. 2021. Revisiting Optimal Resilience of Fast Byzantine Consensus. arXiv preprint arXiv:2102.12825 (2021)."},{"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","unstructured":"Barbara Liskov. 2001. EECS Colloquium on Practical Byzantine Fault Tolerance https:\/\/youtu.be\/Uj638eFIWg8?t=800.  Barbara Liskov. 2001. EECS Colloquium on Practical Byzantine Fault Tolerance https:\/\/youtu.be\/Uj638eFIWg8?t=800."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_2_27_1","volume-title":"31st 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 31st International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Rafael Pass and Elaine Shi. 2017. Hybrid consensus: Efficient consensus in the permissionless model. In 31st International Symposium on Distributed Computing (DISC). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_30_1","unstructured":"Matthieu Rambaud. 2020. The latency costs of Optimistically fast output and of Strong unanimity in authenticated leader-based Byzantine consensus under partial synchrony. (2020).  Matthieu Rambaud. 2020. The latency costs of Optimistically fast output and of Strong unanimity in authenticated leader-based Byzantine consensus under partial synchrony. (2020)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417284"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_30"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467899"}},"subtitle":["a Complete Categorization"],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":34,"alternative-id":["10.1145\/3465084.3467899","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467899","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}