{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:09:39Z","timestamp":1779246579431,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61976142"],"award-info":[{"award-number":["No.61976142"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi University of Technology Foundation","award":["SLGRCQD2137"],"award-info":[{"award-number":["SLGRCQD2137"]}]},{"name":"Shaanxi University of Technology Foundation","award":["SLGYCX2536"],"award-info":[{"award-number":["SLGYCX2536"]}]},{"DOI":"10.13039\/501100013093","name":"Science and Technology Planning Project of Shenzen Municipality","doi-asserted-by":"publisher","award":["JCYJ20210324093609025"],"award-info":[{"award-number":["JCYJ20210324093609025"]}],"id":[{"id":"10.13039\/501100013093","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In distributed scenarios such as electronic voting and blockchain, signature schemes require high anonymity, collusion resistance, and efficiency. Traditional ring signatures struggle to balance dynamism and security, while dynamic threshold ring signature research remains underdeveloped. This paper proposes SM9-DTRS, a dynamic threshold ring signature scheme based on the SM9 algorithm. It adopts a dynamic threshold mechanism and reservoir sampling for real-time signer set adjustment, and optimizes bilinear pairings via precomputation. Experimental results show SM9-DTRS achieves 55.66\u00a0ms signature generation time (44.46% reduction) and 148.93\u00a0ms verification time (21.80% reduction) compared to similar schemes. Its signature length is (256\n                    <jats:italic>t<\/jats:italic>\n                    \u2009+\u2009768)-bit, scaling linearly with threshold\n                    <jats:italic>t<\/jats:italic>\n                    (instead of ring size\n                    <jats:italic>n<\/jats:italic>\n                    in traditional schemes), making it suitable for bandwidth-constrained environments. Under the random oracle model, SM9-DTRS is proven unforgeable, anonymous, and collusion-resistant based on the\n                    <jats:italic>q<\/jats:italic>\n                    -SDH assumption.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00499-7","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:01:33Z","timestamp":1779246093000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SM9-DTRS: a dynamic threshold ring signature scheme based on SM9 algorithm"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9354-4717","authenticated-orcid":false,"given":"Zeyu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8923-1486","authenticated-orcid":false,"given":"Lihua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,20]]},"reference":[{"issue":"11","key":"499_CR1","first-page":"2545","volume":"60","author":"HY An","year":"2023","unstructured":"An HY, He DB, Bao ZJ, Peng C, Luo M (2023) Ring signature based on the SM9 digital signature and its application in blockchain privacy protec-tion. J Comput Res Dev 60(11):2545\u20132554","journal-title":"J Comput Res Dev"},{"issue":"2","key":"499_CR2","first-page":"187","volume":"4","author":"AK Awasthi","year":"2007","unstructured":"Awasthi AK, Sunder L (2007) ID-based ring signature and proxy ring signa-ture schemes from bilinear pairings. Int J Netw Secur 4(2):187\u2013192","journal-title":"Int J Netw Secur"},{"issue":"1","key":"499_CR4","first-page":"75","volume":"2442","author":"E Bresson","year":"2002","unstructured":"Bresson E, Stern J, Szydlo M (2002) Threshold ring signatures and applicat-ions to ad-hoc groups. Lect Notes Comput Sci 2442(1):75\u201399","journal-title":"Lect Notes Comput Sci"},{"issue":"8","key":"499_CR5","first-page":"1231","volume":"37","author":"YQ Cai","year":"2011","unstructured":"Cai YQ, Zhang E, He JY (2011) (t,n)Threshold signature scheme withstand-ing the conspiracy attack. J Beijing Univ Technol 37(8):1231\u20131235","journal-title":"J Beijing Univ Technol"},{"key":"499_CR6","unstructured":"Chen Z Y, Liu L H, Wang S P (2025) Review of SM9 Identity Authentication S-chemes and Their Applications. Review of SM9 Identity Authentication Schemes and Their Applications 61 (05) 18\u201331"},{"issue":"1","key":"499_CR7","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11496618_17","volume":"3506","author":"SSM Chow","year":"2005","unstructured":"Chow SSM, Hui LCK, Yiu SM (2005) Identity based threshold ring signat-ure. Lect Notes Comput Sci 3506(1):218","journal-title":"Lect Notes Comput Sci"},{"key":"499_CR8","unstructured":"Cryptography Standardization Technical Committee (2017) China's SM2 an-d SM9 digital signature algorithms have officially become ISO\/IEC inte-rnational standards [EB\/OL]. (2017\u201311\u201317). http:\/\/www.gmbz.org.cn\/main\/postDetail.html?id=20180118171408 (accessed 2020\u201303\u201302)."},{"key":"499_CR9","unstructured":"Cryptography Standardization Technical Committee (2018) GM\/T0044\u20132016 'SM9 Identification Cryptography Algorithm' [EB\/OL]. (2018\u201303\u201310). htt-p:\/\/www.gmbz.org.cn\/main\/postDetail.html?id=20180322410400 (accessed 2020\u201303\u201308)."},{"key":"499_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2014.04.002","volume":"535","author":"LZ Deng","year":"2014","unstructured":"Deng LZ, Zeng JW (2014) Two new identity-based threshold ring signatu-re schemes. Theor Comput Sci 535:38\u201345","journal-title":"Theor Comput Sci"},{"issue":"12","key":"499_CR11","first-page":"95","volume":"32","author":"HM Deng","year":"2022","unstructured":"Deng HM, Peng CG, Ding HF, Ye YT (2022) A threshold ring signature sc-heme based on GM SM9 algorithm. Comput Technol Dev 32(12):95\u2013102","journal-title":"Comput Technol Dev"},{"issue":"1","key":"499_CR12","first-page":"3","volume":"718","author":"Y Desmedt","year":"1993","unstructured":"Desmedt Y, Frankel Y (1993) Threshold cryptosystems. Lecture Notes Comput Sci 718(1):3\u201314","journal-title":"Lecture Notes Comput Sci"},{"key":"499_CR13","unstructured":"Fan J X (2021) Research on Hierarchical Anonymous Voting Scheme based on Flexible Threshold Ring Signature [D]. Nanjing University of Posts a-nd Telecommunications."},{"key":"499_CR14","first-page":"132","volume":"202","author":"Z Gan","year":"2004","unstructured":"Gan Z, Chen KF (2004) A new verifiable ring signature scheme. Acta Scien-Tiarum Naturalium Universitatis Sunyatseni 202:132\u2013134","journal-title":"Acta Scien-Tiarum Naturalium Universitatis Sunyatseni"},{"issue":"4","key":"499_CR16","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/198429.198435","volume":"20","author":"K Li","year":"1994","unstructured":"Li K (1994) Reservoir-sampling algorithms of time complexity O(n(1+log(N\/n))). ACM Trans Math Softw (TOMS) 20(4):481\u2013493","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"499_CR17","doi-asserted-by":"publisher","first-page":"95507","DOI":"10.1109\/ACCESS.2021.3094902","volume":"9","author":"SG Liu","year":"2021","unstructured":"Liu SG, Chen K, Liu ZK, Wang T (2021) Secure threshold ring signature Ba-sed on SM9. IEEE Access 9:95507\u201395516","journal-title":"IEEE Access"},{"issue":"4","key":"499_CR18","first-page":"724","volume":"8","author":"C Peng","year":"2021","unstructured":"Peng C, He DB, Luo M, Huang XY, Li DW (2021) An identity-based ring sig-nature scheme for SM9 algorithm J. Cryptologic Res 8(4):724\u2013734","journal-title":"Cryptologic Res"},{"issue":"8","key":"499_CR19","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"GCCF Pereira","year":"2011","unstructured":"Pereira GCCF, Simpl\u00edcio MA Jr, Naehrig M (2011) A family of implementa-tion-friendly BN elliptic curves. J Syst Softw 84(8):1319\u20131326","journal-title":"J Syst Softw"},{"issue":"6","key":"499_CR20","first-page":"13","volume":"49","author":"JT Rao","year":"2023","unstructured":"Rao JT, Cui Z (2023) Secure e-voting protocol based on SM9 blind signature and ring signature. Comput Eng 49(6):13\u201323","journal-title":"Comput Eng"},{"issue":"1","key":"499_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-99807-7_4","volume":"11125","author":"H Ren","year":"2018","unstructured":"Ren H, Zhang P, Shentu QC, Liu JK, Yuen TH (2018) Compact ring signatu-re in the standard model for blockchain. Lect Notes Comput Sci 11125(1):50\u201365","journal-title":"Lect Notes Comput Sci"},{"key":"499_CR22","doi-asserted-by":"crossref","unstructured":"Rivest R L (2001) How to leak a secret. In: Proceedings of the 2021 International Conference on the Theory and Application of Cryptology and Information Security, 553\u2013565.","DOI":"10.1007\/3-540-45682-1_32"},{"key":"499_CR23","unstructured":"Shamir A (1984) Identity-Based Cryptosystems and Signature Schemes. Cry-pto."},{"issue":"3","key":"499_CR24","first-page":"92","volume":"35","author":"H Sun","year":"2013","unstructured":"Sun H, Zhong L, Wang AM (2013) Provably secure identity-based threshol-d ring signature in the standard model. Comput Eng Sci 35(3):92\u201396","journal-title":"Comput Eng Sci"},{"issue":"1","key":"499_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-16280-0_11","volume":"6402","author":"PP Tsang","year":"2010","unstructured":"Tsang PP, Au MH, Liu JK, Susilo W, Wong DS (2010) A suite of non-pairing ID-based threshold ring signature schemes with different levels of anonymity. Lect Notes Comput Sci 6402(1):166\u2013183","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"499_CR26","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s11460-008-0012-8","volume":"3","author":"LL Wang","year":"2008","unstructured":"Wang LL, Zhang GY, Ma CG (2008) A survey of ring signature. Front Electr Electron Eng China 3(1):10\u201319","journal-title":"Front Electr Electron Eng China"},{"key":"499_CR27","first-page":"18","volume":"1","author":"XS Xia","year":"2008","unstructured":"Xia XS, Hong F, Geng YJ, Cui GH (2008) Efficient dynamic threshold group signature scheme based on elliptic curve cryptosystem. Railw Eng Sci 1:18\u201323","journal-title":"Railw Eng Sci"},{"key":"499_CR28","unstructured":"Xie Z J, Zhang Y, Yang Q C, Song E Z (2025) A ring signature scheme based o-n domestic cryptographic algorithm SM9 [J\/OL]. Computer Science. https:\/\/link.cnki.net\/urlid\/50.1075.TP.20250226.1734.008"},{"issue":"1","key":"499_CR29","first-page":"125","volume":"41","author":"J Yu","year":"2006","unstructured":"Yu J, Li DX (2006) Hierarchical ID-based proactive threshold signature sche-me. J Shandong Univ 41(1):125\u2013129","journal-title":"J Shandong Univ"},{"issue":"7","key":"499_CR30","first-page":"2015","volume":"32","author":"T Yu","year":"2026","unstructured":"Yu T, Zhao ZM (2026) Ren X F (2012) Efficient identity-based ring signature in sta-ndard model. J Comput Appl 32(7):2015\u20132017","journal-title":"J Comput Appl"},{"issue":"1","key":"499_CR31","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-36178-2_33","volume":"2501","author":"FG Zhang","year":"2002","unstructured":"Zhang FG, Kim KJ (2002) Id-based blind signature and ring signature from pairings. Lect Notes Comput Sci 2501(1):533\u2013547","journal-title":"Lect Notes Comput Sci"},{"issue":"5","key":"499_CR32","first-page":"28","volume":"25","author":"XF Zhang","year":"2020","unstructured":"Zhang XF, Peng H (2020) A ring signature scheme based on SM9 algorithm. J xi\u2019an Univ Posts Telecommun 25(5):28\u201332","journal-title":"J xi\u2019an Univ Posts Telecommun"},{"issue":"1","key":"499_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume":"2947","author":"FG Zhang","year":"2004","unstructured":"Zhang FG, Safavi-Naini R, Susilo W (2004) An efficient signature scheme fr-om bilinear pairings and its applications. Lecture Notes Comput Sci 2947(1):277\u2013290","journal-title":"Lecture Notes Comput Sci"},{"issue":"5","key":"499_CR34","first-page":"905","volume":"50","author":"WF Zhang","year":"2015","unstructured":"Zhang WF, Xiong D, Wang XM (2015) A secure electronic voting scheme b-ased on linkable ring signature against fraud from the third party. Xin-an Jiaotong Daxue Xuebao\/j Southwest Jiaotong Univ 50(5):905\u2013911","journal-title":"Xin-an Jiaotong Daxue Xuebao\/j Southwest Jiaotong Univ"},{"issue":"4","key":"499_CR35","first-page":"1019","volume":"46","author":"YQ Zhao","year":"2018","unstructured":"Zhao YQ, Lai QQ, Yu Y, Yang B, Zhao Y (2018) ID-based ring signature in t-he standard model. Acta Electron Sin 46(4):1019\u20131024","journal-title":"Acta Electron Sin"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00499-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T03:01:47Z","timestamp":1779246107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00499-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,20]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["499"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00499-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,20]]},"assertion":[{"value":"28 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2026","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 declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"71"}}