{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T22:41:33Z","timestamp":1761000093325,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819535422"},{"type":"electronic","value":"9789819535439"}],"license":[{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-3543-9_3","type":"book-chapter","created":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T11:03:20Z","timestamp":1760871800000},"page":"39-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TraceBFT: Backtracking-Based Pipelined Asynchronous BFT Consensus for\u00a0High-Throughput Distributed Systems"],"prefix":"10.1007","author":[{"given":"Chaofeng","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqing","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhili","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,20]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC \u201919, pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"3_CR2","unstructured":"Antonopoulos, A.M., Wood, G.: Mastering Ethereum: Building Smart Contracts and Dapps. O\u2019reilly Media, Newton (2018)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, PODC \u201983, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201994, pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"key":"3_CR5","unstructured":"Buterin, V., et\u00a0al.: A next-generation smart contract and decentralized application platform. White Paper 3(37), 2\u20131 (2014)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201900, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C., Mi\u0107i\u0107, J., Steinhauer, N., Zanolini, L.: Quick order fairness. In: Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, 2\u20136 May 2022, Revised Selected Papers, pp. 316\u2013333 (2022)","DOI":"10.1007\/978-3-031-18283-9_15"},{"key":"3_CR9","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI \u201999, pp. 173\u2013186. USENIX Association (1999)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Chan, B.Y., Shi, E.: Streamlet: textbook streamlined blockchains. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, AFT \u201920, pp. 1\u201311 (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"3_CR11","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: Proceedings of the Seventeenth European Conference on Computer Systems, EuroSys \u201922, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: Beat: asynchronous bft made practical. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, pp. 2028\u20132041 (2018)","DOI":"10.1145\/3243734.3243812"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.future.2021.04.020","volume":"124","author":"Y Fan","year":"2021","unstructured":"Fan, Y., Wu, H., Paik, H.Y.: Dr-bft: a consensus algorithm for blockchain-based multi-layer data integrity framework in dynamic edge computing system. Futur. Gener. Comput. Syst. 124, 33\u201348 (2021)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"23","key":"3_CR15","doi-asserted-by":"publisher","first-page":"23200","DOI":"10.1109\/JSEN.2022.3215152","volume":"22","author":"M Feng","year":"2022","unstructured":"Feng, M., Zheng, J., He, S., Xie, J., Chen, Y.: Crbft: an optimized blockchain algorithm for edge-based iot system. IEEE Sens. J. 22(23), 23200\u201323208 (2022)","journal-title":"IEEE Sens. J."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ecdsa with fast trustless setup. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201918, pp. 1179\u20131194 (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Golan\u00a0Gueta, G., et al.: Sbft: a scalable and decentralized trust infrastructure. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580 (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"3_CR19","first-page":"27","volume":"2022","author":"B Guo","year":"2022","unstructured":"Guo, B., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Speeding dumbo: pushing asynchronous bft closer to practice. IACR Cryptol. ePrint Arch. 2022, 27 (2022)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"3_CR20","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, CCS \u201920, pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is dag. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC\u201921, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kihlstrom, K., Moser, L., Melliar-Smith, P.: The securering protocols for securing group communication. In: Proceedings of the Thirty-First Hawaii International Conference on System Sciences, vol.\u00a03, pp. 317\u2013326 (1998)","DOI":"10.1109\/HICSS.1998.656294"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4) (2010)","DOI":"10.1145\/1658357.1658358"},{"issue":"3","key":"3_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. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC \u201914, pp. 303\u2013312 (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Liu, C., Duan, S., Zhang, H.: Epic: efficient asynchronous bft with adaptive security. In: 2020 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 437\u2013451 (2020)","DOI":"10.1109\/DSN48063.2020.00058"},{"key":"3_CR27","unstructured":"Loss, J., Moran, T.: Combining asynchronous and synchronous byzantine agreement: the best of both worlds. Cryptology ePrint Archive, Paper 2018\/235 (2018)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC \u201920, pp. 129\u2013138 (2020)","DOI":"10.1145\/3382734.3405707"},{"key":"3_CR29","unstructured":"MacBrough, E.: Cobalt: Bft governance in open networks. ArXiv arxiv:1802.07240 (2018)"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of bft protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201916, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"issue":"2","key":"3_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Reiter, M.K.: Secure agreement protocols: reliable and atomic group multicast in rampart. In: Proceedings of the 2nd ACM Conference on Computer and Communications Security, CCS \u201994, pp. 68\u201380 (1994)","DOI":"10.1145\/191177.191194"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: dag bft protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"3_CR35","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: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC \u201919, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/9952218","volume":"2021","author":"X Yuan","year":"2021","unstructured":"Yuan, X., Luo, F., Haider, M.Z., Chen, Z., Li, Y., Ning, Z.: Efficient byzantine consensus mechanism based on reputation in iot blockchain. Wirel. Commun. Mob. Comput. 2021, 1\u201314 (2021)","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, G., et al.: Reaching consensus in the byzantine empire: a comprehensive review of bft consensus algorithms. ACM Comput. Surv. 56(5) (2024)","DOI":"10.1145\/3636553"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Zhang, H., Duan, S.: Pace: fully parallelizable bft from reproposable byzantine agreement. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, pp. 3151\u20133164 (2022)","DOI":"10.1145\/3548606.3559348"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3543-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T22:03:59Z","timestamp":1760997839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3543-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,20]]},"ISBN":["9789819535422","9789819535439"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3543-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,20]]},"assertion":[{"value":"20 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"29 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}