{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T18:10:17Z","timestamp":1739383817567,"version":"3.37.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Natural Science Foundation of Fujian Province of China under Grant","award":["2023J01920","2023J01920","2023J01920","2023J01920","2023J01920"],"award-info":[{"award-number":["2023J01920","2023J01920","2023J01920","2023J01920","2023J01920"]}]},{"name":"National Social Science Fund of China","award":["21XTQ015","21XTQ015","21XTQ015","21XTQ015","21XTQ015"],"award-info":[{"award-number":["21XTQ015","21XTQ015","21XTQ015","21XTQ015","21XTQ015"]}]},{"name":"the presidential research fund of Minnan Normal University","award":["KJ18024","KJ18024","KJ18024","KJ18024","KJ18024"],"award-info":[{"award-number":["KJ18024","KJ18024","KJ18024","KJ18024","KJ18024"]}]},{"name":"Fujian Provincial Education Research Project for Young and Middle-aged Teachers","award":["JAT200293","JAT200293","JAT200293","JAT200293","JAT200293"],"award-info":[{"award-number":["JAT200293","JAT200293","JAT200293","JAT200293","JAT200293"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-06995-4","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T17:31:21Z","timestamp":1739381481000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ERBFT: improved asynchronous BFT with erasure code and verifiable random function"],"prefix":"10.1007","volume":"81","author":[{"given":"Yu","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qunshan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuaike","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"6995_CR1","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. Cryptology ePrint Archive 2008\/178. https:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"10","key":"6995_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1093\/nsr\/nwac132","volume":"9","author":"SS Duan","year":"2022","unstructured":"Duan SS, Zhang HB (2022) Recent progress on bft in the era of blockchains. Natl Sci Rev 9(10):2","journal-title":"Natl Sci Rev"},{"key":"6995_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2024.129609","volume":"638","author":"PO Obanya","year":"2024","unstructured":"Obanya PO, Seitshiro M, Olivier CP, Verster T (2024) A permutation entropy analysis of bitcoin volatility. Physica A: Statistical Mech Appl 638:129609","journal-title":"Physica A: Statistical Mech Appl"},{"key":"6995_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ribaf.2024.102237","volume":"69","author":"X Li","year":"2024","unstructured":"Li X, Wu RX, Wang C (2024) Impacts of bitcoin on monetary system: is china\u2019s bitcoin ban necessary? Res Int Bus Finance 69:102237","journal-title":"Res Int Bus Finance"},{"issue":"7","key":"6995_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1080\/08832323.2023.2201414","volume":"98","author":"MTI Khan","year":"2023","unstructured":"Khan MTI (2023) Literacy, profile, and determinants of bitcoin, ethereum, and litecoin: survey results. J Educ Bus 98(7):367\u2013377","journal-title":"J Educ Bus"},{"key":"6995_CR6","doi-asserted-by":"crossref","unstructured":"Li JJ, Qin R, Guan ST, Hou JC (2024) Blockchain intelligence: intelligent blockchains for web 3.0 and beyond. IEEE Transactions on Systems, Man, and Cybernetics: Systems 1\u201310","DOI":"10.1109\/TSMC.2023.3348449"},{"issue":"9","key":"6995_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3390\/bdcc7010009","volume":"7","author":"H Hassani","year":"2023","unstructured":"Hassani H, Norouzi K, Ghodsi A, Huang X (2023) Revolutionary dentistry through blockchain technology. Big Data Cognit Comput 7(9):9","journal-title":"Big Data Cognit Comput"},{"key":"6995_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1186\/s42400-023-00163-y","volume":"6","author":"Z Hussein","year":"2023","unstructured":"Hussein Z, Salama MA, El-Rahman SA (2023) Evolution of blockchain consensus algorithms: a review on the latest milestones of blockchain consensus algorithms. Cybersecurity 6:30","journal-title":"Cybersecurity"},{"issue":"2","key":"6995_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM (JACM) 27(2):228\u2013234","journal-title":"J ACM (JACM)"},{"key":"6995_CR10","unstructured":"Wang X, Duan SS, Clavin J, Zhang HB (2020) Bft in blockchains: From protocols to use cases. ACM Comput Surveys (CSUR)"},{"key":"6995_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (2019) Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 285\u2013306","DOI":"10.1145\/3335741.3335759"},{"key":"6995_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.3390\/electronics12183801","volume":"12","author":"WY Zhong","year":"2023","unstructured":"Zhong WY, Yang C, Liang W (2023) Byzantine fault-tolerant consensus algorithms: a survey. Electronics 12:30","journal-title":"Electronics"},{"key":"6995_CR13","first-page":"173","volume":"99","author":"M Castro","year":"1999","unstructured":"Castro M, Liskov B (1999) Practical byzantine fault tolerance. Op Syst Design Implement 99:173\u2013186","journal-title":"Op Syst Design Implement"},{"key":"6995_CR14","unstructured":"BitFury (2015) Proof of Stake versus proof of work. White paper"},{"key":"6995_CR15","unstructured":"Ongaro D, Ousterhout J (2014) In search of an understandable consensus algorithm. In: USENIX Annual Technical Conference"},{"key":"6995_CR16","unstructured":"Larimer D (2014) Delegated proof of stake. BitShares White Paper"},{"issue":"3","key":"6995_CR17","first-page":"18","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport L (2001) Paxos made simple. ACM SIGACT News 32(3):18\u201325","journal-title":"Paxos made simple. ACM SIGACT News"},{"key":"6995_CR18","unstructured":"Kogias EK, Jovanovic P, Gailly N, Chase M, Roscoe AW (2016) Enhancing bitcoin security and performance with strong consistency via collective signing. In USENIX Security Symposium"},{"key":"6995_CR19","doi-asserted-by":"crossref","unstructured":"Miller A, Xia Y, Croman K (2016) The honey badger of bft protocols. In: Proceedings of the 23rd ACM SIGSAC Conference on Computer and Communications Security 31\u201342","DOI":"10.1145\/2976749.2978399"},{"key":"6995_CR20","doi-asserted-by":"publisher","unstructured":"Duan SS, Reiter MK, Zhang HB (2018) Beat: Asynchronous bft made practical. In: Proceedings of the 25th ACM SIGSAC Conference on Computer and Communications Security 2028\u20132041. https:\/\/doi.org\/10.1145\/3548606.3559348","DOI":"10.1145\/3548606.3559348"},{"key":"6995_CR21","doi-asserted-by":"publisher","unstructured":"Guo BY, Lu ZL, Tang Q (2020) Dumbo: Faster asynchronous bft protocols. In: CCS\u201920: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security 803\u2013818. https:\/\/doi.org\/10.1145\/3372297.3417262","DOI":"10.1145\/3372297.3417262"},{"key":"6995_CR22","volume-title":"Tendermint: Consensus without Mining","author":"J Kwon","year":"2014","unstructured":"Kwon J, Buchman E (2014) Tendermint: Consensus without Mining. Tendermint Inc., White Paper"},{"issue":"1","key":"6995_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"JA Garay","year":"1998","unstructured":"Garay JA, Moses Y (1998) Fully polynomial byzantine agreement for n>3 t processors in t-i-1 rounds. SIAM J Comput 27(1):247\u2013290","journal-title":"SIAM J Comput"},{"issue":"4","key":"6995_CR24","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman P, Micali S (1997) An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J Comput 26(4):873\u2013933","journal-title":"SIAM J Comput"},{"key":"6995_CR25","unstructured":"Liu C, Duan SS, Zhang HB (2021) Mib: Asynchronous bft with more replicas. https:\/\/doi.org\/10.48550\/arXiv.2108.04488"},{"key":"6995_CR26","doi-asserted-by":"publisher","unstructured":"Toulouse M, Minh BQ, Curtis P (2015) A consensus based network intrusion detection system. In: 2015 5th International Conference on IT Convergence and Security (ICITCS) 1\u20136. https:\/\/doi.org\/10.1109\/ICITCS.2015.7292913","DOI":"10.1109\/ICITCS.2015.7292913"},{"issue":"2","key":"6995_CR27","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374\u2013382","journal-title":"J ACM"},{"key":"6995_CR28","doi-asserted-by":"crossref","unstructured":"Ben-Or M, Kelmer B, Rabin T (1994) Asynchronous secure computations with optimal resilience. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing 183\u2013192. ACM","DOI":"10.1145\/197917.198088"},{"key":"6995_CR29","doi-asserted-by":"crossref","unstructured":"Cachin C, Kursawe K, Petzold F (2001) Secure and efficient asynchronous broadcast protocols. In: Advances in Cryptology - CRYPTO 2001: Proceedings of the 21st Annual International Cryptology Conference, Santa Barbara, California, USA 524\u2013541","DOI":"10.1007\/3-540-44647-8_31"},{"issue":"2","key":"6995_CR30","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha G (1987) Asynchronous byzantine agreement protocols. Inf Comput 75(2):130\u2013143","journal-title":"Inf Comput"},{"key":"6995_CR31","unstructured":"Lei Y, Park SJ, Alizadeh M (2022) Dispersedledger: High-throughput byzantine consensus on variable bandwidth networks. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22) 493\u2013512"},{"key":"6995_CR32","first-page":"27","volume":"2022","author":"BY Guo","year":"2022","unstructured":"Guo BY, Lu Y, Lu ZL, Tang Q, Xu J, Zhang ZF (2022) Speeding dumbo: Pushing asynchronous bft closer to practice. IACR Cryptol. ePrint Arch. 2022:27","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"6995_CR33","doi-asserted-by":"publisher","unstructured":"Duan SS, Wang X, Zhang HB (2023) FIN: Practical signature-free asynchronous common subset in constant time. Cryptology ePrint Archive, Paper 2023\/154. https:\/\/doi.org\/10.1145\/3576915.3616633. https:\/\/eprint.iacr.org\/2023\/154","DOI":"10.1145\/3576915.3616633"},{"issue":"09","key":"6995_CR34","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.19734\/j.issn.1001-3695.2023.02.0029","volume":"40","author":"YQ Wang","year":"2023","unstructured":"Wang YQ, Liu Y, Li XY, Liu XL, Cao HH (2023) An efficient asynchronous byzantine fault tolerance algorithm for blockchain. J Comput Appl Res 40(09):2590\u20132595. https:\/\/doi.org\/10.19734\/j.issn.1001-3695.2023.02.0029","journal-title":"J Comput Appl Res"},{"issue":"3","key":"6995_CR35","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1093\/comjnl\/bxad048","volume":"67","author":"ZY Zhang","year":"2024","unstructured":"Zhang ZY, Zhang LY, Wang Z, Li YC, Lu RX, Yu Y (2024) Chronos: an efficient asynchronous byzantine ordered consensus. Comput J 67(3):1153\u20131162. https:\/\/doi.org\/10.1093\/comjnl\/bxad048","journal-title":"Comput J"},{"key":"6995_CR36","doi-asserted-by":"crossref","unstructured":"Lamport L, Shostak R, Pease M (1982) The byzantine generals problem. ACM Transactions Program Languages Syst 4(3)","DOI":"10.1145\/357172.357176"},{"key":"6995_CR37","doi-asserted-by":"crossref","unstructured":"Abraham I, Malkhi D, Spiegelman A (2019) Asymptotically optimal validated asynchronous byzantine agreement. In: the 2019 ACM Symposium","DOI":"10.1145\/3293611.3331612"},{"key":"6995_CR38","unstructured":"Micali S, Rabin M, Vadhan S (1999) Verifiable random functions. IEEE Comput Soc"},{"key":"6995_CR39","doi-asserted-by":"crossref","unstructured":"Ben-Or M (1983) Another advantage of free choice: completely asynchronous agreement protocols. In: Proceedings of the Second Annual Symposium on Principles of Distributed Computing 27\u201330","DOI":"10.1145\/800221.806707"},{"key":"6995_CR40","doi-asserted-by":"crossref","unstructured":"Merkle RC (1987) A digital signature based on a conventional encryption function. In: Th Conference on Advances in Cryptology","DOI":"10.1007\/3-540-48184-2_32"},{"issue":"2","key":"6995_CR41","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed IS, Solomon G (1960) Polynomial codes over certain finite fields. J Soc Ind Appl Math 8(2):300\u2013304","journal-title":"J Soc Ind Appl Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06995-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-06995-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06995-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T17:31:39Z","timestamp":1739381499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-06995-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,12]]},"references-count":41,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["6995"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-06995-4","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,12]]},"assertion":[{"value":"27 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that no commercial or related interests conflict with any of the submitted work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"486"}}