{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T10:35:32Z","timestamp":1782988532117,"version":"3.54.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202306460078"],"award-info":[{"award-number":["202306460078"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202006465043"],"award-info":[{"award-number":["202006465043"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022LZH013"],"award-info":[{"award-number":["ZR2022LZH013"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022LZH013"],"award-info":[{"award-number":["ZR2022LZH013"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFB3702403"],"award-info":[{"award-number":["2021YFB3702403"]}],"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":["62101029"],"award-info":[{"award-number":["62101029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s12083-024-01830-8","type":"journal-article","created":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T22:33:56Z","timestamp":1733524436000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Byzantine fault tolerance consensus based on trusted execution environments"],"prefix":"10.1007","volume":"18","author":[{"given":"Ran","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuqiang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sisui","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hangning","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyuan","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaotong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,6]]},"reference":[{"key":"1830_CR1","unstructured":"(2024) FISCO BCOS. http:\/\/fisco-bcos.org\/zh\/, accessed: April 2024"},{"issue":"4","key":"1830_CR2","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro M, Liskov B (2002) Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20(4):398\u2013461","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"1830_CR3","unstructured":"Castro M, Liskov B, et\u00a0al (1999) Practical byzantine fault tolerance. In: OsDI, pp 173\u2013186"},{"issue":"6","key":"1830_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1323293.1294280","volume":"41","author":"BG Chun","year":"2007","unstructured":"Chun BG, Maniatis P, Shenker S et al (2007) Attested append-only memory: Making adversaries stick to their word. ACM SIGOPS Operating Systems Review 41(6):189\u2013204","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"3","key":"1830_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00446-004-0110-7","volume":"17","author":"M Correia","year":"2005","unstructured":"Correia M, Neves NF, Lung LC et al (2005) Low complexity byzantine-resilient consensus. Distrib Comput 17(3):237\u2013249","journal-title":"Distrib Comput"},{"key":"1830_CR6","doi-asserted-by":"crossref","unstructured":"Distler T, Kapitza R (2011) Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency. In: Proceedings of the sixth conference on Computer systems, pp 91\u2013106","DOI":"10.1145\/1966445.1966455"},{"issue":"9","key":"1830_CR7","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/TC.2015.2495213","volume":"65","author":"T Distler","year":"2016","unstructured":"Distler T, Cachin C, Kapitza R (2016) Resource-efficient byzantine fault tolerance. IEEE Trans Comput 65(9):2807\u20132819","journal-title":"IEEE Trans Comput"},{"key":"1830_CR8","doi-asserted-by":"crossref","unstructured":"Ekberg JE, Kostiainen K, Asokan N (2014) The untapped potential of trusted execution environments on mobile devices. IEEE Security & Privacy","DOI":"10.1109\/MSP.2014.38"},{"key":"1830_CR9","doi-asserted-by":"crossref","unstructured":"Garcia M, Bessani A, Gashi I, et\u00a0al (2011) Os diversity for intrusion tolerance: Myth or reality? In: 2011 IEEE\/IFIP 41st International Conference on Dependable Systems & Networks (DSN), IEEE, pp 383\u2013394","DOI":"10.1109\/DSN.2011.5958251"},{"key":"1830_CR10","doi-asserted-by":"crossref","unstructured":"Gervais A, Karame GO, W\u00fcst K, et\u00a0al (2016) On the security and performance of proof of work blockchains. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp 3\u201316","DOI":"10.1145\/2976749.2978341"},{"key":"1830_CR11","unstructured":"Hyperledger (2024) Hyperledger Fabric. https:\/\/www.hyperledger.org\/projects\/fabric, accessed: April 2024"},{"key":"1830_CR12","unstructured":"Intel (2023) Intel\u00ae Software Guard Extensions (SGX) Programming Reference. Tech. rep., Intel Corporation, accessed: [insert date here]"},{"key":"1830_CR13","doi-asserted-by":"crossref","unstructured":"Javaid M, Haleem A, Singh RP, et\u00a0al (2021) Blockchain technology applications for industry 4.0: A literature-based review. Blockchain: Research and Applications 2(4):100027","DOI":"10.1016\/j.bcra.2021.100027"},{"issue":"2","key":"1830_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.3390\/commodities2020006","volume":"2","author":"E Kapengut","year":"2023","unstructured":"Kapengut E, Mizrach B (2023) An event study of the ethereum transition to proof-of-stake. Commodities 2(2):96\u2013110","journal-title":"Commodities"},{"key":"1830_CR15","doi-asserted-by":"crossref","unstructured":"Kapitza R, Behl J, Cachin C, et\u00a0al (2012) Cheapbft: Resource-efficient byzantine fault tolerance. In: Proceedings of the 7th ACM european conference on Computer Systems, pp 295\u2013308","DOI":"10.1145\/2168836.2168866"},{"key":"1830_CR16","doi-asserted-by":"crossref","unstructured":"Kim Thomas (2017) On the transaction cost of Bitcoin. Finance Res Lett 23:300\u2013305","DOI":"10.1016\/j.frl.2017.07.014"},{"key":"1830_CR17","doi-asserted-by":"crossref","unstructured":"Kotla R, Dahlin M (2004) High throughput byzantine fault tolerance. In: International Conference on Dependable Systems and Networks, 2004, IEEE, pp 575\u2013584","DOI":"10.1109\/DSN.2004.1311928"},{"issue":"4","key":"1830_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1658357.1658358","volume":"27","author":"R Kotla","year":"2010","unstructured":"Kotla R, Alvisi L, Dahlin M et al (2010) Zyzzyva: Speculative byzantine fault tolerance. ACM Transactions on Computer Systems (TOCS) 27(4):1\u201339","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"1830_CR19","unstructured":"Levin D, Douceur JR, Lorch JR, et\u00a0al (2009) Trinc: Small trusted hardware for large distributed systems. In: NSDI, pp 1\u201314"},{"key":"1830_CR20","doi-asserted-by":"crossref","unstructured":"Li H, Chen Y, Shi X, et\u00a0al (2023) Fisco-bcos: An enterprise-grade permissioned blockchain system with high-performance. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp 1\u201317","DOI":"10.1145\/3581784.3607053"},{"issue":"16","key":"1830_CR21","doi-asserted-by":"publisher","first-page":"15138","DOI":"10.1109\/JIOT.2022.3147925","volume":"9","author":"T Li","year":"2022","unstructured":"Li T, Wang H, He D et al (2022) Blockchain-based privacy-preserving and rewarding private data sharing for iot. IEEE Internet Things J 9(16):15138\u201315149","journal-title":"IEEE Internet Things J"},{"key":"1830_CR22","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1007\/s12083-021-01103-8","volume":"14","author":"Y Li","year":"2021","unstructured":"Li Y, Qiao L, Lv Z (2021) An optimized byzantine fault tolerance algorithm for consortium blockchain. Peer-to-Peer Networking and Applications 14:2826\u20132839","journal-title":"Peer-to-Peer Networking and Applications"},{"issue":"1","key":"1830_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2018.2860009","volume":"68","author":"J Liu","year":"2018","unstructured":"Liu J, Li W, Karame GO et al (2018) Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans Comput 68(1):139\u2013151","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"1830_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"JP Martin","year":"2006","unstructured":"Martin JP, Alvisi L (2006) Fast byzantine consensus. IEEE Trans Dependable Secure Comput 3(3):202\u2013215","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"1830_CR25","doi-asserted-by":"crossref","unstructured":"McKeen F, Alexandrovich I, Berenzon A, et\u00a0al (2013) Innovative instructions and software model for isolated execution. In: HASP","DOI":"10.1145\/2487726.2488368"},{"key":"1830_CR26","doi-asserted-by":"crossref","unstructured":"Miller A, Xia Y, Croman K, et\u00a0al (2016) The honey badger of bft protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, ACM, Vienna, Austria, pp 31\u201342","DOI":"10.1145\/2976749.2978399"},{"key":"1830_CR27","unstructured":"Obelheiro RR, Bessani AN, Lung LC, et\u00a0al (2006) How practical are intrusion-tolerant distributed systems? Technical Report"},{"key":"1830_CR28","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/HASE.2010.19","volume-title":"2010 IEEE 12th International Symposium on High Assurance Systems Engineering","author":"GS Veronese","year":"2010","unstructured":"Veronese GS, Correia M, Bessani AN et al (2010) Ebawa: Efficient byzantine agreement for wide-area networks. 2010 IEEE 12th International Symposium on High Assurance Systems Engineering. IEEE, San Jose, CA, USA, pp 10\u201319"},{"issue":"1","key":"1830_CR29","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2011","unstructured":"Veronese GS, Correia M, Bessani AN et al (2011) Efficient byzantine fault-tolerance. IEEE Trans Comput 62(1):16\u201330","journal-title":"IEEE Trans Comput"},{"key":"1830_CR30","doi-asserted-by":"crossref","unstructured":"Vukoli\u0107 M (2016) The quest for scalable blockchain fabric: Proof-of-work vs. bft replication. In: Open Problems in Network Security: IFIP WG 11.4 International Workshop, iNetSec 2015, Zurich, Switzerland, October 29, 2015, Revised Selected Papers, Springer, pp 112\u2013125","DOI":"10.1007\/978-3-319-39028-4_9"},{"issue":"13s","key":"1830_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3579845","volume":"55","author":"J Xu","year":"2023","unstructured":"Xu J, Wang C, Jia X (2023) A survey of blockchain consensus protocols. ACM Comput Surv 55(13s):1\u201335","journal-title":"ACM Comput Surv"},{"key":"1830_CR32","unstructured":"Yao W, Ye J, Murimi R, et\u00a0al (2021) A survey on consortium blockchain consensus mechanisms.arXiv:210212058"},{"key":"1830_CR33","doi-asserted-by":"crossref","unstructured":"Yin M, Malkhi D, Reiter MK, et\u00a0al (2019) Hotstuff: Bft consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp 347\u2013356","DOI":"10.1145\/3293611.3331591"},{"issue":"11","key":"1830_CR34","doi-asserted-by":"publisher","first-page":"7669","DOI":"10.1109\/TII.2021.3049141","volume":"17","author":"K Yu","year":"2021","unstructured":"Yu K, Tan L, Aloqaily M et al (2021) Blockchain-enhanced data sharing with traceable and direct revocation in iiot. IEEE Trans Industr Inf 17(11):7669\u20137678","journal-title":"IEEE Trans Industr Inf"},{"key":"1830_CR35","doi-asserted-by":"crossref","unstructured":"Zhang C, Wu C, Wang X (2020) Overview of blockchain consensus mechanism. In: Proceedings of the 2020 2nd International Conference on Big Data Engineering, ACM, Shanghai, China, pp 7\u201312","DOI":"10.1145\/3404512.3404522"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01830-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-024-01830-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01830-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T09:33:30Z","timestamp":1747474410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-024-01830-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,6]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1830"],"URL":"https:\/\/doi.org\/10.1007\/s12083-024-01830-8","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,6]]},"assertion":[{"value":"20 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors approved the final manuscript and the submission to this journal.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"31"}}