{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T17:51:40Z","timestamp":1776275500511,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472185"],"award-info":[{"award-number":["62472185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3607262","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T17:43:39Z","timestamp":1757353419000},"page":"9792-9805","source":"Crossref","is-referenced-by-count":2,"title":["PlainDAG: A Low-Latency Asynchronous DAG BFT Protocol With Best-Effort Broadcast"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1765-5930","authenticated-orcid":false,"given":"Yifan","family":"Zhou","sequence":"first","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System, the Services Computing Technology and System Laboratory, the Cluster and Grid Computing Laboratory, and the School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4216-0497","authenticated-orcid":false,"given":"Jiang","family":"Xiao","sequence":"additional","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System, the Services Computing Technology and System Laboratory, the Cluster and Grid Computing Laboratory, and the School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7822-4512","authenticated-orcid":false,"given":"Xiaohai","family":"Dai","sequence":"additional","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System, the Services Computing Technology and System Laboratory, the Cluster and Grid Computing Laboratory, and the School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3934-7605","authenticated-orcid":false,"given":"Hai","family":"Jin","sequence":"additional","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System, the Services Computing Technology and System Laboratory, the Cluster and Grid Computing Laboratory, and the School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"A Next-Generation Smart Contract and Decentralized Application Platform","author":"Wood","year":"2014"},{"key":"ref2","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System","author":"Nakamoto","year":"2008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3183-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-021-3362-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3526049"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623101"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623191"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS60354.2023.00020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00093"},{"key":"ref17","article-title":"Shoal: Improving DAG-BFT latency and robustness","author":"Spiegelman","year":"2023","journal-title":"arXiv:2306.03058"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"ref21","article-title":"Mysticeti: Low-latency DAG consensus with fast commit path","author":"Babel","year":"2023","journal-title":"arXiv:2310.14821"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3694715.3695942"},{"key":"ref23","article-title":"BBCA-CHAIN: One-message, low latency BFT consensus on a DAG","author":"Malkhi","year":"2023","journal-title":"arXiv:2310.06335"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref28","first-page":"493","article-title":"DispersedLedger: High-throughput Byzantine consensus on variable bandwidth networks","volume-title":"Proc. 19th USENIX Symp. Netw. Syst. Design Implement.","author":"Yang"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3516541"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"ref34","first-page":"1","article-title":"Good-case and bad-case latency of unauthenticated Byzantine broadcast: A complete categorization","volume-title":"Proc. 25th Int. Conf. Princ. Distrib. Syst. (OPODIS\u2019 21)","author":"Abraham"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1142\/s0129626416500171"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467924"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582736"},{"key":"ref38","article-title":"MiB: Asynchronous BFT with more replicas","author":"Liu","year":"2021","journal-title":"arXiv:2108.04488"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11153754.pdf?arnumber=11153754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T13:06:15Z","timestamp":1759237575000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11153754\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3607262","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}