{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T05:49:47Z","timestamp":1758347387135,"version":"3.44.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Beijing Municipal Science and Technology Project","award":["Z231100005923047"],"award-info":[{"award-number":["Z231100005923047"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172411","U2336205"],"award-info":[{"award-number":["62172411","U2336205"]}],"id":[{"id":"10.13039\/501100001809","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>Threshold signatures are essential for fault-tolerant applications among groups of users, such as in blockchain transactions. SM2 is a digital signature standard in China and ISO, yet its threshold variant is less developed compared to international alternatives such as ECDSA. Specifically, modern threshold signatures offer identifiable abort (ID-abort) and non-interactive online signing, but these features make threshold-SM2 costly, limiting its real-world application. In this paper, we introduce a fast threshold-SM2 with ID-abort and non-interactive online signing. We design a technology for ID-abort by checking hard-to-verify pseudononces based on their mappings in a group. By putting the message-independent computations to a presigning phase, we achieve a non-interactive online signing. We prove that our threshold-SM2 is secure in the dishonest majority model and implement it using Golang. Theoretical analysis and experimental results demonstrate that our threshold-SM2 provides rich functionalities with good performance, significantly reducing computational and communication costs compared to the state-of-the-art threshold-SM2 by Liang and Chen (FCS\u2019 24).<\/jats:p>","DOI":"10.1186\/s42400-025-00371-8","type":"journal-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T02:02:38Z","timestamp":1758247358000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster threshold-SM2 with identifiable abort and non-interactive online signing"],"prefix":"10.1186","volume":"8","author":[{"given":"Yunlv","family":"Lv","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4221-1311","authenticated-orcid":false,"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Zeshuo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,19]]},"reference":[{"issue":"7","key":"371_CR1","doi-asserted-by":"publisher","first-page":"155014772094402","DOI":"10.1177\/1550147720944025","volume":"16","author":"M Ahmad","year":"2020","unstructured":"Ahmad M, Rehman AU, Ayub N, Alshehri MD, Khan MA, Hameed A, Yetgin H (2020) Security, usability, and biometric authentication scheme for electronic voting using multiple keys. Int J Distrib Sens Netw 16(7):1550147720944025","journal-title":"Int J Distrib Sens Netw"},{"key":"371_CR2","doi-asserted-by":"crossref","unstructured":"Canetti R, Gennaro R, Goldfeder S, Makriyannis N, Peled U (2020) UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security, pp 1769\u20131787","DOI":"10.1145\/3372297.3423367"},{"key":"371_CR3","doi-asserted-by":"crossref","unstructured":"Castagnos G, Catalano D, Laguillaumie F, Savasta F, Tucker I (2020) Bandwidth-efficient threshold EC-DSA. In: IACR international conference on public-key cryptography. Springer, pp 266\u2013296","DOI":"10.1007\/978-3-030-45388-6_10"},{"issue":"02","key":"371_CR4","first-page":"540","volume":"52","author":"Y Cheng","year":"2024","unstructured":"Cheng Y, Liu Q, Liang Z, Yu S (2024) A strictly provably secure two-party collaborative SM2 signature protocol. J Electron 52(02):540\u2013549","journal-title":"J Electron"},{"issue":"2","key":"371_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s00453-011-9593-3","volume":"64","author":"SSM Chow","year":"2012","unstructured":"Chow SSM, Ma C, Weng J (2012) Zero-knowledge argument for simultaneous discrete logarithms. Algorithmica 64(2):246\u2013266","journal-title":"Algorithmica"},{"key":"371_CR6","doi-asserted-by":"crossref","unstructured":"Deng Y, Ma S, Zhang X, Wang H, Song X, Xie X (2021) Promise $$\\Sigma $$-protocol: how to construct efficient threshold ECDSA from encryptions based on class groups. In: International conference on the theory and application of cryptology and information security. Springer, pp 557\u2013586","DOI":"10.1007\/978-3-030-92068-5_19"},{"key":"371_CR7","doi-asserted-by":"crossref","unstructured":"Desmedt Y, Frankel Y (1989) Threshold cryptosystems. In: Proceedings on advances in cryptology, pp 307\u2013315","DOI":"10.1007\/0-387-34805-0_28"},{"key":"371_CR8","unstructured":"Dhinakaran D, Selvaraj D, Dharini N, Raja SE, Priya C (2024) Towards a novel privacy-preserving distributed multiparty data outsourcing scheme for cloud computing with quantum key distribution. arXiv preprint arXiv:2407.18923"},{"key":"371_CR9","doi-asserted-by":"crossref","unstructured":"Doerner J, Kondi Y, Lee E, Shelat A (2019) Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE symposium on security and privacy (SP). IEEE, pp 1051\u20131066","DOI":"10.1109\/SP.2019.00024"},{"key":"371_CR10","doi-asserted-by":"crossref","unstructured":"Dolev D, Dwork C, Naor M (1991) Non-malleable cryptography (extended abstract). In: Proceedings of the 23rd annual ACM symposium on theory of computing, May 5\u20138, 1991, New Orleans, Louisiana, USA. ACM, pp 542\u2013552","DOI":"10.1145\/103418.103474"},{"issue":"4","key":"371_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469\u2013472","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"371_CR12","first-page":"6619498","volume":"2020","author":"M Faisal","year":"2020","unstructured":"Faisal M, Ali I, Khan MS, Kim J, Kim SM (2020) Cyber security and key management issues for internet of things: techniques, requirements, and challenges. Complexity 2020(1):6619498","journal-title":"Complexity"},{"key":"371_CR13","doi-asserted-by":"crossref","unstructured":"Feldman P (1987) A practical scheme for non-interactive verifiable secret sharing. In: 28th annual symposium on foundations of computer science (sfcs 1987). IEEE, pp 427\u2013438","DOI":"10.1109\/SFCS.1987.4"},{"issue":"10","key":"371_CR14","first-page":"2136","volume":"57","author":"Q Feng","year":"2020","unstructured":"Feng Q, He D, Luo M, Li L (2020) Lightweight two-party collaborative SM2 signature in mobile internet environment. J Comput Res Dev 57(10):2136\u20132146","journal-title":"J Comput Res Dev"},{"key":"371_CR15","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A (1986) How to prove yourself: practical solutions to identification and signature problems. In: Advances in cryptology\u2014CRYPTO \u201986, Santa Barbara, California, USA, 1986, Proceedings, vol 263. Springer, pp 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"371_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro R, Goldfeder S (2018) Fast multiparty threshold ECDSA with fast trustless setup. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 1179\u20131194","DOI":"10.1145\/3243734.3243859"},{"key":"371_CR17","unstructured":"Gennaro R, Goldfeder S (2020) One round threshold ECDSA with identifiable abort. IACR Cryptol. ePrint Arch"},{"key":"371_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro R, Jarecki S, Krawczyk H, Rabin T (1996). Robust threshold DSS signatures. In: Advances in cryptology-EUROCRYPT\u201996: international conference on the theory and application of cryptographic techniques Saragossa, Spain, May 12\u201316, 1996 Proceedings 15. Springer, pp 354\u2013371","DOI":"10.1007\/3-540-68339-9_31"},{"key":"371_CR19","doi-asserted-by":"crossref","unstructured":"Gennaro R, Micciancio D, Rabin T (1998) An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Proceedings of the 5th ACM conference on computer and communications security, 67\u201372","DOI":"10.1145\/288090.288108"},{"key":"371_CR20","unstructured":"GmsmLib https:\/\/github.com\/tjfoc\/gmsm"},{"key":"371_CR21","doi-asserted-by":"publisher","first-page":"102738","DOI":"10.1016\/j.sysarc.2022.102738","volume":"132","author":"G Han","year":"2022","unstructured":"Han G, Bai X, Geng S, Qin B (2022) Efficient two-party SM2 signing protocol based on secret sharing. J Syst Archit 132:102738","journal-title":"J Syst Archit"},{"issue":"01","key":"371_CR22","first-page":"1","volume":"48","author":"H Hou","year":"2020","unstructured":"Hou H, Yang B, Zhang L, Zhang M (2020) Secure two-party cooperative SM2 signature algorithm. J Electron 48(01):1\u20138","journal-title":"J Electron"},{"issue":"03","key":"371_CR23","first-page":"19","volume":"9","author":"P Huang","year":"2024","unstructured":"Huang P, Lin C, Wu W, He D (2024) Blockchain anonymous key exchange protocol based on SM2 digital signature. J Inf Secur 9(03):19\u201328","journal-title":"J Inf Secur"},{"key":"371_CR24","unstructured":"ISO (2018) ISO\/IEC 10118-3:2018 IT security techniques\u2014hash-functions part 3: Dedicated hash-functions. International Organization for Standardization"},{"key":"371_CR25","unstructured":"ISO (2018) ISO\/IEC 14888-3:2018 IT security techniques-digital signatures with appendix-part 3: discrete logarithm based mechanisms. International Organization for Standardization"},{"issue":"2","key":"371_CR26","first-page":"897","volume":"10","author":"Y Jie","year":"2016","unstructured":"Jie Y, Yu L, Li-yun C, Wei N (2016) A SM2 elliptic curve threshold signature scheme without a trusted center. KSII Trans Internet Inf Syst (TIIS) 10(2):897\u2013913","journal-title":"KSII Trans Internet Inf Syst (TIIS)"},{"key":"371_CR27","doi-asserted-by":"crossref","unstructured":"Keller M (2020) MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security, pp 1575\u20131590","DOI":"10.1145\/3372297.3417872"},{"issue":"1","key":"371_CR28","doi-asserted-by":"publisher","first-page":"181802","DOI":"10.1007\/s11704-022-2288-x","volume":"18","author":"H Liang","year":"2024","unstructured":"Liang H, Chen J (2024) Non-interactive SM2 threshold signature scheme with identifiable abort. Front Comput Sci 18(1):181802","journal-title":"Front Comput Sci"},{"key":"371_CR29","doi-asserted-by":"crossref","unstructured":"Lindell Y, Nof A (2018) Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, pp 1837\u20131854","DOI":"10.1145\/3243734.3243788"},{"key":"371_CR30","unstructured":"Liu Z, Lin J (2024) A framework for two-party threshold computation scheme of SM2 digital signature algorithm. J Softw, pp 1\u201324"},{"key":"371_CR31","doi-asserted-by":"crossref","unstructured":"Li X, Wang H, Chen J, Li S, Sun Y, Su Y (2023) Secure multi-party SM2 signature based on SPDZ protocol. In: International conference on information security and cryptology. Springer, pp 85\u2013103","DOI":"10.1007\/978-981-97-0942-7_5"},{"key":"371_CR32","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. Consulted"},{"key":"371_CR33","unstructured":"NIST (2023) The elliptic curve digital signature algorithm (ECDSA). Available at https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-5.pdf"},{"key":"371_CR34","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques. Springer, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"2","key":"371_CR35","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"issue":"3","key":"371_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C Schnorr","year":"1991","unstructured":"Schnorr C (1991) Efficient signature generation by smart cards. J Cryptol 4(3):161\u2013174","journal-title":"J Cryptol"},{"issue":"2","key":"371_CR37","first-page":"155","volume":"1","author":"M Shang","year":"2014","unstructured":"Shang M, Ma Y, Lin J, Jin J (2014) A threshold scheme for SM2 elliptic curve cryptographic ateorithm. J Cryptol Res 1(2):155\u2013166","journal-title":"J Cryptol Res"},{"key":"371_CR38","unstructured":"SM2Lib https:\/\/github.com\/tjfoc\/gmsm\/tree\/master\/sm2"},{"key":"371_CR39","unstructured":"Tang Z, Wang Z (2022) Threshold SM2 signature scheme. In: Journal of Nanjing University of posts and telecommunications (natural science edition), pp 85\u201395"},{"key":"371_CR40","unstructured":"Thorchain https:\/\/gitlab.com\/thorchain\/tss\/tss-lib"},{"key":"371_CR41","unstructured":"TssLib https:\/\/github.com\/bnb-chain\/tss-lib\/"},{"key":"371_CR42","doi-asserted-by":"crossref","unstructured":"Wong HW, Ma JP, Yin HH, Chow SS (2023) Real threshold ECDSA. In: NDSS","DOI":"10.14722\/ndss.2023.24817"},{"key":"371_CR43","doi-asserted-by":"crossref","unstructured":"Yuen TH, Cui H, Xie X (2021) Compact zero-knowledge proofs for threshold ECDSA with trustless setup. In: IACR international conference on public-key cryptography. Springer, pp 481\u2013511","DOI":"10.1007\/978-3-030-75245-3_18"},{"key":"371_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-018-8106-9","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, He D, Zhang M, Choo K-KR (2020) A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm. Front Comput Sci 14:1\u201314","journal-title":"Front Comput Sci"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00371-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00371-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00371-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T02:02:54Z","timestamp":1758247374000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-025-00371-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,19]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["371"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00371-8","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2025,9,19]]},"assertion":[{"value":"5 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 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 declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"70"}}