{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:39:22Z","timestamp":1768873162440,"version":"3.49.0"},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"11","license":[{"start":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:00:00Z","timestamp":1748390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11,13]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>To address the limitations in reward-punishment mechanisms and leader election in the HotStuff consensus algorithm, we propose an enhanced version called the reputed HotStuff (RHS) consensus algorithm, which introduces reputation-based grouping. In RHS, consensus is driven by high-reputation leaders, with nodes grouped according to their reputation scores. Witness nodes monitor and evaluate node behavior, while consensus nodes elect the leader, who stakes part of their reputation to initiate a new consensus round. Guided by the witness nodes, the reputation-based voting mechanism reduces communication complexity to O(n), enhancing efficiency. The RHS algorithm effectively differentiates Byzantine nodes and prevents them from frequently becoming leaders, resulting in lower consensus latency and higher throughput. Experimental results demonstrate that with 37 nodes, including Byzantine participants, RHS achieves 53.3% higher throughput and 32.6% lower consensus latency compared to HotStuff. Furthermore, when compared to another reputation-based algorithm, reputed practical Byzantine fault tolerance (RPBFT), RHS offers 29.57% higher throughput and reduces consensus latency by 25.97%. The experimental results illustrate that RHS achieves notable advantages in enhancing communication efficiency and addressing system faults.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf069","type":"journal-article","created":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T08:10:32Z","timestamp":1747383032000},"page":"1732-1742","source":"Crossref","is-referenced-by-count":1,"title":["Improved HotStuff consensus algorithm based on reputation mechanism grouping"],"prefix":"10.1093","volume":"68","author":[{"given":"Haizhen","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, College of Computer and Control Engineering, Qiqihar University , No. 42 Wenhua Street, Jianhua District, Heilongjiang, Qiqihar 161006,","place":["China"]},{"name":"Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis, Qiqihar University , No. 42 Wenhua Street, Jianhua District, Heilongjiang, Qiqihar 161006 ,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawen","family":"Shi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, College of Computer and Control Engineering, Qiqihar University , No. 42 Wenhua Street, Jianhua District, Heilongjiang, Qiqihar 161006,","place":["China"]},{"name":"Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis, Qiqihar University , No. 42 Wenhua Street, Jianhua District, Heilongjiang, Qiqihar 161006 ,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,5,28]]},"reference":[{"key":"2025111901221696600_ref1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40854-019-0147-z","article-title":"A systematic review of blockchain","volume":"5","author":"Xu","year":"2019","journal-title":"Financ Innov"},{"key":"2025111901221696600_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-020-00123-0","article-title":"A survey on blockchain technology concepts, applications, and issues","author":"Gamage","year":"2020","journal-title":"SN Comput Sci"},{"key":"2025111901221696600_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3335772.3335936","volume-title":"Concurrency: The Works of Leslie Lamport","author":"Lamport","year":"2019"},{"key":"2025111901221696600_ref4","first-page":"173","volume-title":"Proceedings of OSDI","author":"Castro","year":"1999"},{"key":"2025111901221696600_ref5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/3293611.3331591","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, 29 July\u20132 August","author":"Yin","year":"2019"},{"key":"2025111901221696600_ref6","first-page":"1","volume-title":"Proceedings of the 2020 2nd International Conference on Blockchain Technology, Hawaii, 12\u201314 March","author":"Yang","year":"2020"},{"key":"2025111901221696600_ref7","first-page":"17","volume-title":"International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, Guilin, 17\u201319 October","author":"Li","year":"2019"},{"key":"2025111901221696600_ref8","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.3390\/electronics12061460","article-title":"Improvement of PBFT algorithm based on CART","volume":"12","author":"Liu","year":"2023","journal-title":"Electronics"},{"key":"2025111901221696600_ref9","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/Blockchain53845.2021.00030","volume-title":"Proceedings of the 2021 IEEE International Conference on Blockchain (Blockchain), Melbourne, 6\u20138 December","author":"Sober","year":"2021"},{"key":"2025111901221696600_ref10","first-page":"568","volume-title":"Proceedings of the 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN),Portland, 24\u201327 June","author":"Gueta","year":"2019"},{"key":"2025111901221696600_ref11","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.1007\/s40747-022-00907-2","article-title":"A node selection algorithm with a genetic method based on PBFT in consortium blockchains","volume":"9","author":"Zhang","year":"2023","journal-title":"Complex Intell Syst"},{"key":"2025111901221696600_ref12","first-page":"1008","volume-title":"Proceedings of the 2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Wuhan, 9\u201311 December","author":"Cheng","year":"2022"},{"key":"2025111901221696600_ref13","first-page":"217","volume-title":"2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS),Nanjing, 10\u201312 January","author":"Zhai","year":"2023"},{"key":"2025111901221696600_ref14","doi-asserted-by":"publisher","first-page":"102884","DOI":"10.1016\/j.ipm.2022.102884","article-title":"An improved algorithm for practical byzantine fault tolerance to large-scale consortium chain","volume":"59","author":"Chen","year":"2022","journal-title":"Inf Process Manag"},{"key":"2025111901221696600_ref15","doi-asserted-by":"publisher","first-page":"33509","DOI":"10.1109\/ACCESS.2023.3264011","article-title":"A scalable byzantine fault tolerance algorithm based on a tree topology network","volume":"11","author":"Jiang","year":"2023","journal-title":"IEEE Access"},{"key":"2025111901221696600_ref16","doi-asserted-by":"crossref","first-page":"6257","DOI":"10.1109\/JIOT.2020.3029781","article-title":"Voting-based decentralized consensus design for improving the efficiency and security of consortium blockchain","volume":"8","author":"Sun","year":"2020","journal-title":"IEEE Internet Things J"},{"key":"2025111901221696600_ref17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1186\/s13677-024-00643-7","article-title":"CG-PBFT: an efficient PBFT algorithm based on credit grouping","volume":"13","author":"Liu","year":"2024","journal-title":"J Cloud Comput"},{"key":"2025111901221696600_ref18","doi-asserted-by":"publisher","first-page":"103855","DOI":"10.1016\/j.csi.2024.103855","article-title":"Reputation is not enough: ensuring strong order-fairness in byzantine consensus","volume":"90","author":"Li","year":"2024","journal-title":"Comput Stand Inter"},{"key":"2025111901221696600_ref19","doi-asserted-by":"crossref","first-page":"100067","DOI":"10.1016\/j.bcra.2022.100067","article-title":"A survey on blockchain technology and its security","volume":"3","author":"Guo","year":"2022","journal-title":"Blockchain Res Appl"},{"key":"2025111901221696600_ref20","first-page":"1628","article-title":"Improved PBFT consensus algorithm based on reputation mechanism","volume":"41","author":"Li","year":"2024","journal-title":"Comput Appl Res"},{"key":"2025111901221696600_ref21","first-page":"1","volume-title":"Proceedings of the 2021 IEEE International Conference on Omni-Layer Intelligent Systems (COINS), Barcelona, 23\u201325 August","author":"Alqahtani","year":"2021"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/11\/1732\/63390866\/bxaf069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/11\/1732\/63390866\/bxaf069.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T06:22:26Z","timestamp":1763533346000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/11\/1732\/8152041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,28]]},"references-count":21,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,5,28]]},"published-print":{"date-parts":[[2025,11,13]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf069","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,11]]},"published":{"date-parts":[[2025,5,28]]}}}