{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:21Z","timestamp":1770982701731,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US Army Research Office Grant","award":["W911NF-18-1-0332"],"award-info":[{"award-number":["W911NF-18-1-0332"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1705007"],"award-info":[{"award-number":["CCF-1705007"]}],"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":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484566","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1722-1743","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["BFT Protocol Forensics"],"prefix":"10.1145","author":[{"given":"Peiyao","family":"Sheng","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}]},{"given":"Gerui","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"270","article-title":"b. Sync hotstuff: Simple and practical synchronous state machine replication","volume":"2019","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2019 b. Sync hotstuff: Simple and practical synchronous state machine replication. IACR Cryptology ePrint Archive, Vol. 2019 (2019), 270.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_2_3_1","volume-title":"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. Optimal good-case latency for byzantine broadcast and state machine replication. arXiv preprint arXiv:2003.13155 (2020)."},{"key":"e_1_3_2_2_4_1","unstructured":"Anonymized. 2020. Forensic Module for Diem. https:\/\/github.com\/BFTForensics\/DiemForensics"},{"key":"e_1_3_2_2_5_1","unstructured":"Diem Association. 2020. Diem. https:\/\/github.com\/diem\/diem"},{"key":"e_1_3_2_2_6_1","volume-title":"Twins: White-Glove Approach for BFT Testing. arXiv preprint arXiv:2004.10617","author":"Bano Shehar","year":"2020","unstructured":"Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, and Dahlia Malkhi. 2020. Twins: White-Glove Approach for BFT Testing. arXiv preprint arXiv:2004.10617 (2020)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"e_1_3_2_2_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_2_11_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_3_2_2_12_1","first-page":"88","article-title":"Streamlet","volume":"2020","author":"Chan Benjamin Y","year":"2020","unstructured":"Benjamin Y Chan and Elaine Shi. 2020. Streamlet: Textbook Streamlined Blockchains. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 88.","journal-title":"Textbook Streamlined Blockchains. IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_13_1","first-page":"377","article-title":"ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement","volume":"2018","author":"Chen Jing","year":"2018","unstructured":"Jing Chen, Sergey Gorbunov, Silvio Micali, and Georgios Vlachos. 2018. ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. IACR Cryptol. ePrint Arch., Vol. 2018 (2018), 377.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_2_15_1","first-page":"587","article-title":"Polygraph","volume":"2019","author":"Civit Pierre","year":"2019","unstructured":"Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2019. Polygraph: Accountable Byzantine Agreement. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 587.","journal-title":"Accountable Byzantine Agreement. IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_16_1","volume-title":"The Free Encyclopedia\". https:\/\/en.wikipedia.org\/wiki\/The_Day_After Online","author":"The Day Wikipedia","year":"2020","unstructured":"Wikipedia contributors. 2020. \"The Day After -- Wikipedia, The Free Encyclopedia\". https:\/\/en.wikipedia.org\/wiki\/The_Day_After Online; accessed 23 September 2020."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294279"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"e_1_3_2_2_21_1","volume-title":"Damian Straszak, and Vlad Zamfir.","author":"Kane Daniel","year":"2021","unstructured":"Daniel Kane, Andreas Fackler, Adam Gka gol, Damian Straszak, and Vlad Zamfir. 2021. Highway: Efficient Consensus with Flexible Finality. arXiv preprint arXiv:2101.02159 (2021)."},{"key":"e_1_3_2_2_22_1","unstructured":"Jinyuan Li and David Mazi\u00e9res. 2007. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems.. In NSDI ."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354225"},{"key":"e_1_3_2_2_24_1","unstructured":"Silvio Micali. 2018. Byzantine agreement made trivial."},{"key":"e_1_3_2_2_25_1","volume-title":"40th annual symposium on foundations of computer science (cat. No. 99CB37039)","author":"Micali Silvio","unstructured":"Silvio Micali, Michael Rabin, and Salil Vadhan. 1999. Verifiable random functions. In 40th annual symposium on foundations of computer science (cat. No. 99CB37039). IEEE, 120--130."},{"key":"e_1_3_2_2_26_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_27_1","volume-title":"International Conference on Principles of Distributed Systems. Springer, 88--102","author":"Ramasamy HariGovind V","year":"2005","unstructured":"HariGovind V Ramasamy and Christian Cachin. 2005. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In International Conference on Principles of Distributed Systems. Springer, 88--102."},{"key":"e_1_3_2_2_28_1","volume-title":"Long Live Blockchain! Accountable State Machine Replication for Longlasting Blockchain. arXiv preprint arXiv:2007.10541","author":"Ranchal-Pedrosa Alejandro","year":"2020","unstructured":"Alejandro Ranchal-Pedrosa and Vincent Gramoli. 2020. Blockchain Is Dead, Long Live Blockchain! Accountable State Machine Replication for Longlasting Blockchain. arXiv preprint arXiv:2007.10541 (2020)."},{"key":"e_1_3_2_2_29_1","volume-title":"GRANDPA: a Byzantine finality gadget. arXiv preprint arXiv:2007.01560","author":"Stewart Alistair","year":"2020","unstructured":"Alistair Stewart and Eleftherios Kokoris-Kogia. 2020. GRANDPA: a Byzantine finality gadget. arXiv preprint arXiv:2007.01560 (2020)."},{"key":"e_1_3_2_2_30_1","unstructured":"The LibraBFT Team. 2020. State Machine Replication in the Diem Blockchain. https:\/\/developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper\/"},{"key":"e_1_3_2_2_31_1","volume-title":"Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. arXiv preprint arXiv:2101.03715","author":"Xiang Zhuolun","year":"2021","unstructured":"Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, and Ling Ren. 2021. Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. arXiv preprint arXiv:2101.03715 (2021)."},{"key":"e_1_3_2_2_32_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.3484566","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484566","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:54:05Z","timestamp":1763499245000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":32,"alternative-id":["10.1145\/3460120.3484566","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484566","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"}}]}}