{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:42:00Z","timestamp":1769856120025,"version":"3.49.0"},"reference-count":55,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272043"],"award-info":[{"award-number":["62272043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Program of Shandong Provincial Natural Science Foundation for the Fundamental Research","award":["ZR2022ZD03"],"award-info":[{"award-number":["ZR2022ZD03"]}]},{"DOI":"10.13039\/501100015973","name":"Yangtze Delta Region Institute of Tsinghua University, Zhejiang","doi-asserted-by":"publisher","award":["LZZLX24F007"],"award-info":[{"award-number":["LZZLX24F007"]}],"id":[{"id":"10.13039\/501100015973","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["M23015"],"award-info":[{"award-number":["M23015"]}]},{"name":"US National Foundation","award":["1915763"],"award-info":[{"award-number":["1915763"]}]},{"name":"US National Foundation","award":["1931714"],"award-info":[{"award-number":["1931714"]}]},{"name":"US National Foundation","award":["2209194"],"award-info":[{"award-number":["2209194"]}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"crossref","award":["HR00112020021"],"award-info":[{"award-number":["HR00112020021"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3592564","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T17:54:21Z","timestamp":1753379661000},"page":"8583-8596","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Byzantine Broadcast From Succinct Erasure Coding Proof System"],"prefix":"10.1109","volume":"20","author":[{"given":"Nicolas","family":"Alhaddad","sequence":"first","affiliation":[{"name":"Faculty of Computing and Data Sciences, Boston University, Boston, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1385-6807","authenticated-orcid":false,"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[{"name":"the Institute for Advanced Study, Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7460-3272","authenticated-orcid":false,"given":"Mayank","family":"Varia","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Data Sciences, Boston University, Boston, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0905-4740","authenticated-orcid":false,"given":"Haochen","family":"Wang","sequence":"additional","affiliation":[{"name":"the Institute for Advanced Study, Tsinghua University, Beijing, China"}]},{"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yangtze Delta Region Institute of Tsinghua University, Jiaxing, Zhejiang, China"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Clique in Go-Ethereum","year":"2021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"ref4","article-title":"Communication and round efficient parallel broadcast protocols","author":"Abraham","year":"2025","journal-title":"Proc. Financial Cryptogr. Data Secur. (FC)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538475"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538476"},{"key":"ref7","article-title":"Succinct erasure coding proof systems","author":"Alhaddad","year":"2022","journal-title":"Cryptol. ePrint Arch."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64331-0_25"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14472-6_6"},{"key":"ref10","article-title":"The espresso sequencing network: Hotshot consensus, tiramisu data-availability, and builder-exchange","author":"Bearer","year":"2024","journal-title":"Cryptol. ePrint Arch."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"ref13","first-page":"81","article-title":"Efficient polynomial commitment schemes for multiple points and polynomials","volume":"2020","author":"Boneh","year":"2020","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806743"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_9"},{"key":"ref24","first-page":"1","article-title":"Every bit counts in consensus","volume-title":"Proc. 37th Int. Symp. Distrib. Comput. (DISC)","author":"Civit"},{"key":"ref25","article-title":"Towards optimal parallel broadcast under a dishonest majority","author":"Collins","year":"2025","journal-title":"Proc.  Financial Cryptogr. Data Secur. (FC)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"ref27","article-title":"PBFT vs proof-of-authority: Applying the CAP theorem to permissioned blockchain","volume-title":"Proc. CEUR Workshop","author":"Angelis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2919285"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3616633"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933082"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00384-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3653445"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294269"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109667"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58734-4_3"},{"key":"ref45","first-page":"235","article-title":"Combining asynchronous and synchronous Byzantine agreement: The best of both worlds","volume":"2018","author":"Loss","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"ref48","first-page":"1","article-title":"Optimal communication complexity of authenticated Byzantine agreement","volume-title":"Proc. DISC","author":"Momose"},{"key":"ref49","first-page":"1","article-title":"Improved extension protocols for Byzantine broadcast and agreement","volume-title":"Proc. DISC","author":"Nayak"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_22"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/32.481515"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15982-4_15"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2024.3515854"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.23120"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11095700.pdf?arnumber=11095700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:14:43Z","timestamp":1755627283000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11095700\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3592564","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}