{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:08:48Z","timestamp":1736658528360,"version":"3.32.0"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,3]]},"DOI":"10.1109\/bibm62325.2024.10822264","type":"proceedings-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:12:45Z","timestamp":1736539965000},"page":"5968-5975","source":"Crossref","is-referenced-by-count":0,"title":["ParaBFT: An Efficient Parallel Asynchronous BFT Agreement"],"prefix":"10.1109","author":[{"given":"Yu","family":"Lan","sequence":"first","affiliation":[{"name":"Minnan Normal University,School of Computer Science,Zhangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[{"name":"Minnan Normal University,School of Computer Science,Zhangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingming","family":"He","sequence":"additional","affiliation":[{"name":"Guangxi University,School of Mathematics and Information Science,Nanning,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caixia","family":"Wu","sequence":"additional","affiliation":[{"name":"Fuzhou Institute of Technology,School of Electronic Engineering,Fuzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuaike","family":"Wu","sequence":"additional","affiliation":[{"name":"Minnan Normal University,School of Computer Science,Zhangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangzeng","family":"Kong","sequence":"additional","affiliation":[{"name":"Fujian Agriculture and Forestry University,College of Mechanical and Electrical Engineering,Fuzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Blockchain for healthcare systems: Architecture, security challenges, trends and future directions","author":"Andrew","year":"2023","journal-title":"Journal of Network and Computer Applications"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2023.039749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/network2020016"},{"key":"ref4","first-page":"3757","article-title":"Secure PBFT Consensus-Based Lightweight Blockchain for Healthcare Application","volume":"6","author":"Pawan","year":"2023","journal-title":"Applied Sciences"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2023.12.082"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3503042"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2024.10.010"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.resourpol.2024.105369"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/jrfm16040218"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/e25091320"},{"issue":"6","key":"ref12","article-title":"Asynchronous Consensus in Synchronous Systems Using send toall Primitive","volume":"4","author":"Sathyanarayanan","year":"2023","journal-title":"SN Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2024.129867"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1108\/CFRI-03-2023-0076"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s12243-022-00930-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2974510"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"article-title":"More constructions of resplittable threshold public key encryption","volume-title":"Proc. of the Annual International Cryptology Conference","author":"Ohata","key":"ref19"},{"issue":"6","key":"ref20","first-page":"1549","article-title":"Secure cloud storage model based on TPKE and ECE","volume":"9","author":"Xia","year":"2018","journal-title":"Journal of Information Hiding and Multimedia Signal Processing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_11"},{"key":"ref22","article-title":"Recon: Sybil-resistant consensus from reputation","volume":"61","author":"Biryukov","year":"2023","journal-title":"Pervasive and Mobile Computing"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/DSN48063.2020.00058"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559379"},{"article-title":"A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks","year":"2018","author":"Aggarwal","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/icdcs54860.2022.00032"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3382602"},{"article-title":"MiB: Asynchronous BFT with More Replicas","year":"2021","author":"Liu","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"ref32","first-page":"2022\/020","article-title":"PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement","author":"Duan","year":"2022","journal-title":"Cryptology ePrint Archive"},{"article-title":"AleaBFT: Practical Asynchronous Byzantine Fault Tolerance","year":"2024","author":"Antunes","key":"ref33"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12183801"},{"key":"ref36","article-title":"Advances in Consortium Chain Scalability: A Review of the Practical Byzantine Fault Tolerance Consensus Algorithm","volume":"7","author":"Abdul Wahab","year":"2024","journal-title":"International Journal of Advanced Computer Science and Applications (IJACSA)"},{"issue":"14","key":"ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11227-024-06199-2","article-title":"A practical Byzantine fault tolerance improvement algorithm based on credit grouping-classification","volume":"80","author":"Li","year":"2024","journal-title":"Journal of Supercomputing"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"article-title":"Disperse-dledger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks","year":"2021","author":"Yang","key":"ref39"},{"issue":"2","key":"ref40","first-page":"243","article-title":"HiPro-HoneyBadgerBFT: A High Performance Asynchronous Consensus Algorithm Based on Parallel Running Mechanism","volume":"51","author":"Song","year":"2024","journal-title":"Automation and Instrumentation in Chemical Industry"}],"event":{"name":"2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","start":{"date-parts":[[2024,12,3]]},"location":"Lisbon, Portugal","end":{"date-parts":[[2024,12,6]]}},"container-title":["2024 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10821710\/10821711\/10822264.pdf?arnumber=10822264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:48:06Z","timestamp":1736588886000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10822264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/bibm62325.2024.10822264","relation":{},"subject":[],"published":{"date-parts":[[2024,12,3]]}}}