{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:49:09Z","timestamp":1777060149158,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819690947","type":"print"},{"value":"9789819690954","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-9095-4_18","type":"book-chapter","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T10:39:12Z","timestamp":1751884752000},"page":"351-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Walnut: A Generic Framework with\u00a0Enhanced Scalability for\u00a0BFT Protocols"],"prefix":"10.1007","author":[{"given":"Lei","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenke","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingchao","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunmiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"18_CR1","unstructured":"Bitcoin: A peer-to-peer electronic cash system"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chan, T.H., Dolev, D., Nayak, K., Pass, R., Ren, L., Shi, E.: Communication complexity of byzantine agreement, revisited. In: PODC, pp. 317\u2013326 (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Berger, C., et al.: Sok: scalability techniques for BFT consensus. In: 2023 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 1\u201318. IEEE (2023)","DOI":"10.1109\/ICBC56567.2023.10174976"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bhangale, A., Liu-Zhang, C., Loss, J., Nayak, K.: Efficient adaptively-secure byzantine agreement for long messages. In: ASIACRYPT, pp. 504\u2013525","DOI":"10.1007\/978-3-031-22963-3_17"},{"key":"18_CR5","unstructured":"Buchman, E.: Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. thesis, University of Guelph (2016)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Drijvers, M., Hanke, T., Pignolet, Y.A., Shoup, V., Williams, D.: Internet computer consensus. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, pp. 81\u201391 (2022)","DOI":"10.1145\/3519270.3538430"},{"key":"18_CR7","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173\u2013186. USENIX Association (1999)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.H.H., Pass, R., Shi, E.: Sublinear-round byzantine agreement under corrupt majority. In: PKC, pp. 246\u2013265. Springer (2020)","DOI":"10.1007\/978-3-030-45388-6_9"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 493\u2013507 (1952)","DOI":"10.1214\/aoms\/1177729330"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: EuroSys, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Duan, S., Zhang, H.: Foundations of dynamic BFT. In: S &P, pp. 1317\u20131334 (2022)","DOI":"10.1109\/SP46214.2022.9833787"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo-ng: Fast asynchronous BFT consensus with throughput-oblivious latency. In: CCS, pp. 1187\u20131201 (2022)","DOI":"10.1145\/3548606.3559379"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: SOSP, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Gueta, G.G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: DSN, pp. 568\u2013580. IEEE (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, S., Rahnama, S., Hellings, J., Sadoghi, M.: Resilientdb: global scale resilient blockchain fabric. Proc. VLDB Endowment 13(6)","DOI":"10.14778\/3380750.3380757"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: FOCS, pp. 565\u2013574. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Kelkar, M., Deb, S., Long, S., Juels, A., Kannan, S.: Themis: Fast, strong order-fairness in byzantine consensus. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 475\u2013489 (2023)","DOI":"10.1145\/3576915.3616658"},{"issue":"4","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1989727.1989732","volume":"58","author":"V King","year":"2011","unstructured":"King, V., Saia, J.: Breaking the $$O(n^2)$$ bit barrier: scalable byzantine agreement with an adaptive adversary. JACM 58(4), 1\u201324 (2011)","journal-title":"JACM"},{"key":"18_CR20","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 279\u2013296 (2016)"},{"key":"18_CR21","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: USENIX Security, pp. 279\u2013296 (2016)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., Ford, B.: Omniledger: A secure, scale-out, decentralized ledger via sharding. In: S &P, pp. 583\u2013598. IEEE (2018)","DOI":"10.1109\/SP.2018.000-5"},{"key":"18_CR23","first-page":"1","volume":"27","author":"J Kwon","year":"2019","unstructured":"Kwon, J., Buchman, E.: Cosmos whitepaper. Netw. Distrib. Ledgers 27, 1\u201332 (2019)","journal-title":"Netw. Distrib. Ledgers"},{"issue":"3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. TOPLAS 4(3), 382\u2013401 (1982)","journal-title":"TOPLAS"},{"key":"18_CR25","unstructured":"Libra: An introduction to libra, pp. 1\u201312 (2019)"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Y., et al.: Kronos: A secure and generic sharding blockchain consensus with optimized overhead. Cryptology ePrint Archive, Paper 2024\/206 (2024). to appear at NDSS 2025","DOI":"10.14722\/ndss.2025.230472"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., Saxena, P.: A secure sharding protocol for open blockchains. In: CCS, pp. 17\u201330 (2016)","DOI":"10.1145\/2976749.2978389"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: FOCS, pp. 120\u2013130. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Constant latency in sleepy consensus. In: Proceedings of the 2022 ACM CCS, pp. 2295\u20132308 (2022)","DOI":"10.1145\/3548606.3559347"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Mu, K., Yin, B., Asheralieva, A., Wei, X.: Separation is good: a faster order-fairness byzantine consensus. In: 31st Annual Network and Distributed System Security Symposium, NDSS. The Internet Society (2024)","DOI":"10.14722\/ndss.2024.24693"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Neiheiser, R., Matos, M., Rodrigues, L.: Kauri: Scalable BFT consensus with pipelined tree-based dissemination and aggregation. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 35\u201348 (2021)","DOI":"10.1145\/3477132.3483584"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: Thunderella: Blockchains with optimistic instant confirmation. In: EUROCRYPT, pp. 3\u201333. Springer (2018)","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C., David, T., Pavlovic, M., Vukoli\u0107, M.: [mir-bft: scalable and robust BFT for decentralized networks. J. Syst. Res. 2(1) (2022)","DOI":"10.5070\/SR32159278"},{"key":"18_CR34","unstructured":"Wang, X., Wang, H., Zhang, H., Duan, S.: Pando: extremely scalable BFT based on committee sampling. Cryptology ePrint Archive, Paper 2024\/664 (2024). https:\/\/eprint.iacr.org\/2024\/664"},{"key":"18_CR35","unstructured":"Wood, G., et al.: Ethereum: A secure decentralised generalised transaction ledger. Ethereum Proj. Yellow Pap. 151(2014), 1\u201332 (2014)"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: PODC, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Zamani, M., Movahedi, M., Raykova, M.: Rapidchain: Scaling blockchain via full sharding. In: CCS, pp. 931\u2013948 (2018)","DOI":"10.1145\/3243734.3243853"},{"issue":"3","key":"18_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s12083-025-01934-9","volume":"18","author":"Z Zhang","year":"2025","unstructured":"Zhang, Z., Hu, B., Tian, L., Zhou, Y., Liu, J.: Efficient dynamic-committee BFT consensus based on HotStuff. Peer-to-Peer Netw. Appl. 18(3), 111 (2025)","journal-title":"Peer-to-Peer Netw. Appl."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9095-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:22:53Z","timestamp":1777058573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9095-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819690947","9789819690954"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9095-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}