{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:40:41Z","timestamp":1770284441134,"version":"3.49.0"},"reference-count":36,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":290,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202197"],"award-info":[{"award-number":["62202197"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102137"],"award-info":[{"award-number":["62102137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>Large language models (LLMs) have brought significant advancements to artificial intelligence, particularly in understanding and generating human language. However, concerns over management burden and data security have grown alongside their capabilities. To solve the problem, we design a blockchain\u2010based distributed LLM framework, where LLM works in the distributed mode and its outputs can be stored and verified on a blockchain to ensure integrity, transparency, and traceability. In addition, a multiparty signature\u2010based authentication mechanism is necessary to ensure stakeholder consensus before publication. To address these requirements, we propose a threshold elliptic curve digital signature algorithm that counters malicious adversaries in environments with three or more participants. Our approach relies on discrete logarithmic zero\u2010knowledge proofs and Feldman verifiable secret sharing, reducing complexity by forgoing multiplication triple protocols. When compared with some related schemes, this optimization speeds up both the key generation and signing phases with constant rounds while maintaining security against malicious adversaries.<\/jats:p>","DOI":"10.1049\/2024\/2252865","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T07:05:58Z","timestamp":1729148758000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Multiparty Threshold ECDSA Protocol against Malicious Adversaries for Blockchain\u2010Based LLMs"],"prefix":"10.1049","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1309-8786","authenticated-orcid":false,"given":"Jing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9233-3246","authenticated-orcid":false,"given":"Xue","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7724-2267","authenticated-orcid":false,"given":"Yingjie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7830-5133","authenticated-orcid":false,"given":"Yudi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"e_1_2_11_1_2","unstructured":"ZhaoW. X. ZhouK. LiJ. TangT. WangX. HouY. MinY. ZhangB. ZhangJ. DongZ. DuY. YangC. ChenY. ChenZ. JiangJ. RenR. LiY. TangX. LiuZ. LiuP. NieJ.-Y. andWenJ.-R. A survey of large language models 2023."},{"key":"e_1_2_11_2_2","doi-asserted-by":"crossref","unstructured":"SarsaS. DennyP. HellasA. andLeinonenJ. Automatic generation of programming exercises and code explanations using large language models 1 Proceedings of the 2022 ACM Conference on International Computing Education Research 2022 ACM 27\u201343 https:\/\/doi.org\/10.1145\/3501385.3543957.","DOI":"10.1145\/3501385.3543957"},{"key":"e_1_2_11_3_2","unstructured":"GPT-4 https:\/\/openai.com\/research\/gpt-4."},{"key":"e_1_2_11_4_2","unstructured":"Google Introducing PaLM 2 2023 https:\/\/blog.google\/technology\/ai\/google-palm-2-ai-large-language-model\/."},{"key":"e_1_2_11_5_2","doi-asserted-by":"crossref","unstructured":"XiaoC. XuS. X. ZhangK. WangY. andXiaL. Evaluating reading comprehension exercises generated by LLMs: a showcase of ChatGPT in education applications Proceedings of the 18th Workshop on Innovative Use of NLP for Building Educational Applications (BEA 2023) 2023 Association for Computational Linguistics 610\u2013625 https:\/\/doi.org\/10.18653\/v1\/2023.bea-1.52.","DOI":"10.18653\/v1\/2023.bea-1.52"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41591-023-02448-8"},{"key":"e_1_2_11_7_2","unstructured":"SpathariotiS. E. RothschildD. M. GoldsteinD. G. andHofmanJ. M. Comparing traditional and LLM-based search for consumer choice: a randomized experiment 2023."},{"key":"e_1_2_11_8_2","unstructured":"SpairR. Mastering the management of large language models for optimal generative AI performance 2023 https:\/\/www.linkedin.com\/pulse\/mastering-management-large-language-models-optimal-ai-rick-spair--w5sge\/."},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.10206"},{"key":"e_1_2_11_10_2","unstructured":"NakamotoS. Bitcoin: a peer-to-peer electronic cash system 2008."},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2024.3369551"},{"key":"e_1_2_11_12_2","unstructured":"RizviS. Blockchain-based LLMs: a game changer for data privacy protection 2023 DATAVERSITY."},{"key":"e_1_2_11_13_2","unstructured":"HestonT. F. Perspective chapter: integrating large language models and blockchain in telemedicine 2024."},{"key":"e_1_2_11_14_2","doi-asserted-by":"crossref","unstructured":"DongC. Securing UAV delivery systems with blockchain and large language models: an innovative logistics solution 2024.","DOI":"10.1109\/MiTA60795.2024.10751689"},{"key":"e_1_2_11_15_2","doi-asserted-by":"crossref","unstructured":"BouchihaM. A. TelnoffQ. BakkaliS. ChampagnatR. RabahM. CoustatyM. B. I. andGhamri-DoudaneY. LLMChain: blockchain-based reputation system for sharing and evaluating large language models 2024 https:\/\/doi.org\/10.1109\/COMPSAC61105.2024.00067.","DOI":"10.1109\/COMPSAC61105.2024.00067"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3005909"},{"key":"e_1_2_11_17_2","doi-asserted-by":"crossref","unstructured":"WongH. W. H. MaJ. P. K. YinH. H. F. andChowS. S. M. How (Not) to build threshold EdDSA Proceedings of the 26th International Symposium on Research in Attacks Intrusions and Defenses 2023 ACM 123\u2013134 https:\/\/doi.org\/10.1145\/3607199.3607230.","DOI":"10.1145\/3607199.3607230"},{"key":"e_1_2_11_18_2","unstructured":"Stolen crypto rises more than 50% year-on-year to over $500 million 2024 CCN.com."},{"key":"e_1_2_11_19_2","unstructured":"Daniel Cooper QuadrigaCX owes customers $190 million court filing shows\u2014coindesk 2019."},{"key":"e_1_2_11_20_2","unstructured":"Binance Academy Threshold signatures explained 2020."},{"key":"e_1_2_11_21_2","doi-asserted-by":"crossref","DOI":"10.1007\/s00145-021-09409-9","article-title":"Fast secure two-party ECDSA signing","volume":"34","author":"Lindell Y.","year":"2021","journal-title":"Journal of Cryptology"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39555-5"},{"key":"e_1_2_11_23_2","series-title":"Lecture Notes in Computer Science","first-page":"352","volume-title":"Progress in Cryptology\u2013LATINCRYPT","author":"Boneh D.","year":"2017"},{"key":"e_1_2_11_24_2","doi-asserted-by":"crossref","unstructured":"GennaroR.andGoldfederS. Fast multiparty threshold ECDSA with fast trustless setup Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security 2018 ACM 1179\u20131194 https:\/\/doi.org\/10.1145\/3243734.3243859 2-s2.0-85056868920.","DOI":"10.1145\/3243734.3243859"},{"key":"e_1_2_11_25_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-031-30872-7_15","volume-title":"Topics in Cryptology\u2013CT-RSA","author":"Bouez A.","year":"2023"},{"key":"e_1_2_11_26_2","doi-asserted-by":"crossref","unstructured":"XueH. AuM. H. XieX. YuenT. H. andCuiH. Efficient online-friendly two-party ECDSA signature Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security 2021 ACM 558\u2013573.","DOI":"10.1145\/3460120.3484803"},{"key":"e_1_2_11_27_2","doi-asserted-by":"crossref","unstructured":"CanettiR. GennaroR. GoldfederS. MakriyannisN. andPeledU. UC non-interactive proactive threshold ECDSA with identifiable aborts CCS 2020-Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security 2020 ACM 1769\u20131787.","DOI":"10.1145\/3372297.3423367"},{"key":"e_1_2_11_28_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-030-45388-6_10","volume-title":"Public-Key Cryptography\u2013PKC","author":"Castagnos G.","year":"2020"},{"key":"e_1_2_11_29_2","doi-asserted-by":"crossref","unstructured":"XueH. AuM. H. LiuM. ChanK. Y. CuiH. XieX. YuenT. H. andZhangC. Efficient multiplicative-to-additive function from joye-libert cryptosystem and its application to threshold ECDSA Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security 2023 ACM 2974\u20132988.","DOI":"10.1145\/3576915.3616595"},{"key":"e_1_2_11_30_2","doi-asserted-by":"crossref","unstructured":"PeraltaR.andBrand\u00e3oL. T. A. N. NIST first call for multi-party threshold schemes 2023 NIST IR 8214C ipd.","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/129902.129905"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"e_1_2_11_33_2","first-page":"2965","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Zhang J.","year":"2022"},{"key":"e_1_2_11_34_2","doi-asserted-by":"crossref","unstructured":"DoernerJ. KondiY. LeeE. andShelatA. Threshold ECDSA from ECDSA assumptions: the multiparty case 2019 IEEE Symposium on Security and Privacy (SP) 2019 San Francisco CA USA IEEE 1051\u20131066 https:\/\/doi.org\/10.1109\/SP.2019.00024 2-s2.0-85072930147.","DOI":"10.1109\/SP.2019.00024"},{"key":"e_1_2_11_35_2","unstructured":"GennaroR.andGoldfederS. One round threshold ECDSA with identifiable abort 2020."},{"key":"e_1_2_11_36_2","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-200112"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2024\/2252865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:57:20Z","timestamp":1762333040000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2024\/2252865"}},"subtitle":[],"editor":[{"given":"Guowen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1049\/2024\/2252865"],"URL":"https:\/\/doi.org\/10.1049\/2024\/2252865","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2024-05-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2252865"}}