{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:38:07Z","timestamp":1773329887039,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"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":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417284","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:02Z","timestamp":1604341622000},"page":"839-857","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["On the Optimality of Optimistic Responsiveness"],"prefix":"10.1145","author":[{"given":"Nibesh","family":"Shrestha","sequence":"first","affiliation":[{"name":"Rochester Institute of Technology, Rochester, NY, USA"}]},{"given":"Ittai","family":"Abraham","sequence":"additional","affiliation":[{"name":"VMware Research, Herzliya, Israel"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"UIUC, Illinois, IL, USA"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_1_2_1","volume-title":"2020 a. Sync HotStuff: simple and practical synchronous state machine replication","author":"Abraham Ittai","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 Security and Privacy . Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020 a. Sync HotStuff: simple and practical synchronous state machine replication. In IEEE Security and Privacy ."},{"key":"e_1_3_2_1_3_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 ). 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_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_5_1","first-page":"173","article-title":"Practical Byzantine Fault Tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , 1999 . Practical Byzantine Fault Tolerance . In OSDI , Vol. 99. 173 -- 186 . Miguel Castro, Barbara Liskov, et almbox. 1999. Practical Byzantine Fault Tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_3_2_1_6_1","first-page":"981","article-title":"PaLa: A Simple Partially Synchronous Blockchain","volume":"2018","author":"Hubert Chan T-H","year":"2018","unstructured":"T-H Hubert Chan , Rafael Pass , and Elaine Shi . 2018 a. PaLa: A Simple Partially Synchronous Blockchain . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 981 . T-H Hubert Chan, Rafael Pass, and Elaine Shi. 2018a. PaLa: A Simple Partially Synchronous Blockchain. IACR Cryptology ePrint Archive , Vol. 2018 (2018), 981.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_7_1","first-page":"980","article-title":"PiLi: An Extremely Simple Synchronous Blockchain","volume":"2018","author":"Hubert Chan T-H","year":"2018","unstructured":"T-H Hubert Chan , Rafael Pass , and Elaine Shi . 2018 b. PiLi: An Extremely Simple Synchronous Blockchain . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 980 . T-H Hubert Chan, Rafael Pass, and Elaine Shi. 2018b. PiLi: An Extremely Simple Synchronous Blockchain. IACR Cryptology ePrint Archive , Vol. 2018 (2018), 980.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872066"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_13_1","volume-title":"SBFT: a scalable decentralized trust infrastructure for blockchains. arXiv preprint arXiv:1804.01626","author":"Gueta Guy Golan","year":"2018","unstructured":"Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael K Reiter , Dragos-Adrian Seredinschi , Orr Tamir , and Alin Tomescu . 2018. SBFT: a scalable decentralized trust infrastructure for blockchains. arXiv preprint arXiv:1804.01626 ( 2018 ). Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2018. SBFT: a scalable decentralized trust infrastructure for blockchains. arXiv preprint arXiv:1804.01626 (2018)."},{"key":"e_1_3_2_1_14_1","volume-title":"Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548","author":"Hanke Timo","year":"2018","unstructured":"Timo Hanke , Mahnush Movahedi , and Dominic Williams . 2018. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 ( 2018 ). Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294267"},{"key":"e_1_3_2_1_17_1","volume-title":"Tendermint: Consensus without mining. Draft v. 0.6, fall","author":"Kwon Jae","year":"2014","unstructured":"Jae Kwon . 2014 . Tendermint: Consensus without mining. Draft v. 0.6, fall , Vol. 1 , 11 (2014). Jae Kwon. 2014. Tendermint: Consensus without mining. Draft v. 0.6, fall , Vol. 1, 11 (2014)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_1_20_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 . (2020). Atsuki Momose, Jason Paul Cruz, and Yuichi Kaji. 2020. Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience. (2020)."},{"key":"e_1_3_2_1_21_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system . Technical Report. Manubot.","author":"Nakamoto Satoshi","year":"2009","unstructured":"Satoshi Nakamoto . 2009 . Bitcoin: A peer-to-peer electronic cash system . Technical Report. Manubot. Satoshi Nakamoto. 2009. Bitcoin: A peer-to-peer electronic cash system . Technical Report. Manubot."},{"key":"e_1_3_2_1_22_1","volume-title":"31st International Symposium on Distributed Computing (DISC","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 2017). 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 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417284","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:31Z","timestamp":1750197691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":27,"alternative-id":["10.1145\/3372297.3417284","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417284","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}