{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:58:17Z","timestamp":1775599097383,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"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"}],"funder":[{"name":"EU H2020","award":["780701 (PROMETHEUS)"],"award-info":[{"award-number":["780701 (PROMETHEUS)"]}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["74079 (ALGSTRONGCRYPTO)"],"award-info":[{"award-number":["74079 (ALGSTRONGCRYPTO)"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467953","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"195-198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders"],"prefix":"10.1145","author":[{"given":"Mark","family":"Abspoel","sequence":"first","affiliation":[{"name":"CWI Amsterdam, Amsterdam, Netherlands"}]},{"given":"Thomas","family":"Attema","sequence":"additional","affiliation":[{"name":"CWI Amsterdam and Leiden University, Mathematical Institute and TNO, Cyber Security and Robustness, Amsterdam, Netherlands"}]},{"given":"Matthieu","family":"Rambaud","sequence":"additional","affiliation":[{"name":"Telecom Paris, Institut polytechnique de Paris, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_3_2_2_2_1","volume-title":"Optimal-Resilience, One-Message BFT Devil. CoRR","author":"Abraham Ittai","year":"2018","unstructured":"Ittai Abraham , Guy Gueta , and Dahlia Malkhi . 2018. Hot-Stuff the Linear , Optimal-Resilience, One-Message BFT Devil. CoRR , Vol. abs\/ 1803 .05069 ( 2018 ). https:\/\/eprint.iacr.org\/2020\/406. Ittai Abraham, Guy Gueta, and Dahlia Malkhi. 2018. Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil. CoRR , Vol. abs\/1803.05069 (2018). https:\/\/eprint.iacr.org\/2020\/406."},{"key":"e_1_3_2_2_3_1","volume-title":"Revisiting Fast Practical Byzantine Fault Tolerance. CoRR","author":"Abraham Ittai","year":"2017","unstructured":"Ittai Abraham , Guy Gueta , Dahlia Malkhi , Lorenzo Alvisi , Ramakrishna Kotla , and Jean-Philippe Martin . 2017. Revisiting Fast Practical Byzantine Fault Tolerance. CoRR , Vol. abs\/ 1712 .01367 ( 2017 ). Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Ramakrishna Kotla, and Jean-Philippe Martin. 2017. Revisiting Fast Practical Byzantine Fault Tolerance. CoRR , Vol. abs\/1712.01367 (2017)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Philipp Jovanovic Mary Maller Sarah Meiklejohn Gilad Stern and Alin Tomescu. 2021. Reaching Consensus for Asynchronous Distributed Key Generation. In Podc'21 .  Ittai Abraham Philipp Jovanovic Mary Maller Sarah Meiklejohn Gilad Stern and Alin Tomescu. 2021. Reaching Consensus for Asynchronous Distributed Key Generation. In Podc'21 .","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_6_1","volume-title":"CRYPTO 2020, Santa Barbara, CA, USA, August 17--21, 2020, Proceedings, Part III (Lecture Notes in Computer Science","volume":"543","author":"Attema Thomas","year":"2020","unstructured":"Thomas Attema and Ronald Cramer . 2020 . Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. In Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference , CRYPTO 2020, Santa Barbara, CA, USA, August 17--21, 2020, Proceedings, Part III (Lecture Notes in Computer Science , Vol. 12172). Springer, 513-- 543 . Thomas Attema and Ronald Cramer. 2020. Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics. In Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17--21, 2020, Proceedings, Part III (Lecture Notes in Computer Science, Vol. 12172). Springer, 513--543."},{"key":"e_1_3_2_2_7_1","volume-title":"Compressing Proofs of k-Out-Of-n Partial Knowledge. Crypto'21","author":"Attema Thomas","year":"2021","unstructured":"Thomas Attema , Ronald Cramer , and Serge Fehr . 2021. Compressing Proofs of k-Out-Of-n Partial Knowledge. Crypto'21 ( 2021 ). Thomas Attema, Ronald Cramer, and Serge Fehr. 2021. Compressing Proofs of k-Out-Of-n Partial Knowledge. Crypto'21 (2021)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings, Part I. Springer, 324--356","author":"Badertscher Christian","year":"2017","unstructured":"Christian Badertscher , Ueli Maurer , Daniel Tschudi , and Vassilis Zikas . 2017 . Bitcoin as a Transaction Ledger: A Composable Treatment. In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20--24, 2017 , Proceedings, Part I. Springer, 324--356 . Christian Badertscher, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas. 2017. Bitcoin as a Transaction Ledger: A Composable Treatment. In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20--24, 2017, Proceedings, Part I. Springer, 324--356."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_2_12_1","volume-title":"Garay","author":"Berman Piotr","year":"1989","unstructured":"Piotr Berman and Juan A . Garay . 1989 . Asymptotically optimal distributed consensus. In Automata, Languages and Programming . Piotr Berman and Juan A. Garay. 1989. Asymptotically optimal distributed consensus. In Automata, Languages and Programming ."},{"key":"e_1_3_2_2_13_1","first-page":"851","article-title":"Asynchronous Byzantine Agreement with Subquadratic Communication","volume":"2020","author":"Blum Erica","year":"2020","unstructured":"Erica Blum , Jonathan Katz , Chen-Da Liu Zhang , and Julian Loss . 2020 . Asynchronous Byzantine Agreement with Subquadratic Communication . IACR Cryptol. ePrint Arch. , Vol. 2020 (2020), 851 . Erica Blum, Jonathan Katz, Chen-Da Liu Zhang, and Julian Loss. 2020. Asynchronous Byzantine Agreement with Subquadratic Communication. IACR Cryptol. ePrint Arch. , Vol. 2020 (2020), 851.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0314-9"},{"key":"e_1_3_2_2_16_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains . Ph.D. Dissertation. University of Guelph.  Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains . Ph.D. Dissertation. University of Guelph."},{"key":"e_1_3_2_2_17_1","volume-title":"Casper the Friendly Finality Gadget. CoRR","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith . 2017. Casper the Friendly Finality Gadget. CoRR , Vol. abs\/ 1710 .09437 ( 2017 ). Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. CoRR , Vol. abs\/1710.09437 (2017)."},{"key":"e_1_3_2_2_18_1","volume-title":"21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19--23, 2001, Proceedings (Lecture Notes in Computer Science","volume":"541","author":"Cachin Christian","year":"2001","unstructured":"Christian Cachin , Klaus Kursawe , Frank Petzold , and Victor Shoup . 2001 . Secure and Efficient Asynchronous Broadcast Protocols. In Advances in Cryptology - CRYPTO 2001 , 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19--23, 2001, Proceedings (Lecture Notes in Computer Science , Vol. 2139). Springer, 524-- 541 . Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. In Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19--23, 2001, Proceedings (Lecture Notes in Computer Science, Vol. 2139). Springer, 524--541."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_2_21_1","volume-title":"Stockmeyer","author":"Dwork Cynthia","year":"1988","unstructured":"Cynthia Dwork , Nancy A. Lynch , and Larry J . Stockmeyer . 1988 . Consensus in the presence of partial synchrony. J. ACM ( 1988). Cynthia Dwork, Nancy A. Lynch, and Larry J. Stockmeyer. 1988. Consensus in the presence of partial synchrony. J. ACM (1988)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423365"},{"key":"e_1_3_2_2_24_1","volume-title":"SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains. CoRR","author":"Golan-Gueta Guy","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. CoRR , Vol. abs\/ 1804 .01626 ( 2018 ). arxiv: 1804.01626 http:\/\/arxiv.org\/abs\/1804.01626 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. CoRR , Vol. abs\/1804.01626 (2018). arxiv: 1804.01626 http:\/\/arxiv.org\/abs\/1804.01626"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_2_28_1","volume-title":"Pease","author":"Lamport Leslie","year":"1982","unstructured":"Leslie Lamport , Robert E. Shostak , and Marshall C . Pease . 1982 . The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst . (1982). Leslie Lamport, Robert E. Shostak, and Marshall C. Pease. 1982. The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. (1982)."},{"key":"e_1_3_2_2_29_1","unstructured":"Libra Team. 2019. State Machine Replication in the LibraBlockchain . Version 2019--10--24.  Libra Team. 2019. State Machine Replication in the LibraBlockchain . Version 2019--10--24."},{"key":"e_1_3_2_2_30_1","volume-title":"DISC (LIPIcs","volume":"17","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak , Ling Ren , Elaine Shi , Nitin H. Vaidya , and Zhuolun Xiang . 2020 . Improved Extension Protocols for Byzantine Broadcast and Agreement . In DISC (LIPIcs , Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 28:1--28: 17 . Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. In DISC (LIPIcs, Vol. 179). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 28:1--28:17."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_2_33_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.3467953","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:11Z","timestamp":1750191431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":30,"alternative-id":["10.1145\/3465084.3467953","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467953","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"}}]}}