{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:03:00Z","timestamp":1784736180441,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"vor","delay-in-days":372,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2143058"],"award-info":[{"award-number":["2143058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623073","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"490-503","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Towards Practical Sleepy BFT"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7038-7250","authenticated-orcid":false,"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[{"name":"Chainlink Labs, San Francisco, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2201-9640","authenticated-orcid":false,"given":"Atsuki","family":"Momose","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3437-7570","authenticated-orcid":false,"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":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_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. 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_1_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. 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_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400793"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243848"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363213"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_1_8_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation."},{"key":"e_1_3_2_1_9_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_1_10_1","volume-title":"arXiv preprint arXiv:1607.01341","author":"Chen Jing","year":"2016","unstructured":"Jing Chen and Silvio Micali. 2016. Algorand. arXiv preprint arXiv:1607.01341 (2016)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1060"},{"key":"e_1_3_2_1_12_1","volume-title":"Financial Cryptography and Data Security (FC)","author":"Daian Phil","unstructured":"Phil Daian, Rafael Pass, and Elaine Shi. 2019. Snow white: Robustly reconfigurable consensus and applications to provably secure proof of stake. In Financial Cryptography and Data Security (FC). Springer, 23--41."},{"key":"e_1_3_2_1_13_1","volume-title":"Ertem Nusret Tas, and David Tse","author":"D'Amato Francesco","year":"2022","unstructured":"Francesco D'Amato, Joachim Neu, Ertem Nusret Tas, and David Tse. 2022. No More Attacks on Proof-of-Stake Ethereum? arXiv preprint arXiv:2209.03255 (2022)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"e_1_3_2_1_15_1","volume-title":"PoSAT: Proof-of-Work Availability and Unpredictability, without the Work. arXiv preprint arXiv:2010.08154","author":"Deb Soubhik","year":"2020","unstructured":"Soubhik Deb, Sreeram Kannan, and David Tse. 2020. PoSAT: Proof-of-Work Availability and Unpredictability, without the Work. arXiv preprint arXiv:2010.08154 (2020)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_20_1","volume-title":"Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition. IACR Cryptology ePrint Archive, Report 2018\/1119","author":"Fitzi Matthias","year":"2018","unstructured":"Matthias Fitzi, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Parallel Chains: Improving Throughput and Latency of Blockchain Protocols via Parallel Composition. IACR Cryptology ePrint Archive, Report 2018\/1119 (2018)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Vipul Goyal Hanjun Li and Justin Raizes. 2021. Instant Block Confirmation in the Sleepy Model. In Financial Cryptography and Data Security (FC).","DOI":"10.1007\/978-3-662-64331-0_4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_26_1","volume-title":"TaiJi: Longest Chain Availability with BFT Fast Confirmation. arXiv preprint arXiv:2011.11097","author":"Li Songze","year":"2020","unstructured":"Songze Li and David Tse. 2020. TaiJi: Longest Chain Availability with BFT Fast Confirmation. arXiv preprint arXiv:2011.11097 (2020)."},{"key":"e_1_3_2_1_27_1","volume-title":"Consensus in the Unknown-Participation Message-Adversary Model. arXiv preprint arXiv:2301.04817","author":"Losa Giuliano","year":"2023","unstructured":"Giuliano Losa and Eli Gafni. 2023. Consensus in the Unknown-Participation Message-Adversary Model. arXiv preprint arXiv:2301.04817 (2023)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559347"},{"key":"e_1_3_2_1_29_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_1_30_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_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_22"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_34_1","unstructured":"Ling Ren. 2019. Analysis of Nakamoto Consensus. IACR Cryptology ePrint Archive Report 2019\/943. (2019)."},{"key":"e_1_3_2_1_35_1","volume-title":"The Checkpointed Longest Chain: User-dependent Adaptivity and Finality. arXiv preprint arXiv:2010.13711","author":"Sankagiri Suryanarayana","year":"2020","unstructured":"Suryanarayana Sankagiri, Xuechao Wang, Sreeram Kannan, and Pramod Viswanath. 2020. The Checkpointed Longest Chain: User-dependent Adaptivity and Finality. arXiv preprint arXiv:2010.13711 (2020)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623073","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623073","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:43:20Z","timestamp":1755740600000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":36,"alternative-id":["10.1145\/3576915.3623073","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623073","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}