{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T16:14:51Z","timestamp":1768407291452,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":80,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,12,15]]},"DOI":"10.1145\/3721462.3770782","type":"proceedings-article","created":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T19:56:49Z","timestamp":1765223809000},"page":"427-440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Message Size Matters: AlterBFT\u2019s Approach to Practical Synchronous BFT in Public Clouds"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4542-1115","authenticated-orcid":false,"given":"Nenad","family":"Milosevic","sequence":"first","affiliation":[{"name":"Universit\u221a\u2020 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1598-106X","authenticated-orcid":false,"given":"Daniel","family":"Cason","sequence":"additional","affiliation":[{"name":"Circle Inc., New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8609-5263","authenticated-orcid":false,"given":"Zarko","family":"Milosevic","sequence":"additional","affiliation":[{"name":"Informal Systems, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2825-6660","authenticated-orcid":false,"given":"Robert","family":"Soule","sequence":"additional","affiliation":[{"name":"Yale University, New Heaven, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2256-0901","authenticated-orcid":false,"given":"Fernando","family":"Pedone","sequence":"additional","affiliation":[{"name":"Universit\u221a\u2020 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Libp2p. https:\/\/libp2p.io. [Accessed 2023-01-12]."},{"key":"e_1_3_2_1_2_1","unstructured":"[n. d.]. SGX. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/tools\/software-guard-extensions\/overview.html."},{"key":"e_1_3_2_1_3_1","volume-title":"Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP).  10","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 2020 IEEE Symposium on Security and Privacy (SP). 10.1109\/sp40000.2020.00044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Ittai Abraham Kartik Nayak Ling Ren and Nibesh Shrestha. 2020. On the Optimality of Optimistic Responsiveness. Cryptology ePrint Archive Paper 2020\/458. https:\/\/eprint.iacr.org\/2020\/458. 10.1145\/3372297.3417284","DOI":"10.1145\/3372297.3417284"},{"key":"e_1_3_2_1_5_1","volume-title":"Optimal Good-Case Latency for Rotating Leader Synchronous BFT. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021","author":"Abraham Ittai","year":"2022","unstructured":"Ittai Abraham, Kartik Nayak, and Nibesh Shrestha. 2022. Optimal Good-Case Latency for Rotating Leader Synchronous BFT. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). 27:1\u201327:19. 10.4230\/LIPICS.OPODIS.2021.27"},{"key":"e_1_3_2_1_6_1","volume-title":"Mysticeti: Reaching the Limits of Latency with Uncertified DAGs. arXiv:2310.14821 [cs.DC] https:\/\/arxiv.org\/abs\/2310.14821","author":"Babel Kushal","year":"2024","unstructured":"Kushal Babel, Andrey Chursin, George Danezis, Anastasios Kichidis, Lefteris Kokoris-Kogias, Arun Koshy, Alberto Sonnino, and Mingwei Tian. 2024. Mysticeti: Reaching the Limits of Latency with Uncertified DAGs. arXiv:2310.14821 [cs.DC] https:\/\/arxiv.org\/abs\/2310.14821"},{"key":"e_1_3_2_1_7_1","volume-title":"The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers. In 2020 International Conference on Omni-layer Intelligent Systems, COINS 2020","author":"Baird Leemon","year":"2020","unstructured":"Leemon Baird and Atul Luykx. 2020. The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers. In 2020 International Conference on Omni-layer Intelligent Systems, COINS 2020, Barcelona, Spain, August 31 - September 2, 2020. IEEE, 1\u20137. 10.1109\/COINS49042.2020.9191430"},{"key":"e_1_3_2_1_8_1","volume-title":"Advances in Cryptology \u2014 ASIACRYPT","author":"Boneh Dan","year":"2001","unstructured":"Dan Boneh, Ben Lynn, and Hovav Shacham. 2001. Short Signatures from the Weil Pairing. In Advances in Cryptology \u2014 ASIACRYPT 2001, Colin Boyd (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 514\u2013532."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_10_1","unstructured":"Ethan Buchman Jae Kwon and Zarko Milosevic. 2018. The latest gossip on BFT consensus. arXiv:1807.04938 [cs.DC]. arXiv:1807.04938 [cs.DC] https:\/\/arxiv.org\/abs\/1807.04938"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397246"},{"key":"e_1_3_2_1_12_1","unstructured":"Mike Burrows. 2006. The Chubby Lock Service for Loosely-Coupled Distributed Systems. 335\u2013350. http:\/\/dl.acm.org\/citation.cfm?id=1298455.1298487"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","author":"Camenisch Jan","year":"2022","unstructured":"Jan Camenisch, Manu Drijvers, Timo Hanke, Yvonne-Anne Pignolet, Victor Shoup, and Dominic Williams. 2022. Internet Computer Consensus. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Salerno, Italy) (PODC'22). Association for Computing Machinery, New York, NY, USA, 81\u201391. 10.1145\/3519270.3538430"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the Third Symposium on Operating Systems Design and Implementation","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation (New Orleans, Louisiana, USA) (OSDI '99). USENIX Association, USA, 173\u2013186."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 2nd ACM Conference on Advances in Financial Technologies","author":"Benjamin","year":"1961","unstructured":"Benjamin Y. Chan and Elaine Shi. 2020. Streamlet: Textbook Streamlined Blockchains. In Proceedings of the 2nd ACM Conference on Advances in Financial Technologies (New York, NY, USA) (AFT '20). Association for Computing Machinery, New York, NY, USA, 1\u201311. 10.1145\/3419614.3423256"},{"key":"e_1_3_2_1_17_1","unstructured":"T-H. Hubert Chan Rafael Pass and Elaine Shi. 2018. PiLi: An Extremely Simple Synchronous Blockchain. Cryptology ePrint Archive Paper 2018\/980. https:\/\/eprint.iacr.org\/2018\/980 https:\/\/eprint.iacr.org\/2018\/980."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294280"},{"key":"e_1_3_2_1_19_1","unstructured":"Cosmos Network Community. 2018. Sentry Nodes - What they are! - How they work! - Why they exist! https:\/\/forum.cosmos.network\/t\/sentry-nodes-what-they-are-how-they-work-why-they-exist\/379. Accessed: 2025-05-25."},{"key":"e_1_3_2_1_20_1","volume-title":"Spanner: Google's Globally-Distributed Database. 251\u2013264","author":"Corbett James C.","year":"2012","unstructured":"James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Christopher Taylor, Ruth Wang, and Dale Woodford. 2012. Spanner: Google's Globally-Distributed Database. 251\u2013264. http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387905"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004","author":"Correia M.","year":"2004","unstructured":"M. Correia, N.F. Neves, and P. Verissimo. 2004. How to tolerate half less one Byzantine nodes in practical distributed systems. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004. 174\u2013183. 10.1109\/RELDIS.2004.1353018"},{"key":"e_1_3_2_1_22_1","unstructured":"Tyler Crain Christopher Natoli and Vincent Gramoli. 2018. Evaluating the Red Belly Blockchain. arXiv:1812.11747 [cs.CR] https:\/\/arxiv.org\/abs\/1812.11747"},{"key":"e_1_3_2_1_23_1","unstructured":"Philip Daian Steven Goldfeder Tyler Kell Yunqi Li Xueyuan Zhao Iddo Bentov Lorenz Breidenbach and Ari Juels. 2019. Flash Boys 2.0: Frontrunning Transaction Reordering and Consensus Instability in Decentralized Exchanges. arXiv:1904.05234 [cs.CR] https:\/\/arxiv.org\/abs\/1904.05234"},{"key":"e_1_3_2_1_24_1","volume-title":"Alberto Sonnino, and Alexander Spiegelman.","author":"Danezis George","year":"2022","unstructured":"George Danezis, Eleftherios Kokoris Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus. arXiv:2105.11827 [cs.CR]"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems. ACM. 10","author":"Decouchant J\u00e9r\u00e9mie","year":"2022","unstructured":"J\u00e9r\u00e9mie Decouchant, David Kozhaya, Vincent Rahli, and Jiangshan Yu. 2022. DAMYSUS: streamlined BFT consensus leveraging trusted components. In Proceedings of the Seventeenth European Conference on Computer Systems. ACM. 10.1145\/3492321.3519568"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Danny Dolev and H. Strong. 1983. Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12 (11 1983) 656\u2013666. 10.1137\/0212045","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843568"},{"key":"e_1_3_2_1_29_1","unstructured":"Matthias Fitzi. 2003. Generalized Communication and Security Models in Byzantine Agreement. Ph.D. Dissertation. ETH Zurich. Reprint as vol. 4 of ETH Series in Information Security and Cryptography ISBN 3\u201389649-853\u20133 Hartung-Gorre Verlag Konstanz 2003."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 1st ACM Conference on Advances in Financial Technologies (2019","author":"Gagol Adam","year":"2019","unstructured":"Adam Gagol, Damian Lesniak, Damian Straszak, and Michal Swietek. 2019. Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes. Proceedings of the 1st ACM Conference on Advances in Financial Technologies (2019). https:\/\/api.semanticscholar.org\/CorpusID:199577506"},{"key":"e_1_3_2_1_31_1","unstructured":"Fangyu Gai Jianyu Niu Ivan Beschastnikh Chen Feng and Sheng Wang. 2022. Scaling Blockchain Consensus via a Robust Shared Mempool. arXiv:2203.05158 [cs.DC] https:\/\/arxiv.org\/abs\/2203.05158"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"Gao Yingzi","year":"2022","unstructured":"Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (Los Angeles, CA, USA) (CCS '22). Association for Computing Machinery, New York, NY, USA, 1187\u20131201. 10.1145\/3548606.3559379"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Rati Gelashvili Lefteris Kokoris-Kogias Alberto Sonnino Alexander Spiegelman and Zhuolun Xiang. 2021. Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","unstructured":"Lisa Glendenning Ivan Beschastnikh Arvind Krishnamurthy and Thomas Anderson. 2011. Scalable Consistency in Scatter. 15\u201328. 10.1145\/2043556.2043559","DOI":"10.1145\/2043556.2043559"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_1_36_1","volume-title":"Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. Cryptology ePrint Archive, Paper 2022\/027. https:\/\/eprint.iacr.org\/2022\/027 https:\/\/eprint.iacr.org\/2022\/027.","author":"Guo Bingyong","year":"2022","unstructured":"Bingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. Cryptology ePrint Archive, Paper 2022\/027. https:\/\/eprint.iacr.org\/2022\/027 https:\/\/eprint.iacr.org\/2022\/027."},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Guo Bingyong","year":"2020","unstructured":"Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster Asynchronous BFT Protocols. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (Virtual Event, USA) (CCS '20). Association for Computing Machinery, New York, NY, USA, 803\u2013818. 10.1145\/3372297.3417262"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978"},{"key":"e_1_3_2_1_39_1","volume-title":"Dissecting BFT Consensus: In Trusted Components we Trust! Proceedings of the Eighteenth European Conference on Computer Systems","author":"Gupta Suyash","year":"2022","unstructured":"Suyash Gupta, Sajjad Rahnama, Shubham Pandey, Natacha Crooks, and Mohammad Sadoghi. 2022. Dissecting BFT Consensus: In Trusted Components we Trust! Proceedings of the Eighteenth European Conference on Computer Systems (2022). https:\/\/api.semanticscholar.org\/CorpusID:246485325"},{"key":"e_1_3_2_1_40_1","unstructured":"Timo Hanke Mahnush Movahedi and Dominic Williams. 2018. DFINITY technology overview series consensus system. arXiv:1805.04548 [cs.DC]."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Dakai Kang Suyash Gupta Dahlia Malkhi and Mohammad Sadoghi. 2025. HotStuff-1: Linear Consensus with One-Phase Speculation. arXiv:2408.04728 [cs.DB] https:\/\/arxiv.org\/abs\/2408.04728","DOI":"10.1145\/3725308"},{"key":"e_1_3_2_1_42_1","volume-title":"26th Annual International Cryptology Conference (Lecture Notes in Computer Science","volume":"462","author":"Katz Jonathan","year":"2006","unstructured":"Jonathan Katz and Chiu-Yuen Koo. 2006. On Expected Constant-Round Protocols for Byzantine Agreement. In Advances in Cryptology - CRYPTO 2006, 26th Annual International Cryptology Conference (Lecture Notes in Computer Science, Vol. 4117). Springer, 445\u2013462. 10.1007\/11818175_27"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Idit Keidar Eleftherios Kokoris-Kogias Oded Naor and Alexander Spiegelman. 2021. All You Need is DAG. arXiv:2102.08325 [cs.DC]","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_2_1_45_1","unstructured":"Klaus Kursawe and Victor Shoup. 2001. Optimistic Asynchronous Atomic Broadcast. Cryptology ePrint Archive Paper 2001\/022. https:\/\/eprint.iacr.org\/2001\/022 https:\/\/eprint.iacr.org\/2001\/022."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_49_1","first-page":"1","article-title":"TrInc: Small Trusted Hardware for Large Distributed Systems","volume":"9","author":"Levin Dave","year":"2009","unstructured":"Dave Levin, John R Douceur, Jacob R Lorch, and Thomas Moscibroda. 2009. TrInc: Small Trusted Hardware for Large Distributed Systems.. In NSDI, Vol. 9. 1\u201314.","journal-title":"NSDI"},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI'16)","author":"Liu Shengyun","year":"2016","unstructured":"Shengyun Liu, Paolo Viotti, Christian Cachin, Vivien Qu\u00e9ma, and Marko Vukolic. 2016. XFT: Practical Fault Tolerance beyond Crashes. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (OSDI'16). USA, 485\u2013500."},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"Lu Yuan","year":"2021","unstructured":"Yuan Lu, Zhenliang Lu, and Qiang Tang. 2021. Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFT. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2021). https:\/\/api.semanticscholar.org\/CorpusID:232257767"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Hanzheng Lyu Shaokang Xie Jianyu Niu and Chen Feng. 2024. Byzantine Protocols with Asymptotically Optimal Communication Complexity. 247\u2013264. \u20133-031\u201364948-6_13 10.1007\/978","DOI":"10.1007\/978"},{"key":"e_1_3_2_1_53_1","volume-title":"Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. IACR Cryptol. ePrint Arch.","author":"Malkhi Dahlia","year":"2023","unstructured":"Dahlia Malkhi and Kartik Nayak. 2023. Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. IACR Cryptol. ePrint Arch. (2023), 397. https:\/\/eprint.iacr.org\/2023\/397"},{"key":"e_1_3_2_1_54_1","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"Miller Andrew","year":"2016","unstructured":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The Honey Badger of BFT Protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (Vienna, Austria) (CCS '16). Association for Computing Machinery, New York, NY, USA, 31\u201342. 10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_55_1","unstructured":"Nenad Milosevic Daniel Cason Zarko Milosevic Robert Soul\u00e9 and Fernando Pedone. 2025. Message Size Matters: AlterBFT's Approach to Practical Synchronous BFT in Public Clouds. arXiv:2503.10292 [cs.DC] https:\/\/arxiv.org\/abs\/2503.10292"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the IEEE Symposium on Reliable Distributed Systems, 61\u201370","author":"Milosevic Zarko","year":"2013","unstructured":"Zarko Milosevic, Martin Biely, and Andr\u00e9 Schiper. 2013. Bounded Delay in Byzantine-Tolerant State Machine Replication. Proceedings of the IEEE Symposium on Reliable Distributed Systems, 61\u201370. 10.1109\/SRDS.2013.15"},{"key":"e_1_3_2_1_57_1","volume-title":"2011 IEEE 30th International Symposium on Reliable Distributed Systems. 235\u2013244","author":"Milosevic Zarko","year":"2011","unstructured":"Zarko Milosevic, Martin Hutle, and Andre Schiper. 2011. On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults. In 2011 IEEE 30th International Symposium on Reliable Distributed Systems. 235\u2013244. 10.1109\/SRDS.2011.36"},{"key":"e_1_3_2_1_58_1","volume-title":"28th International Conference on Principles of Distributed Systems (OPODIS 2024) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"25","author":"Milo\u0161evi\u0107 Nenad","year":"2025","unstructured":"Nenad Milo\u0161evi\u0107, Daniel Cason, Zarko Milo\u0161evi\u0107, and Fernando Pedone. 2025. How Robust Are Synchronous Consensus Protocols?. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 324), Silvia Bonomi, Letterio Galletta, Etienne Rivi\u00e8re, and Valerio Schiavoni (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 20:1\u201320:25. 10.4230\/LIPIcs.OPODIS.2024.20"},{"key":"e_1_3_2_1_59_1","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System. Cryptography Mailing list at https:\/\/metzdowd.com (03","author":"Nakamoto Satoshi","year":"2009","unstructured":"Satoshi Nakamoto. 2009. Bitcoin: A Peer-to-Peer Electronic Cash System. Cryptography Mailing list at https:\/\/metzdowd.com (03 2009)."},{"key":"e_1_3_2_1_60_1","volume-title":"How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems. (08","author":"Neves Nuno","year":"2004","unstructured":"Nuno Neves, Paulo Ver\u00edssimo, Campo Gr, Miguel Correia, Nuno Ferreira, and Neves Ver. 2004. How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems. (08 2004)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978"},{"key":"e_1_3_2_1_62_1","volume-title":"Proceedings of the Tenth European Conference on Computer Systems","author":"Porto Daniel","year":"2015","unstructured":"Daniel Porto, Jo\u00e3o Leit\u00e3o, Cheng Li, Allen Clement, Aniket Kate, Flavio Junqueira, and Rodrigo Rodrigues. 2015. Visigoth Fault Tolerance. In Proceedings of the Tenth European Conference on Computer Systems (Bordeaux, France) (EuroSys '15). Association for Computing Machinery, New York, NY, USA, Article 8, 14 pages. 10.1145\/2741948.2741979"},{"key":"e_1_3_2_1_63_1","volume-title":"Ramasamy and Christian Cachin","author":"Hari Govind","year":"2006","unstructured":"Hari Govind V. Ramasamy and Christian Cachin. 2006. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast. Cryptology ePrint Archive, Paper 2006\/082. https:\/\/eprint.iacr.org\/2006\/082 https:\/\/eprint.iacr.org\/2006\/082."},{"key":"e_1_3_2_1_64_1","first-page":"4","article-title":"Implementing Fault-Tolerant Services Using the State Machine Approach","volume":"22","author":"Schneider F. B.","year":"1990","unstructured":"F. B. Schneider. 1990. Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. Comput. Surveys 22, 4 (Dec. 1990), 299\u2013319.","journal-title":"A Tutorial. Comput. Surveys"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978"},{"key":"e_1_3_2_1_66_1","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"Spiegelman Alexander","year":"2022","unstructured":"Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: DAG BFT Protocols Made Practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (Los Angeles, CA, USA) (CCS '22). Association for Computing Machinery, New York, NY, USA, 2705\u20132718. 10.1145\/3548606.3559361"},{"key":"e_1_3_2_1_67_1","volume-title":"Bullshark: The Partially Synchronous Version. ArXiv abs\/2209.05633","author":"Spiegelman Alexander","year":"2022","unstructured":"Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: The Partially Synchronous Version. ArXiv abs\/2209.05633 (2022). https:\/\/api.semanticscholar.org\/CorpusID:252211739"},{"key":"e_1_3_2_1_68_1","volume-title":"Mir-BFT: High-Throughput BFT for Blockchains. CoRR abs\/1906.05552","author":"Stathakopoulou Chrysoula","year":"2019","unstructured":"Chrysoula Stathakopoulou, Tudor David, and Marko Vukolic. 2019. Mir-BFT: High-Throughput BFT for Blockchains. CoRR abs\/1906.05552 (2019). arXiv:1906.05552 http:\/\/arxiv.org\/abs\/1906.05552"},{"key":"e_1_3_2_1_69_1","volume-title":"Maofan Yin, Hongbo Zhang, and Dahlia Malkhi.","author":"Stathakopoulou Chrysoula","year":"2023","unstructured":"Chrysoula Stathakopoulou, Michael Yung Chung Wei, Maofan Yin, Hongbo Zhang, and Dahlia Malkhi. 2023. BBCA-LEDGER: High Throughput Consensus meets Low Latency. ArXiv abs\/2306.14757 (2023). https:\/\/api.semanticscholar.org\/CorpusID:259252419"},{"key":"e_1_3_2_1_70_1","volume-title":"2019 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE. 10","author":"Tanana Dmitry","year":"2019","unstructured":"Dmitry Tanana. 2019. Avalanche blockchain protocol for distributed computing security. In 2019 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE. 10.1109\/blackseacom.2019.8812863"},{"key":"e_1_3_2_1_71_1","volume-title":"Proceedings [1988] Seventh Symposium on Reliable Distributed Systems","author":"Philip","year":"1988","unstructured":"Philip M. Thambidurai and You-Keun Park. 1988. Interactive consistency with multiple failure modes. Proceedings [1988] Seventh Symposium on Reliable Distributed Systems (1988), 93\u2013100. https:\/\/api.semanticscholar.org\/CorpusID:26823960"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1024739"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/3"},{"key":"e_1_3_2_1_75_1","volume-title":"Proceedings of the 25th International Middleware Conference","author":"Vonlanthen Yann","year":"2024","unstructured":"Yann Vonlanthen, Jakub Sliwinski, Massimo Albarello, and Roger Wattenhofer. 2024. Banyan: Fast Rotating Leader BFT. In Proceedings of the 25th International Middleware Conference (Hong Kong, Hong Kong) (Middleware '24). Association for Computing Machinery, New York, NY, USA, 494\u2013507. 10.1145\/3652892.3700788"},{"key":"e_1_3_2_1_76_1","volume-title":"ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER. https:\/\/api.semanticscholar.org\/CorpusID:4836820","author":"Wood Daniel Davis","year":"2014","unstructured":"Daniel Davis Wood. 2014. ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER. https:\/\/api.semanticscholar.org\/CorpusID:4836820"},{"key":"e_1_3_2_1_77_1","volume-title":"Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies","author":"Yan Xinan","year":"2020","unstructured":"Xinan Yan, Linguan Yang, and Bernard Wong. 2020. Domino: using network measurements to reduce state machine replication latency in WANs. In Proceedings of the 16th International Conference on Emerging Networking EXperiments and Technologies (Barcelona, Spain) (CoNEXT '20). Association for Computing Machinery, New York, NY, USA, 351\u2013363. 10.1145\/3386367.3431291"},{"key":"e_1_3_2_1_78_1","volume-title":"Reiter","author":"Yandamuri Sravya","year":"2021","unstructured":"Sravya Yandamuri, Ittai Abraham, Kartik Nayak, and Michael K. Reiter. 2021. Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption. Cryptology ePrint Archive, Paper 2021\/184. https:\/\/eprint.iacr.org\/2021\/184 https:\/\/eprint.iacr.org\/2021\/184."},{"key":"e_1_3_2_1_79_1","volume-title":"DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Yang Lei","year":"2022","unstructured":"Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). USENIX Association, Renton, WA, 493\u2013512. https:\/\/www.usenix.org\/conference\/nsdi22\/presentation\/yang"},{"key":"e_1_3_2_1_80_1","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC'19)","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC'19). 347\u2013356. 10.1145\/3293611.3331591"}],"event":{"name":"MIDDLEWARE '25: 26th International Middleware Conference","location":"Vanderbilt University Nashville TN USA","acronym":"MIDDLEWARE '25","sponsor":["IFIP","Usenix"]},"container-title":["Proceedings of the 26th International Middleware Conference"],"original-title":[],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T19:58:34Z","timestamp":1765223914000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3721462.3770782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"references-count":80,"alternative-id":["10.1145\/3721462.3770782","10.1145\/3721462"],"URL":"https:\/\/doi.org\/10.1145\/3721462.3770782","relation":{},"subject":[],"published":{"date-parts":[[2025,12,14]]},"assertion":[{"value":"2025-12-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}