{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T04:13:08Z","timestamp":1744949588634,"version":"3.40.4"},"reference-count":37,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:00:00Z","timestamp":1736294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["23511100200"],"award-info":[{"award-number":["23511100200"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Key Laboratory of Trusted Data Circulation and Governance and Web3, Shanghai Pilot Program for Basic Research","award":["TQ20240212"],"award-info":[{"award-number":["TQ20240212"]}]},{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission","doi-asserted-by":"publisher","award":["2021-01-07\u201300-08-E00101"],"award-info":[{"award-number":["2021-01-07\u201300-08-E00101"]}],"id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The paper introduces TinyThunder, an asynchronous Byzantine fault tolerance (BFT) protocol designed to minimize communication overhead during inter-node message transmission. Regardless of the original transaction sizes, TinyThunder optimizes the acknowledgment overhead for a transaction to a constant size (e.g. 8 bytes). This optimization is based on a key observation in BFT systems: each transaction is redundantly stored by at least one honest node. Instead of transmitting the original transaction, TinyThunder only needs to send a specific feature value to confirm a transaction, leading to the development of our new compact reliable broadcast protocol. Additionally, we introduce a novel block compensation protocol that ensures the consistency of recovering these feature values and enables TinyThunder to achieve the desirable property of strong validity. The implementation and evaluation of TinyThunder in large-scale wide-area network environments demonstrate its superiority over the well-known HoneyBadgerBFT, with higher throughput (increased by 122%) and lower latency (reduced by 54%). Notably, TinyThunder also exhibits significant bandwidth savings for larger individual transaction sizes. For transactions of 250B in size, TinyThunder reduces bandwidth consumption by 56% compared to HoneyBadgerBFT.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae120","type":"journal-article","created":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T00:01:17Z","timestamp":1736294477000},"page":"407-418","source":"Crossref","is-referenced-by-count":0,"title":["TinyThunder: enabling asynchronous Byzantine fault tolerance with optimal communication efficiency"],"prefix":"10.1093","volume":"68","author":[{"given":"Xiaorui","family":"Chen","sequence":"first","affiliation":[{"name":"School of Software Engineering , East China Normal University, 3663 North Zhongshan Road, Shanghai 200062,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangxue","family":"Li","sequence":"additional","affiliation":[{"name":"School of Software Engineering , East China Normal University, 3663 North Zhongshan Road, Shanghai 200062,","place":["China"]},{"name":"Shanghai Key Laboratory of Trusted Data Circulation and Governance and Web3"},{"name":"China Telecom Quantum Information Technology Group Co. , Ltd"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,1,8]]},"reference":[{"key":"2025041706120733700_ref1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3571335","article-title":"Decentralized finance: on blockchain-and smart contract-based financial markets","volume":"103","author":"Sch\u00e4r","year":"2021","journal-title":"FRB St. Louis Rev"},{"key":"2025041706120733700_ref2","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s00607-020-00900-y","article-title":"The evolution of distributed computing systems: from fundamental to new frontiers","volume":"103","author":"Lindsay","year":"2021","journal-title":"Comput Secur"},{"key":"2025041706120733700_ref3","first-page":"95","article-title":"Monoxide: scale out blockchains with asynchronous consensus zones","volume-title":"16th USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, 26-28 February","author":"Wang","year":"2019"},{"key":"2025041706120733700_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15260-3","volume-title":"Introduction to Reliable and Secure Distributed Programming","author":"Cachin","year":"2011"},{"key":"2025041706120733700_ref5","first-page":"51","article-title":"Invited paper: cross-chain state machine replication","volume-title":"Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, Clermont-Ferrand, France, 15-17 November","author":"Xue","year":"2022"},{"key":"2025041706120733700_ref6","first-page":"368","article-title":"Rethinking state-machine replication for parallelism","volume-title":"IEEE 34th International Conference on Distributed Computing Systems, Madrid, 30 June - 3 July","author":"Marandi","year":"2014"},{"key":"2025041706120733700_ref7","first-page":"31","article-title":"The honey badger of BFT protocols","volume-title":"Proceedings of the 2016 Conference on Computer and Communications Security, Vienna, 24-28 October","author":"Miller","year":"2016"},{"key":"2025041706120733700_ref8","first-page":"803","article-title":"Dumbo: faster asynchronous BFT protocols","volume-title":"2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, 9-13 Novembe","author":"Guo","year":"2020"},{"key":"2025041706120733700_ref9","first-page":"493","article-title":"DispersedLedger: high-throughput Byzantine consensus on variable bandwidth","volume-title":"19th USENIX Symposium on Networked Systems Design and Implementation, Renton, WA, 4-6 April","author":"Yang","year":"2022"},{"key":"2025041706120733700_ref10","first-page":"2028","article-title":"BEAT: asynchronous BFT made practical","volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, 15-19 October","author":"Duan","year":"2018"},{"article-title":"Bitcoin: a peer-to-peer electronic cash system","year":"2008","author":"Satoshi","key":"2025041706120733700_ref11"},{"key":"2025041706120733700_ref12","first-page":"2","article-title":"A next-generation smart contract and decentralized application platform","volume":"3","author":"Buterin","year":"2014","journal-title":"white paper"},{"key":"2025041706120733700_ref13","doi-asserted-by":"publisher","first-page":"3796","DOI":"10.1109\/COMST.2019.2928178","article-title":"A Vademecum on blockchain technologies: when, which, and how","volume":"21","author":"Belotti","year":"2019","journal-title":"IEEE Commun Surv Tutorials"},{"key":"2025041706120733700_ref14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158369","article-title":"Security and privacy on blockchain","volume":"51","author":"Zhang","year":"2019","journal-title":"ACM Comput Surv"},{"key":"2025041706120733700_ref15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J ACM"},{"key":"2025041706120733700_ref16","first-page":"524","article-title":"Secure and efficient asynchronous broadcast protocols","volume-title":"Advances in Cryptology 21st Annual International Cryptology Conference, Santa Barbara, California, 19-23 August","author":"Cachin","year":"2001"},{"key":"2025041706120733700_ref17","first-page":"167","article-title":"Secure intrusion-tolerant replication on the internet","volume-title":"2002 International Conference on Dependable Systems and Networks, Bethesda, MD, 23-26 June","author":"Cachin","year":"2002"},{"key":"2025041706120733700_ref18","first-page":"1041","article-title":"Flexible Byzantine fault tolerance","volume-title":"Proceedings of the 2019 Conference on Computer and Communications Security, London, 11-15 November","author":"Malkhi","year":"2019"},{"key":"2025041706120733700_ref19","first-page":"131","article-title":"Synchronous consensus with optimal asynchronous fallback guarantees","volume-title":"Theory of Cryptography - 17th International Conference, Nuremberg, 1-5 December","author":"Blum","year":"2019"},{"key":"2025041706120733700_ref20","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-32101-7_20","article-title":"Synchronous Byzantine agreement with expected O (1) rounds, expected communication, and optimal resilience","volume-title":"Financial Cryptography and Data Security - 23rd International Conference, Frigate Bay, St. Kitts and Nevis, 18-22 February","author":"Abraham","year":"2019"},{"key":"2025041706120733700_ref21","first-page":"191","article-title":"Asynchronous verifiable information dispersal distributed computing","volume-title":"19th International Conference, Cracow, 26-29 September","author":"Cachin","year":"2005"},{"key":"2025041706120733700_ref22","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans Program Lang Syst"},{"key":"2025041706120733700_ref23","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume-title":"Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation, New Orleans, Louisiana, 22-25 February","author":"Castro","year":"1999"},{"key":"2025041706120733700_ref24","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/3132747.3132757","article-title":"Algorand: scaling Byzantine agreements for cryptocurrencies","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, 28-31 October","author":"Gilad","year":"2017"},{"key":"2025041706120733700_ref25","first-page":"297","article-title":"RBFT: redundant Byzantine fault tolerance","volume-title":"IEEE 33rd International Conference on Distributed Computing Systems, Philadelphia, Pennsylvania, 8-11 July","author":"Aublin","year":"2013"},{"key":"2025041706120733700_ref26","first-page":"1722","article-title":"BFT protocol forensics","volume-title":"2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, 15-19 November","author":"Sheng","year":"2021"},{"key":"2025041706120733700_ref27","first-page":"2","article-title":"Signature-free asynchronous byzantine consensus with t &lt;n\/3 and o(n$^2$) messages","volume-title":"ACM Symposium on Principles of Distributed Computing, Paris, 15-18 July","author":"Most\u00e9faoui","year":"2014"},{"volume-title":"INDOCRYPT 2012, LNCS","key":"2025041706120733700_ref28"},{"key":"2025041706120733700_ref29","first-page":"568","article-title":"SBFT: a scalable and decentralized trust infrastructure","volume-title":"49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, Portland, OR, 24-27 June","author":"Golan-Gueta","year":"2019"},{"key":"2025041706120733700_ref30","first-page":"183","article-title":"Asynchronous secure computations with optimal resilience (extended abstract)","volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, 14-17 August","author":"Ben-Or","year":"1994"},{"year":"1994","author":"Bilenko","key":"2025041706120733700_ref31"},{"year":"2008","author":"Zooko","key":"2025041706120733700_ref32"},{"key":"2025041706120733700_ref33","first-page":"31","article-title":"Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme","volume-title":"Public Key Cryptography 6th International Workshop on Theory and Practice in Public Key Cryptography, Miami, FL, 6-8 January","author":"Boldyreva","year":"2003"},{"key":"2025041706120733700_ref34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","article-title":"Charm: a framework for rapidly prototyping cryptosystems","volume":"3","author":"Akinyele","year":"2012","journal-title":"J Cryptogr Eng"},{"volume-title":"On the Implementation of Pairing-Based Cryptosystems","year":"2007","author":"Lynn","key":"2025041706120733700_ref35"},{"year":"2012","author":"Berry","key":"2025041706120733700_ref36"},{"key":"2025041706120733700_ref37","first-page":"90","article-title":"OHIE: blockchain scaling made simple","volume-title":"2020 IEEE Symposium on Security and Privacy, San Francisco, CA, 18-21 May","author":"Yu","year":"2020"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxae120\/61371118\/bxae120.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxae120\/61371118\/bxae120.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T10:12:33Z","timestamp":1744884753000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/4\/407\/7945155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,8]]},"references-count":37,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,8]]},"published-print":{"date-parts":[[2025,4,12]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae120","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2025,4]]},"published":{"date-parts":[[2025,1,8]]}}}