{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:04:27Z","timestamp":1780448667544,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"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":["U23B2021"],"award-info":[{"award-number":["U23B2021"]}],"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>\n                    Traditional threshold signature schemes, which are based on number-theoretic problems, are vulnerable to attacks in quantum computing environments. Moreover, these schemes incur high communication and computational costs among nodes, which pose significant challenges for meeting the stringent requirements of interactive security and real-time performance in power grid load regulation systems. To address these challenges, this paper introduces a post-quantum threshold signature scheme based on CRYSTALS-Dilithium (CDTS) specifically designed for power grid load regulation systems. Constructed within the Fiat-Shamir framework and integrating a CRYSTALS-Dilithium-based threshold signature, this scheme effectively ensures the system\u2019s fault tolerance and security in the face of quantum computing threats. In terms of efficiency, the CDTS scheme significantly reduces computational overheads through the introduction of rejection sampling techniques and the optimization of the number-theoretic transform algorithm. To further enhance the scheme\u2019s adaptability to the dynamic nature of power grid load regulation, an innovative dynamic threshold adjustment mechanism is proposed. This mechanism monitors load changes in real-time within a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\Delta T$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>\u0394<\/mml:mi>\n                            <mml:mi>T<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    time window, allowing for flexible adjustments to the threshold parameters. Security analysis confirms that the proposed scheme satisfies the security requirements of power grid load regulation systems, making it a robust solution for ensuring secure and efficient load regulation in the quantum era. We conducted rigorous experimental comparisons under the same security level (NIST Level 3) and system scale (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$th=5, n=10$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>t<\/mml:mi>\n                            <mml:mi>h<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>5<\/mml:mn>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mi>n<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>10<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ), the sizes of the public key (1.32 KB), private key (2.01 KB), and signature (2.45 KB) of the CDTS scheme are almost identical to those of the original Dilithium scheme. This data demonstrates that the threshold construction we proposed is nearly lossless in terms of storage efficiency, significantly outperforming the exponential overhead growth typically brought by traditional scheme. Through rigorous software testing and verification, we evaluated the performance of the CDTS scheme by randomly generating a 59-byte message and iteratively executing the signing process 10,000 times. The results indicate that the CDTS scheme achieves a complete signature and verification process in an average of 506.73 microseconds. This efficiency makes the CDTS scheme highly feasible for practical applications, particularly in environments requiring rapid and secure transaction processing.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00516-9","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:02:59Z","timestamp":1780444979000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cdts: a post-quantum threshold signature scheme based on CRYSTALS-dilithium of power grid load regulation system"],"prefix":"10.1186","volume":"9","author":[{"given":"Mi","family":"Wen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2663-0481","authenticated-orcid":false,"given":"Peiqi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"key":"516_CR1","volume":"73","author":"AA Pandit","year":"2023","unstructured":"Pandit AA, Kumar A, Mishra A (2023) Lwr-based quantum-safe pseudo-random number generator. J Inf Secur Appl 73:103431","journal-title":"J Inf Secur Appl"},{"key":"516_CR2","doi-asserted-by":"publisher","unstructured":"Beckwith L, Nguyen DT, Gaj K (2021) High-performance hardware implementation of crystals-dilithium. In: 2021 International Conference on Field-Programmable Technology (ICFPT), pp. 1\u201310 . https:\/\/doi.org\/10.1109\/ICFPT52863.2021.9609917","DOI":"10.1109\/ICFPT52863.2021.9609917"},{"key":"516_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume":"1999","author":"R Canetti","year":"1999","unstructured":"Canetti R, Gennaro R, Jarecki S, Krawczyk H, Rabin T (1999) Adaptive security for threshold cryptosystems. Adv Cryptol CRYPTO 1999:98\u2013115. https:\/\/doi.org\/10.1007\/3-540-48405-1_7","journal-title":"Adv Cryptol CRYPTO"},{"issue":"2","key":"516_CR4","first-page":"1003","volume":"13","author":"J Chen","year":"2019","unstructured":"Chen J, Hu Y, Gao W, Li H (2019) Lattice-based threshold ring signature with message block sharing. KSII Trans Internet Inf Syst 13(2):1003\u20131019","journal-title":"KSII Trans Internet Inf Syst"},{"key":"516_CR5","doi-asserted-by":"publisher","unstructured":"Doerner J, Kondi Y, Lee E, Shelat A (2024) Threshold ecdsa in three rounds. In: 2024 IEEE symposium on security and privacy (SP), pp. 3053\u20133071 https:\/\/doi.org\/10.1109\/SP54263.2024.00178","DOI":"10.1109\/SP54263.2024.00178"},{"key":"516_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-025-09549-2","author":"T Espitau","year":"2025","unstructured":"Espitau T, Katsumata S, Takemure K (2025) Two-round threshold signature from algebraic one-more learning with errors. J Cryptol. https:\/\/doi.org\/10.1007\/s00145-025-09549-2","journal-title":"J Cryptol"},{"key":"516_CR7","first-page":"281","volume":"12471","author":"AP Fournaris","year":"2020","unstructured":"Fournaris AP, Dimopoulos C, Koufopavlou O (2020) Profiling Dilithium digital signature traces for correlation differential side channel attacks. Embedded Comput Syst Architect Model Simul 12471:281\u2013294","journal-title":"Embedded Comput Syst Architect Model Simul"},{"issue":"2","key":"516_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1049\/cje.2018.12.005","volume":"28","author":"W Gao","year":"2019","unstructured":"Gao W, Hu Y, Wang B, Chen J, Wang X (2019) Efficient ring signature scheme without random oracle from lattices. Chin J Electron 28(2):266\u2013272","journal-title":"Chin J Electron"},{"key":"516_CR9","doi-asserted-by":"publisher","unstructured":"Gur KD, Katz J, Silde T (2023) Two-Round Threshold Lattice-Based Signatures from Threshold Homomorphic Encryption. Cryptology ePrint Archive, Paper 2023\/1318 https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12 . https:\/\/eprint.iacr.org\/2023\/1318","DOI":"10.1007\/978-3-031-62746-0_12"},{"issue":"11","key":"516_CR10","first-page":"3461","volume":"39","author":"X Huang","year":"2022","unstructured":"Huang X, Du Y (2022) Efficient signature scheme on ideal lattice. Appl Res Comput 39(11):3461\u20133464","journal-title":"Appl Res Comput"},{"key":"516_CR11","volume":"61","author":"H Li","year":"2021","unstructured":"Li H, Fu X, Wang Y (2021) Pscpac: Post-quantum secure certificateless public auditing scheme in cloud storage. J Inf Secur Appl 61:102927","journal-title":"J Inf Secur Appl"},{"key":"516_CR12","volume":"75","author":"H Yu","year":"2023","unstructured":"Yu H, Hui W (2023) Certificateless ring signature from ntru lattice for electronic voting. J Inf Secur Appl 75:103496","journal-title":"J Inf Secur Appl"},{"issue":"12","key":"516_CR13","doi-asserted-by":"publisher","first-page":"9706","DOI":"10.1109\/JIOT.2020.3022358","volume":"8","author":"Z He","year":"2021","unstructured":"He Z, Zhang T, Lee RB (2021) Attacking and protecting data privacy in edge\u2013cloud collaborative inference systems. IEEE Internet Things J 8(12):9706\u20139716","journal-title":"IEEE Internet Things J"},{"key":"516_CR14","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TIFS.2022.3181848","volume":"17","author":"Y Jiang","year":"2022","unstructured":"Jiang Y, Zhang K, Qian Y, Zhou L (2022) Anonymous and efficient authentication scheme for privacy-preserving distributed learning. IEEE Trans Inf Forensics Secur 17:2227\u20132240","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"516_CR15","doi-asserted-by":"publisher","unstructured":"Karabulut E, Alkim E, Aysu A (2021) Single-trace side-channel attacks on $$\\omega$$-small polynomial sampling: with applications to ntru, ntru prime, and crystals-dilithium. In: 2021 IEEE international symposium on hardware oriented security and trust (HOST), 35\u201345 (2021).https:\/\/doi.org\/10.1109\/HOST49136.2021.9702284","DOI":"10.1109\/HOST49136.2021.9702284"},{"issue":"6","key":"516_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/MSEC.2024.3463915","volume":"22","author":"C Komlo","year":"2024","unstructured":"Komlo C (2024) Threshold signatures. IEEE Secur Priv 22(6):85\u201388","journal-title":"IEEE Secur Priv"},{"key":"516_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ins.2020.08.032","volume":"546","author":"P Li","year":"2020","unstructured":"Li P, Gao J (2020) An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems. Inf Sci 546:253\u2013264","journal-title":"Inf Sci"},{"key":"516_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"GL Long","year":"2001","unstructured":"Long GL (2001) Grover algorithm with zero theoretical failure rate. Phys Rev A 64:022307","journal-title":"Phys Rev A"},{"key":"516_CR19","doi-asserted-by":"crossref","unstructured":"Land G, Sasdrich P, G\u00fcneysu T (2021) A hard crystal - implementing dilithium on reconfigurable hardware. CARDIS 2021. Lecture Notes in Computer Science, 210\u2013230","DOI":"10.1007\/978-3-030-97348-3_12"},{"key":"516_CR20","doi-asserted-by":"publisher","unstructured":"Le HQ, Susilo W, Khuc TX, Bui MK, Duong DH (2019) A blind signature from module latices. In: 2019 IEEE conference on dependable and secure computing (DSC), pp. 1\u20138 https:\/\/doi.org\/10.1109\/DSC47296.2019.8937613","DOI":"10.1109\/DSC47296.2019.8937613"},{"key":"516_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-981-16-7476-1_3","volume":"1453","author":"X Li","year":"2021","unstructured":"Li X, Sun X, Li F (2021) A group blind signature scheme for privacy protection of power big data in smart grid. Data Mining Big Data 1453:23\u201334","journal-title":"Data Mining Big Data"},{"key":"516_CR22","first-page":"146","volume":"49","author":"B Li","year":"2023","unstructured":"Li B, Wu P, Wang D, An H, He D (2023) A certificateless online\/offline signcryption scheme for power terminal equipment. Comput Eng 49:146\u2013151160","journal-title":"Comput Eng"},{"key":"516_CR23","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume":"2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky V (2009) Fiat-shamir with aborts: applications to lattice and factoring-based signatures. Adv Cryptol ASIACRYPT 2009:598\u2013616. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","journal-title":"Adv Cryptol ASIACRYPT"},{"issue":"4","key":"516_CR24","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1109\/JIOT.2019.2962553","volume":"7","author":"R Ma","year":"2020","unstructured":"Ma R, Cao J, Feng D, Li H (2020) Laa: lattice-based access authentication scheme for iot in space information networks. IEEE Internet Things J 7(4):2791\u20132805","journal-title":"IEEE Internet Things J"},{"key":"516_CR25","volume":"73","author":"MS \u015eahin","year":"2023","unstructured":"\u015eahin MS, Akleylek S (2023) A survey of quantum secure group signature schemes: lattice-based approach. J Inf Secur Appl 73:103432","journal-title":"J Inf Secur Appl"},{"key":"516_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-44534-8_19","volume":"12083","author":"DT Nguyen","year":"2020","unstructured":"Nguyen DT, Dang VB, Gaj K (2020) High-level synthesis in implementing and benchmarking number theoretic transform in lattice-based post-quantum cryptography using software\/hardware codesign Architectures, Tools, and Applications. ARC 2020. Lect Notes Comput Sci 12083:247\u2013257","journal-title":"Lect Notes Comput Sci"},{"key":"516_CR27","doi-asserted-by":"publisher","unstructured":"Nagy A, Fregan B, Rajnai Z (2024) Cyber defense in quantum technologies: an overview. In: 2024 IEEE 22nd jubilee international symposium on intelligent systems and informatics (SISY), pp. 000045\u2013000052 .https:\/\/doi.org\/10.1109\/SISY62279.2024.10737598","DOI":"10.1109\/SISY62279.2024.10737598"},{"issue":"6","key":"516_CR28","doi-asserted-by":"publisher","first-page":"891","DOI":"10.3390\/electronics11060891","volume":"11","author":"TT Nguyen","year":"2022","unstructured":"Nguyen TT, Nguyen TTB, Lee H (2022) An analysis of hardware design of mlwe-based public-key encryption and key-establishment algorithms. Electronics 11(6):891","journal-title":"Electronics"},{"issue":"6","key":"516_CR29","first-page":"13","volume":"49","author":"J Rao","year":"2023","unstructured":"Rao J, Cui Z (2023) Secure e-voting protocol based on sm9 blind signature and ring signature. Comput Eng 49(6):13\u20132333","journal-title":"Comput Eng"},{"key":"516_CR30","doi-asserted-by":"publisher","unstructured":"Ricci S, Malina L, Jedlicka P, Sm\u00e9kal D, Hajny J, Cibik P, Dzurenda P, Dobias P (2021) Implementing crystals-dilithium signature scheme on fpgas. In: proceedings of the 16th international conference on availability, reliability and security. ARES \u201921, New York, USA https:\/\/doi.org\/10.1145\/3465481.3465756","DOI":"10.1145\/3465481.3465756"},{"key":"516_CR31","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-39555-5_9","volume":"9696","author":"R Gennaro","year":"2016","unstructured":"Gennaro R, Goldfeder S, Narayanan A (2016) Threshold-optimal dsa\/ecdsa signatures and an application to bitcoin wallet security. Appl Cryptogr Netw Secur 9696:156\u2013174","journal-title":"Appl Cryptogr Netw Secur"},{"key":"516_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2024.103960","volume":"93","author":"D Teng","year":"2025","unstructured":"Teng D, Yao Y (2025) Signer revocability for threshold ring signatures. Comput Stand Interfaces 93:103960","journal-title":"Comput Stand Interfaces"},{"key":"516_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-981-15-0818-9_11","volume":"1105","author":"Q Wang","year":"2019","unstructured":"Wang Q, Chen J, Zhuang L (2019) Batch verification of linkable ring signature in smart grid. Front Cyber Secur 1105:161\u2013176","journal-title":"Front Cyber Secur"},{"key":"516_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-024-4177-5","volume":"67","author":"M Wang","year":"2024","unstructured":"Wang M, Long G (2024) Lattice-based access authentication scheme for quantum communication networks. Sci China Inf Sci 67:222501","journal-title":"Sci China Inf Sci"},{"key":"516_CR35","volume":"70","author":"H Wang","year":"2021","unstructured":"Wang H, Ma W (2021) Dynamic threshold ecdsa signature and application to asset custody in blockchain. J Inf Secur Appl 70:102805","journal-title":"J Inf Secur Appl"},{"key":"516_CR36","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1007\/s11277-022-09809-5","volume":"126","author":"H Wang","year":"2022","unstructured":"Wang H, Wang L, Wen M (2022) A lightweight certificateless aggregate ring signature scheme for privacy protection in smart grids. Wireless Pers Commun 126:1577\u20131599","journal-title":"Wireless Pers Commun"},{"issue":"7","key":"516_CR37","first-page":"184","volume":"45","author":"Y Yang","year":"2024","unstructured":"Yang Y, Chang X, Shi H (2024) A blind signature scheme based on crystals-dilithium. J Commun 45(7):184\u2013195","journal-title":"J Commun"},{"issue":"11","key":"516_CR38","first-page":"180","volume":"40","author":"Y Yang","year":"2019","unstructured":"Yang Y, Han X, Huang J et al (2019) Bidirectional authentication key agreement protocol supporting identity\u2019s privacy preservation based on rlwe. J Commun 40(11):180\u2013186","journal-title":"J Commun"},{"key":"516_CR39","volume":"70","author":"H Yu","year":"2022","unstructured":"Yu H, Wang H (2022) Elliptic curve threshold signature scheme for blockchain. J Inf Secur Appl 70:103345","journal-title":"J Inf Secur Appl"},{"issue":"3","key":"516_CR40","first-page":"93","volume":"27","author":"Y Yang","year":"2020","unstructured":"Yang Y, Zhang J, Huang J et al (2020) Improved authenticated key agreement protocol based on bi-isis problem. J China Univ Posts Telecommun 27(3):93\u2013102","journal-title":"J China Univ Posts Telecommun"},{"key":"516_CR41","doi-asserted-by":"publisher","unstructured":"Zhang T, Chen L, Han W, Lin H, Xu A, Zhou Z, Chen Z, Jiang Y, Zhang Y (2021) Security protection technology of electrical power system based on edge computing. In: 2021 IEEE international conference on power electronics, computer applications (ICPECA), 254\u2013258 https:\/\/doi.org\/10.1109\/ICPECA51329.2021.9362710","DOI":"10.1109\/ICPECA51329.2021.9362710"},{"issue":"02","key":"516_CR42","first-page":"193","volume":"32","author":"S Zhang","year":"2019","unstructured":"Zhang S (2019) A threshold signature scheme based on self-bilinear pairing algorithm over elliptic curves. J Hainan Normal Univ (Natural Science) 32(02):193\u2013198","journal-title":"J Hainan Normal Univ (Natural Science)"},{"key":"516_CR43","doi-asserted-by":"publisher","first-page":"27251","DOI":"10.1109\/ACCESS.2018.2833103","volume":"6","author":"P Zhang","year":"2018","unstructured":"Zhang P, Jiang H, Zheng Z, Hu P, Xu Q (2018) A new post-quantum threshold signature from lattice assumptions. IEEE Access 6:27251\u201327258","journal-title":"IEEE Access"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00516-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:03:03Z","timestamp":1780444983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00516-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,3]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00516-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,3]]},"assertion":[{"value":"23 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"82"}}