{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:59:50Z","timestamp":1773269990106,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562022","type":"print"},{"value":"9789819562039","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-981-95-6203-9_22","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:26:19Z","timestamp":1767320779000},"page":"410-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LSDBFT: A Loose DAG-Based Asynchronous BFT Consensus Algorithm with\u00a0Fair Ordering"],"prefix":"10.1007","author":[{"given":"Chaofeng","family":"Zhuang","sequence":"first","affiliation":[]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"22_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":"22_CR2","unstructured":"Antonopoulos, A.M., Wood, G.: Mastering Ethereum: Building Smart Contracts and Dapps. O\u2019reilly Media (2018)"},{"key":"22_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 1983, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"22_CR4","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":"22_CR5","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on bft consensus. arXiv preprint arXiv:1807.04938 (2018)"},{"key":"22_CR6","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. Springer, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"22_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 2000, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"issue":"3","key":"22_CR8","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":"22_CR9","doi-asserted-by":"publisher","first-page":"7508","DOI":"10.1109\/TIFS.2024.3409082","volume":"19","author":"X Dai","year":"2024","unstructured":"Dai, X., et al.: Wahoo: a dag-based bft consensus with low latency and low communication overhead. IEEE Trans. Inf. Forensics Secur. 19, 7508\u20137522 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"22_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: Proceedings of the Seventeenth European Conference on Computer Systems, EuroSys 2022, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"issue":"21","key":"22_CR11","doi-asserted-by":"publisher","first-page":"18961","DOI":"10.1109\/JIOT.2023.3277923","volume":"10","author":"D Das","year":"2023","unstructured":"Das, D., Banerjee, S., Chatterjee, P., Ghosh, U., Biswas, U.: Blockchain for intelligent transportation systems: applications, challenges, and opportunities. IEEE Internet Things J. 10(21), 18961\u201318970 (2023)","journal-title":"IEEE Internet Things J."},{"key":"22_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, pp. 2028\u20132041 (2018)","DOI":"10.1145\/3243734.3243812"},{"issue":"9","key":"22_CR13","doi-asserted-by":"publisher","first-page":"15842","DOI":"10.1109\/JIOT.2024.3351908","volume":"11","author":"H Dui","year":"2024","unstructured":"Dui, H., Zhang, S., Liu, M., Dong, X., Bai, G.: Iot-enabled real-time traffic monitoring and control management for intelligent transportation systems. IEEE Internet Things J. 11(9), 15842\u201315854 (2024)","journal-title":"IEEE Internet Things J."},{"key":"22_CR14","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":"22_CR15","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":"22_CR16","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":"22_CR17","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, pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"key":"22_CR18","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":"22_CR19","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, pp. 165\u2013175 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"22_CR20","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":"22_CR21","doi-asserted-by":"publisher","first-page":"3178","DOI":"10.1109\/TIFS.2024.3358990","volume":"19","author":"A Liu","year":"2024","unstructured":"Liu, A., et al.: Cherubim: a secure and highly parallel cross-shard consensus using quadruple pipelined two-phase commit for sharding blockchains. IEEE Trans. Inf. Forensics Secur. 19, 3178\u20133193 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"22_CR22","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":"22_CR23","doi-asserted-by":"publisher","first-page":"2276","DOI":"10.1109\/TIFS.2023.3266628","volume":"18","author":"Y Liu","year":"2023","unstructured":"Liu, Y., et al.: A flexible sharding blockchain protocol based on cross-shard byzantine fault tolerance. IEEE Trans. Inf. Forensics Secur. 18, 2276\u20132291 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"22_CR24","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, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"22_CR25","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":"22_CR26","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"103884","DOI":"10.1016\/j.jnca.2024.103884","volume":"226","author":"T Nguyen","year":"2024","unstructured":"Nguyen, T., Nguyen, H., Nguyen Gia, T.: Exploring the integration of edge computing and blockchain iot: principles, architectures, security, and applications. J. Netw. Comput. Appl. 226, 103884 (2024)","journal-title":"J. Netw. Comput. Appl."},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"103714","DOI":"10.1016\/j.adhoc.2024.103714","volume":"168","author":"A Pagano","year":"2025","unstructured":"Pagano, A., et al.: A survey on massive iot for water distribution systems: challenges, simulation tools, and guidelines for large-scale deployment. Ad Hoc Netw. 168, 103714 (2025)","journal-title":"Ad Hoc Netw."},{"key":"22_CR29","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"},{"key":"22_CR30","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":"22_CR31","doi-asserted-by":"crossref","unstructured":"Schett, M.A., Danezis, G.: Embedding a deterministic bft protocol in a block dag. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC 2021, pp. 177\u2013186. ACM, New York, NY, USA (2021)","DOI":"10.1145\/3465084.3467930"},{"key":"22_CR32","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":"22_CR33","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."},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Shrestha, N., Shrothrium, R., Kate, A., Nayak, K.: Sailfish: towards improving the Latency of DAG-based BFT . In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 21\u201321, May 2025","DOI":"10.1109\/SP61157.2025.00021"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Arun, B., Gelashvili, R., Li, Z.: Shoal: improving dag-bft latency and robustness. In: Financial Cryptography and Data Security, pp. 92\u2013109. Cham (2025)","DOI":"10.1007\/978-3-031-78676-1_6"},{"key":"22_CR36","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, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"22_CR37","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, pp. 3151\u20133164 (2022)","DOI":"10.1145\/3548606.3559348"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6203-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:37:57Z","timestamp":1773214677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6203-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562022","9789819562039"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6203-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 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":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}