{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:38:42Z","timestamp":1776983922819,"version":"3.51.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032234469","type":"print"},{"value":"9783032234476","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-23447-6_16","type":"book-chapter","created":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:02:46Z","timestamp":1776981766000},"page":"346-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RdBFT: Faster Asynchronous BFT Protocol Through Random Binary Agreement"],"prefix":"10.1007","author":[{"given":"Chaofeng","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"key":"16_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 2019, pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"16_CR2","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 1983, New York, NY, USA, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, ASIACRYPT 2001, pp. 514\u2013532 (2001)","DOI":"10.1007\/3-540-45682-1_30"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 2001, pp. 524\u2013541 (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"16_CR5","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 2000, New York, NY, USA, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005)","journal-title":"J. Cryptol."},{"key":"16_CR7","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":"16_CR8","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI 1999, USA, pp. 173\u2013186. USENIX Association (1999)"},{"key":"16_CR9","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 2020, pp. 1\u201311 (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Larrea, M., Raynal, M.: DBFT: efficient leaderless byzantine consensus and its application to blockchains. In: 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA), pp.\u00a01\u20138 (2018)","DOI":"10.1109\/NCA.2018.8548057"},{"key":"16_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 2022, New York, NY, USA, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"16_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 2018, New York, NY, USA, pp. 2028\u20132041 (2018)","DOI":"10.1145\/3243734.3243812"},{"issue":"2","key":"16_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":"16_CR14","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":"16_CR15","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: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 1187\u20131201 (2022)","DOI":"10.1145\/3548606.3559379"},{"key":"16_CR16","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 2018, pp. 1179\u20131194 (2018)","DOI":"10.1145\/3243734.3243859"},{"key":"16_CR17","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":"16_CR18","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":"16_CR19","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 2020, New York, NY, USA, pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"issue":"6","key":"16_CR20","doi-asserted-by":"publisher","first-page":"868","DOI":"10.14778\/3380750.3380757","volume":"13","author":"S Gupta","year":"2020","unstructured":"Gupta, S., Rahnama, S., Hellings, J., Sadoghi, M.: ResilientDB: global scale resilient blockchain fabric. Proc. VLDB Endow. 13(6), 868\u2013883 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Hao, G., Wu, J., Mumtaz, S.: Mobile e-health on-demand knowledge sharing with copyright protection: joint blockchain and NFT approach. In: ICC 2023 - IEEE International Conference on Communications, pp. 6193\u20136198 (2023)","DOI":"10.1109\/ICC45041.2023.10278976"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Huang, C., Chen, M., Li, J.: Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Trans. Storage 9(1) (2013)","DOI":"10.1145\/2435204.2435207"},{"key":"16_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109419","volume":"219","author":"K Huang","year":"2022","unstructured":"Huang, K., Hou, R., Zeng, Y.: LWSBFT: leaderless weakly synchronous BFT protocol. Comput. Netw. 219, 109419 (2022)","journal-title":"Comput. Netw."},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"2478","DOI":"10.1109\/TDSC.2023.3308848","volume":"21","author":"MM Jalalzai","year":"2024","unstructured":"Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-hotstuff: a fast and robust BFT protocol for blockchains. IEEE Trans. Dependable Secure Comput. 21(4), 2478\u20132493 (2024)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"16_CR25","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 2021, New York, NY, USA, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"16_CR26","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":"16_CR27","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":"16_CR28","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":"16_CR29","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 2014, pp. 303\u2013312 (2014)","DOI":"10.1145\/2611462.2611498"},{"key":"16_CR30","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":"16_CR31","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 2016, New York, NY, USA, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous byzantine consensus with t < n\/3 and o(n2) messages. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014, pp. 2\u20139 (2014)","DOI":"10.1145\/2611462.2611468"},{"key":"16_CR33","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"issue":"2","key":"16_CR34","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"},{"issue":"3","key":"16_CR35","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1109\/TSC.2023.3296808","volume":"17","author":"T Rabehaja","year":"2024","unstructured":"Rabehaja, T., Pal, S., Hill, A., Hitchens, M.: A blockchain-based approach for parametric insurance under multiple sources of truth. IEEE Trans. Serv. Comput. 17(3), 718\u2013732 (2024)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"issue":"12","key":"16_CR37","doi-asserted-by":"publisher","first-page":"2893","DOI":"10.14778\/3415478.3415502","volume":"13","author":"S Rahnama","year":"2020","unstructured":"Rahnama, S., Gupta, S., Qadah, T.M., Hellings, J., Sadoghi, M.: Scalable, resilient, and configurable permissioned blockchain fabric. Proc. VLDB Endow. 13(12), 2893\u20132896 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR38","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 1994, pp. 68\u201380 (1994)","DOI":"10.1145\/191177.191194"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Practical threshold signatures. In: Proceedings of the 19th International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT 2000, pp. 207\u2013220 (2000)","DOI":"10.1007\/3-540-45539-6_15"},{"issue":"2","key":"16_CR40","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. 15(2), 75\u201396 (2002)","journal-title":"J. Cryptol."},{"issue":"3","key":"16_CR41","doi-asserted-by":"publisher","first-page":"2957","DOI":"10.1109\/TNSM.2023.3246120","volume":"20","author":"N Sivaselvan","year":"2023","unstructured":"Sivaselvan, N., Bhat, K.V., Rajarajan, M., Das, A.K.: A new scalable and secure access control scheme using blockchain technology for IoT. IEEE Trans. Netw. Serv. Manage. 20(3), 2957\u20132974 (2023)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"16_CR42","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 2022, New York, NY, USA, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"16_CR43","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 2019, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"16_CR44","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 2022, New York, NY, USA, pp. 3151\u20133164 (2022)","DOI":"10.1145\/3548606.3559348"},{"issue":"1","key":"16_CR45","first-page":"750","volume":"12","author":"Q Zhang","year":"2025","unstructured":"Zhang, Q., Wang, S., Zhang, D.: Adaptive access and tracking method for supply chain data based on sharding blockchain. IEEE Internet Things J. 12(1), 750\u2013763 (2025)","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"16_CR46","first-page":"60","volume":"4","author":"C Zhao","year":"2018","unstructured":"Zhao, C., He, J., Chen, J.: Resilient consensus with mobile detectors against malicious attacks. IEEE Trans. Signal Inf. Process. Netw. 4(1), 60\u201369 (2018)","journal-title":"IEEE Trans. Signal Inf. Process. Netw."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23447-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:02:51Z","timestamp":1776981771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23447-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032234469","9783032234476"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23447-6_16","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiangtan","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":"4 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}