{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T05:30:31Z","timestamp":1762579831550,"version":"build-2065373602"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2022YFB2701700"],"award-info":[{"award-number":["2022YFB2701700"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tc.2025.3607476","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:31:21Z","timestamp":1757439081000},"page":"4138-4152","source":"Crossref","is-referenced-by-count":0,"title":["Practical Signature-Free Multivalued Validated Byzantine Agreement and Asynchronous Common Subset in Constant Time"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1665-8398","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"first","affiliation":[{"name":"Institute for Advanced Study, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4889-6737","authenticated-orcid":false,"given":"Xiao","family":"Sui","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1385-6807","authenticated-orcid":false,"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptography and Digital Economy Security, Zhongguancun Laboratory, and Shandong Institute of Blockchain, Tsinghua University, Beijing 1000843, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5865-3408","authenticated-orcid":false,"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yangtze Delta Region Institute of Tsinghua University, Zhejiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"ref2","first-page":"183","article-title":"Asynchronous secure computations with optimal resilience","volume-title":"Proc. PODC","author":"Ben-Or","year":"1994"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611468"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559348"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2684464.2684470"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354238"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/DSN48063.2020.00058"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"ref15","first-page":"5341","article-title":"WaterBear: Practical asynchronous BFT matching security guarantees of partially synchronous BFT","volume-title":"Proc. USENIX Secur.","author":"Zhang","year":"2023"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.07.004"},{"key":"ref17","first-page":"5359","article-title":"Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling","volume-title":"Proc. USENIX Secur.","author":"Das","year":"2023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0083-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3616633"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.153"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh145"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2008.76"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1043"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538475"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2025.3569608"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"ref37","first-page":"2705","article-title":"Bullshark: DAG BFT protocols made practical","volume-title":"Proc. CCS","author":"Giridharan","year":"2022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-78676-1_6"},{"article-title":"Shoal++: High throughput DAG BFT can be fast!","year":"2024","author":"Arun","key":"ref39"},{"article-title":"Mysticeti: Reaching the limits of latency with uncertified DAGs","year":"2023","author":"Babel","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/sp61157.2025.00021"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.031"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0200-5"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/12\/11234919\/11154867.pdf?arnumber=11154867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T05:26:44Z","timestamp":1762579604000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11154867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":47,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.2025.3607476","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}