{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T01:42:20Z","timestamp":1783129340284,"version":"3.54.6"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005698","name":"University of Edinburgh","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005698","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1109\/tc.2023.3296916","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T17:24:14Z","timestamp":1691774654000},"page":"3354-3369","source":"Crossref","is-referenced-by-count":15,"title":["ParBFT: An Optimized Byzantine Consensus Parallelism Scheme"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-507X","authenticated-orcid":false,"given":"Xiao","family":"Chen","sequence":"first","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0526-661X","authenticated-orcid":false,"given":"Btissam","family":"Er-Rahmadi","sequence":"additional","affiliation":[{"name":"Edinburgh Research Centre, Huawei Technologies, Edinburgh, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5545-6978","authenticated-orcid":false,"given":"Tiejun","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4914-9255","authenticated-orcid":false,"given":"Jane","family":"Hillston","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh, Edinburgh, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-02939-x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0950-5849(95)01096-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380757"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00608-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.72"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2009.35"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3042392"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.02.006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.45"},{"key":"ref2","article-title":"The blockchain consensus layer and BFT","author":"abraham","year":"0","journal-title":"Bull EATCS"},{"key":"ref1","first-page":"173","article-title":"Practical Byzantine fault tolerance","author":"castro","year":"0","journal-title":"Proc USENIX OSDI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.000-5"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3030605"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978389"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243853"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2018.23241"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2013.0567"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.84"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2016.12.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2904058"},{"key":"ref20","article-title":"RepChain: A reputation based secure, fast and high incentive blockchain system via sharding","author":"huang","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760336"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00059"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2689760"},{"key":"ref29","article-title":"The ZILLIQAtechnical whitepaper","year":"2017","journal-title":"Zilliqa"},{"key":"ref8","article-title":"Communication efficient BFT protocols using small trusted hardware to tolerate minority corruption","author":"yandamuri","year":"0","journal-title":"Cryptology ePrint Archive Paper 2021\/689"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2860009"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519568"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"ref3","first-page":"485","article-title":"XFT: Practical fault tolerance beyond crashes","author":"liu","year":"0","journal-title":"Proc OSDI"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168866"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/10311055\/10214975.pdf?arnumber=10214975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T19:56:00Z","timestamp":1702324560000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10214975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":40,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.2023.3296916","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12]]}}}