{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T12:07:36Z","timestamp":1779365256083,"version":"3.53.0"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Guangdong Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004761","name":"Hainan Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.comnet.2026.112368","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:34:15Z","timestamp":1778168055000},"page":"112368","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["EbbFlow: Non-blocking join synchronization in dynamic asynchronous BFT"],"prefix":"10.1016","volume":"284","author":[{"given":"Zhicong","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7386-8706","authenticated-orcid":false,"given":"Qi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4828-9221","authenticated-orcid":false,"given":"Libo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lishan","family":"Ke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2026.112368_b1","doi-asserted-by":"crossref","first-page":"3952","DOI":"10.1109\/TCOMM.2026.3658364","article-title":"SFTRAP: Satisfying fidelity threshold routing and adaptive purification for throughput maximum in quantum network","volume":"74","author":"Wang","year":"2026","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.comnet.2026.112368_b2","series-title":"A unified metric architecture for ai infrastructure: A cross-layer taxonomy integrating performance, efficiency, and cost","author":"He","year":"2025"},{"issue":"4","key":"10.1016\/j.comnet.2026.112368_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2026.104618","article-title":"GRAIN: Gravity-resistance adaptive framework for identifying influential nodes using multi-order structural diversity","volume":"63","author":"Ruan","year":"2026","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.comnet.2026.112368_b4","article-title":"Dnsgreen: A comprehensive defense system against bounce-style DNS ddos attacks with P4","author":"Tang","year":"2025","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2026.112368_b5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Kelmer, T. Rabin, Asynchronous secure computations with optimal resilience, in: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994, pp. 183\u2013192.","DOI":"10.1145\/197917.198088"},{"key":"10.1016\/j.comnet.2026.112368_b6","article-title":"Improved dynamic Byzantine fault tolerant consensus mechanism","volume":"226","author":"Tang","year":"2024","journal-title":"Comput. Commun."},{"key":"10.1016\/j.comnet.2026.112368_b7","series-title":"2022 IEEE Symposium on Security and Privacy","first-page":"1317","article-title":"Foundations of dynamic BFT","author":"Duan","year":"2022"},{"key":"10.1016\/j.comnet.2026.112368_b8","doi-asserted-by":"crossref","first-page":"5588","DOI":"10.1109\/TIFS.2025.3573205","article-title":"Turritopsis: Practical dynamic asynchronous BFT","volume":"20","author":"Gao","year":"2025","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112368_b9","doi-asserted-by":"crossref","unstructured":"H. Zhang, S. Duan, Pace: Fully parallelizable bft from reproposable byzantine agreement, in: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 3151\u20133164.","DOI":"10.1145\/3548606.3559348"},{"key":"10.1016\/j.comnet.2026.112368_b10","doi-asserted-by":"crossref","unstructured":"S. Duan, X. Wang, H. Zhang, Fin: Practical signature-free asynchronous common subset in constant time, in: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023, pp. 815\u2013829.","DOI":"10.1145\/3576915.3616633"},{"key":"10.1016\/j.comnet.2026.112368_b11","doi-asserted-by":"crossref","unstructured":"A. Miller, Y. Xia, K. Croman, E. Shi, D. Song, The honey badger of BFT protocols, in: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016, pp. 31\u201342.","DOI":"10.1145\/2976749.2978399"},{"key":"10.1016\/j.comnet.2026.112368_b12","doi-asserted-by":"crossref","unstructured":"B. Guo, Z. Lu, Q. Tang, J. Xu, Z. Zhang, Dumbo: Faster asynchronous bft protocols, in: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020, pp. 803\u2013818.","DOI":"10.1145\/3372297.3417262"},{"key":"10.1016\/j.comnet.2026.112368_b13","unstructured":"L. Yang, S.J. Park, M. Alizadeh, S. Kannan, D. Tse, DispersedLedger:High-Throughput byzantine consensus on variable bandwidth networks, in: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), 2022, pp. 493\u2013512."},{"key":"10.1016\/j.comnet.2026.112368_b14","series-title":"Concurrency: The Works of Leslie Lamport","first-page":"277","article-title":"The part-time parliament","author":"Lamport","year":"2019"},{"key":"10.1016\/j.comnet.2026.112368_b15","series-title":"2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks","first-page":"355","article-title":"State machine replication for the masses with BFT-SMART","author":"Bessani","year":"2014"},{"key":"10.1016\/j.comnet.2026.112368_b16","series-title":"2025 IEEE 45th International Conference on Distributed Computing Systems","first-page":"78","article-title":"Asynchronous dynamic committee proactive secret sharing for large data","author":"Lu","year":"2025"},{"key":"10.1016\/j.comnet.2026.112368_b17","article-title":"Dycaps: Asynchronous dynamic-committee proactive secret sharing","author":"Zhang","year":"2025","journal-title":"Chin. J. Electron."},{"key":"10.1016\/j.comnet.2026.112368_b18","unstructured":"H. Zhang, S. Duan, B. Zhao, L. Zhu, WaterBear: Practical Asynchronous BFT Matching Security Guarantees of Partially Synchronous BFT, in: 32nd USENIX Security Symposium (USENIX Security 23), 2023, pp. 5341\u20135357."},{"key":"10.1016\/j.comnet.2026.112368_b19","doi-asserted-by":"crossref","first-page":"4534","DOI":"10.1109\/TIFS.2024.3382602","article-title":"Sweeper: Breaking the validity-latency tradeoff in asynchronous common subset","volume":"19","author":"Yang","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112368_b20","unstructured":"D.S. Antunes, A.N. Oliveira, A. Breda, M.G. Franco, H. Moniz, R. Rodrigues, Alea-BFT: practical asynchronous byzantine fault tolerance, in: 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24), 2024, pp. 313\u2013328."},{"key":"10.1016\/j.comnet.2026.112368_b21","doi-asserted-by":"crossref","DOI":"10.1109\/TDSC.2025.3569608","article-title":"JUMBO: Fully asynchronous BFT consensus made truly scalable","author":"Cheng","year":"2025","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"10.1016\/j.comnet.2026.112368_b22","doi-asserted-by":"crossref","unstructured":"G. Danezis, L. Kokoris-Kogias, A. Sonnino, A. Spiegelman, Narwhal and tusk: a dag-based mempool and efficient bft consensus, in: Proceedings of the Seventeenth European Conference on Computer Systems, 2022, pp. 34\u201350.","DOI":"10.1145\/3492321.3519594"},{"key":"10.1016\/j.comnet.2026.112368_b23","doi-asserted-by":"crossref","unstructured":"A. Spiegelman, N. Giridharan, A. Sonnino, L. Kokoris-Kogias, Bullshark: Dag bft protocols made practical, in: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 2705\u20132718.","DOI":"10.1145\/3548606.3559361"},{"key":"10.1016\/j.comnet.2026.112368_b24","doi-asserted-by":"crossref","unstructured":"K. Babel, A. Chursin, G. Danezis, A. Kichidis, L. Kokoris-Kogias, A. Koshy, A. Sonnino, M. Tian, MYSTICETI: Reaching the Latency Limits with Uncertified DAGs, in: Network and Distributed Systems Security Symposium, NDSS, 2025.","DOI":"10.14722\/ndss.2025.240929"},{"key":"10.1016\/j.comnet.2026.112368_b25","doi-asserted-by":"crossref","unstructured":"A. Most\u00e9faoui, H. Moumen, M. Raynal, 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, 2014, pp. 2\u20139.","DOI":"10.1145\/2611462.2611468"},{"key":"10.1016\/j.comnet.2026.112368_b26","doi-asserted-by":"crossref","unstructured":"X. Dai, B. Zhang, H. Jin, L. Ren, Parbft: Faster asynchronous bft consensus with a parallel optimistic path, in: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023, pp. 504\u2013518.","DOI":"10.1145\/3576915.3623101"},{"key":"10.1016\/j.comnet.2026.112368_b27","doi-asserted-by":"crossref","unstructured":"Y. Lu, Z. Lu, Q. Tang, Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft, in: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 2159\u20132173.","DOI":"10.1145\/3548606.3559346"},{"key":"10.1016\/j.comnet.2026.112368_b28","unstructured":"M. Li, Q. Wu, Z. Wang, B. Qin, B. Wei, H. Ruan, S. Xiong, Z. Ding, {TockOwl}: Asynchronous Consensus with Fault and Network Adaptability, in: 34th USENIX Security Symposium (USENIX Security 25), 2025, pp. 4167\u20134186."},{"key":"10.1016\/j.comnet.2026.112368_b29","series-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","first-page":"271","article-title":"LT codes","author":"Luby","year":"2002"},{"issue":"8","key":"10.1016\/j.comnet.2026.112368_b30","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1109\/JSAC.2002.803996","article-title":"A digital fountain approach to asynchronous reliable multicast","volume":"20","author":"Byers","year":"2002","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"6","key":"10.1016\/j.comnet.2026.112368_b31","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","article-title":"Raptor codes","volume":"52","author":"Shokrollahi","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.comnet.2026.112368_b32","doi-asserted-by":"crossref","unstructured":"M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, Raptor Forward Error Correction Scheme for Object Delivery, Technical Report., 2007.","DOI":"10.17487\/rfc5053"},{"issue":"2","key":"10.1016\/j.comnet.2026.112368_b33","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/LCOMM.2020.3023074","article-title":"Reliable broadcast based on online fountain codes","volume":"25","author":"Huang","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.comnet.2026.112368_b34","doi-asserted-by":"crossref","DOI":"10.1109\/ACCESS.2023.3315659","article-title":"Application of fountain code to high-rate delay tolerant networks","author":"Douglass","year":"2023","journal-title":"IEEE Access"},{"issue":"15","key":"10.1016\/j.comnet.2026.112368_b35","doi-asserted-by":"crossref","first-page":"16794","DOI":"10.1007\/s11227-022-04536-x","article-title":"A data distribution scheme for VANET based on fountain code","volume":"78","author":"Liu","year":"2022","journal-title":"J. Supercomput."},{"issue":"8","key":"10.1016\/j.comnet.2026.112368_b36","doi-asserted-by":"crossref","first-page":"7114","DOI":"10.1109\/JIOT.2022.3229405","article-title":"Fountain codes for reliable and deterministic packet transmission in industrial cloud control systems","volume":"10","author":"Yuan","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.comnet.2026.112368_b37","series-title":"IEEE INFOCOM 2024-IEEE Conference on Computer Communications","first-page":"1","article-title":"Crackle: A fast sector-based BFT consensus with sublinear communication complexity","author":"Xu","year":"2024"},{"issue":"3","key":"10.1016\/j.comnet.2026.112368_b38","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/1085126.1085127","article-title":"APSS: Proactive secret sharing in asynchronous systems","volume":"8","author":"Zhou","year":"2005","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"10.1016\/j.comnet.2026.112368_b39","doi-asserted-by":"crossref","unstructured":"G. Bracha, An asynchronous [(n-1)\/3]-resilient consensus protocol, in: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 154\u2013162.","DOI":"10.1145\/800222.806743"},{"key":"10.1016\/j.comnet.2026.112368_b40","series-title":"European Symposium on Research in Computer Security","first-page":"314","article-title":"Efficient and secure sleepy model for BFT consensus","author":"Ren","year":"2025"},{"key":"10.1016\/j.comnet.2026.112368_b41","series-title":"29th Annual Network and Distributed System Security Symposium, NDSS 2022","article-title":"Speeding dumbo: Pushing asynchronous BFT closer to practice","author":"Guo","year":"2022"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003804?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626003804?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T11:32:49Z","timestamp":1779363169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626003804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":41,"alternative-id":["S1389128626003804"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112368","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"EbbFlow: Non-blocking join synchronization in dynamic asynchronous BFT","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112368","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112368"}}