{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:20:51Z","timestamp":1778602851508,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T00:00:00Z","timestamp":1740960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T00:00:00Z","timestamp":1740960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2702702"],"award-info":[{"award-number":["2022YFB2702702"]}],"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":["62372020, U21B2021"],"award-info":[{"award-number":["62372020, U21B2021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["L222050"],"award-info":[{"award-number":["L222050"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s12083-025-01934-9","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T08:11:38Z","timestamp":1740989498000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient dynamic-committee BFT consensus based on HotStuff"],"prefix":"10.1007","volume":"18","author":[{"given":"Zongyang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,3]]},"reference":[{"issue":"2","key":"1934_CR1","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/COMST.2020.2969706","volume":"22","author":"Y Xiao","year":"2020","unstructured":"Xiao Y, Zhang N, Lou W, Hou YT (2020) A survey of distributed consensus protocols for blockchain networks. IEEE Commun Surv Tutorials 22(2):1432\u20131465. https:\/\/doi.org\/10.1109\/COMST.2020.2969706","journal-title":"IEEE Commun Surv Tutorials"},{"issue":"13s","key":"1934_CR2","doi-asserted-by":"publisher","first-page":"278","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):278\u2013127835. https:\/\/doi.org\/10.1145\/3579845","journal-title":"ACM Comput Surv"},{"key":"1934_CR3","unstructured":"Castro M, Liskov B (1999) Practical byzantine fault tolerance. In: Proceedings of the third USENIX symposium on operating systems design and implementation (OSDI). USENIX Association, New Orleans, Louisiana, USA, pp 173\u2013186. https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"key":"1934_CR4","doi-asserted-by":"publisher","unstructured":"Yin M, Malkhi D, Reiter MK, Golan-Gueta G, Abraham I (2019) Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). ACM, Toronto, ON, Canada, pp 347\u2013356. https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"},{"issue":"4","key":"1934_CR5","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 Trans Comput Syst 20(4):398\u2013461. https:\/\/doi.org\/10.1145\/571637.571640","journal-title":"ACM Trans Comput Syst"},{"issue":"4","key":"1934_CR6","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TPDS.2009.83","volume":"21","author":"P Sousa","year":"2010","unstructured":"Sousa P, Bessani AN, Correia M, Neves NF, Ver\u00edssimo P (2010) Highly available intrusion-tolerant services with proactive-reactive recovery. IEEE Trans Parallel Distributed Syst 21(4):452\u2013465. https:\/\/doi.org\/10.1109\/TPDS.2009.83","journal-title":"IEEE Trans Parallel Distributed Syst"},{"issue":"1","key":"1934_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman KP, Joseph TA (1987) Reliable communication in the presence of failures. ACM Trans Comput Syst 5(1):47\u201376. https:\/\/doi.org\/10.1145\/7351.7478","journal-title":"ACM Trans Comput Syst"},{"key":"1934_CR8","doi-asserted-by":"publisher","unstructured":"Reiter MK (1994) Secure agreement protocols: Reliable and atomic group multicast in rampart. In: Denning DE, Pyle R, Ganesan R, Sandhu RS (eds) Proceedings of the 2nd ACM Conference on Computer and Communications Security (CCS). ACM, Fairfax, Virginia, USA, pp 68\u201380. https:\/\/doi.org\/10.1145\/191177.191194","DOI":"10.1145\/191177.191194"},{"issue":"2","key":"1934_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport L (1998) The part-time parliament. ACM Trans Comput Syst 16(2):133\u2013169. https:\/\/doi.org\/10.1145\/279227.279229","journal-title":"ACM Trans Comput Syst"},{"key":"1934_CR10","unstructured":"Ongaro D, Ousterhout JK (2014) In search of an understandable consensus algorithm. In: Proceedings of the 2014 USENIX annual technical conference (ATC). USENIX Association, Philadelphia, PA, USA, pp 305\u2013319"},{"key":"1934_CR11","doi-asserted-by":"publisher","unstructured":"Bessani AN, Sousa J, Alchieri EAP (2014) State machine replication for the masses with BFT-SMART. In: 44th Annual IEEE\/IFIP International conference on dependable systems and networks (DSN). IEEE Computer Society, Atlanta, GA, USA, pp 355\u2013362. https:\/\/doi.org\/10.1109\/DSN.2014.43","DOI":"10.1109\/DSN.2014.43"},{"key":"1934_CR12","doi-asserted-by":"publisher","unstructured":"Duan S, Zhang H (2022) Foundations of dynamic BFT. In: 43rd IEEE Symposium on security and privacy. IEEE, San Francisco, CA, USA, pp 1317\u20131334. https:\/\/doi.org\/10.1109\/SP46214.2022.9833787","DOI":"10.1109\/SP46214.2022.9833787"},{"key":"1934_CR13","doi-asserted-by":"publisher","unstructured":"Golan-Gueta G, Abraham I, Grossman S, Malkhi D, Pinkas B, Reiter MK, Seredinschi D, Tamir O, Tomescu A (2019) SBFT: A scalable and decentralized trust infrastructure. In: 49th Annual IEEE\/IFIP international conference on dependable systems and networks (DSN). IEEE, Portland, OR, USA, pp 568\u2013580. https:\/\/doi.org\/10.1109\/DSN.2019.00063","DOI":"10.1109\/DSN.2019.00063"},{"key":"1934_CR14","doi-asserted-by":"publisher","unstructured":"Stathakopoulou C, Pavlovic M, Vukolic M (2022) State machine replication scalability made simple. In: Seventeenth european conference on computer systems (EuroSys). ACM, Rennes, France, pp 17\u201333. https:\/\/doi.org\/10.1145\/3492321.3519579","DOI":"10.1145\/3492321.3519579"},{"issue":"3","key":"1934_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak RE, Pease MC (1982) The byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013401. https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans Program Lang Syst"},{"key":"1934_CR16","doi-asserted-by":"publisher","unstructured":"Abraham I, Malkhi D, Nayak K, Ren L, Yin M (2020) Sync hotstuff: Simple and practical synchronous state machine replication. In: 2020 IEEE Symposium on security and privacy. IEEE, San Francisco, CA, USA, pp 106\u2013118. https:\/\/doi.org\/10.1109\/SP40000.2020.00044","DOI":"10.1109\/SP40000.2020.00044"},{"key":"1934_CR17","unstructured":"Malkhi D, Nayak K (2023) Extended abstract: HotStuff-2: optimal two-phase responsive BFT. Preprint at https:\/\/eprint.iacr.org\/2023\/397"},{"issue":"4","key":"1934_CR18","doi-asserted-by":"publisher","first-page":"2478","DOI":"10.1109\/TDSC.2023.3308848","volume":"21","author":"MM Jalalzai","year":"2024","unstructured":"Jalalzai MM, Niu J, Feng C, Gai F (2024) Fast-hotstuff: A fast and robust BFT protocol for blockchains. IEEE Trans Dependable Secur Comput 21(4):2478\u20132493. https:\/\/doi.org\/10.1109\/TDSC.2023.3308848","journal-title":"IEEE Trans Dependable Secur Comput"},{"issue":"2","key":"1934_CR19","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork C, Lynch NA, Stockmeyer LJ (1988) Consensus in the presence of partial synchrony. J ACM 35(2):288\u2013323. https:\/\/doi.org\/10.1145\/42282.42283","journal-title":"J ACM"},{"key":"1934_CR20","doi-asserted-by":"publisher","unstructured":"Maram SKD, Zhang F, Wang L, Low A, Zhang Y, Juels A, Song D (2019) CHURP: dynamic-committee proactive secret sharing. In: Proceedings of the 2019 ACM SIGSAC conference on computer and communications security (CCS). ACM, London, UK, pp 2369\u20132386. https:\/\/doi.org\/10.1145\/3319535.3363203","DOI":"10.1145\/3319535.3363203"},{"key":"1934_CR21","doi-asserted-by":"publisher","unstructured":"Vassantlal R, Alchieri E, Ferreira B, Bessani A (2022) COBRA: dynamic proactive secret sharing for confidential BFT services. In: 43rd IEEE Symposium on security and privacy. IEEE, San Francisco, CA, USA, pp 1335\u20131353. https:\/\/doi.org\/10.1109\/SP46214.2022.9833658","DOI":"10.1109\/SP46214.2022.9833658"},{"key":"1934_CR22","unstructured":"Hu B, Zhang Z, Chen H, Zhou Y, Jiang H, Liu J (2022) DyCAPS: asynchronous proactive secret sharing for dynamic committees. Preprint at https:\/\/eprint.iacr.org\/2022\/1169"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-01934-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-01934-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-01934-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T02:31:38Z","timestamp":1746844298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-01934-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1934"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-01934-9","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,3]]},"assertion":[{"value":"18 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"We confirm that the manuscript is original, has not been published elsewhere, and is not under consideration by another publication. All authors have read and approved the final manuscript and are accountable for the content.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no Conflict of interest.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"111"}}