{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T07:02:20Z","timestamp":1781247740340,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:00:00Z","timestamp":1781222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:00:00Z","timestamp":1781222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102452"],"award-info":[{"award-number":["62102452"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB3106100"],"award-info":[{"award-number":["2023YFB3106100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08622-2","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T06:37:20Z","timestamp":1781246240000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lattice-based linkable linearly homomorphic ring signature scheme"],"prefix":"10.1007","volume":"82","author":[{"given":"Ruifeng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiliang","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanping","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuaishuai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,12]]},"reference":[{"key":"8622_CR1","doi-asserted-by":"publisher","unstructured":"Johnson R, Molnar D, Song D et al (2002) Homomorphic signature schemes. In: Topics in cryptology (CT-RSA 2002). Springer, Berlin, Heidelberg, pp 244\u2013262. https:\/\/doi.org\/10.1007\/3-540-45760-7_17","DOI":"10.1007\/3-540-45760-7_17"},{"key":"8622_CR2","doi-asserted-by":"publisher","unstructured":"Boneh D, Freeman D, Katz J et al (2009) Signing a linear subspace: signature schemes for network coding. In: Public key cryptography (PKC 2009). Springer, Berlin, Heidelberg, pp 68\u201387. https:\/\/doi.org\/10.1007\/978-3-642-00468-1_5","DOI":"10.1007\/978-3-642-00468-1_5"},{"issue":"7","key":"8622_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.3390\/e27070753","volume":"27","author":"M Zhao","year":"2025","unstructured":"Zhao M, Chen H (2025) Identity-based provable data possession with designated verifier from lattices for cloud computing. Entropy 27(7):753. https:\/\/doi.org\/10.3390\/e27070753","journal-title":"Entropy"},{"key":"8622_CR4","doi-asserted-by":"publisher","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium Foundations of Computer Science IEEE Comput. Soc. Press, Santa Fe, NM, USA, pp 124\u2013134. https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"8622_CR5","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484\u20131509. https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J Comput"},{"key":"8622_CR6","doi-asserted-by":"publisher","unstructured":"Hoffstein J, Pipher J, Silverman JH (1998) NTRU: a ring-based public key cryptosystem. Algorithmic number theory. Springer, Berlin, Heidelberg, pp 267\u2013288. https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"8622_CR7","doi-asserted-by":"publisher","unstructured":"Merkle RC (1980) Protocols for public key cryptosystems. In: 1980 IEEE Symp. Secur. Privacy. IEEE, Oakland, CA, USA, p 122. https:\/\/doi.org\/10.1109\/SP.1980.10006","DOI":"10.1109\/SP.1980.10006"},{"key":"8622_CR8","doi-asserted-by":"publisher","unstructured":"Garg S, Gentry C, Halevi S (2013) Candidate multilinear maps from ideal lattices. In: Advancee Cryptology. (EUROCRYPT 2013). Springer, Berlin, Heidelberg, pp 1\u201317. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"8622_CR9","doi-asserted-by":"publisher","unstructured":"Matsumoto T, Imai H (1988) Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. Adv Cryptol 419\u2013453. https:\/\/doi.org\/10.1007\/3-540-45961-8_39. (EUROCRYPT' 88)","DOI":"10.1007\/3-540-45961-8_39"},{"key":"8622_CR10","doi-asserted-by":"publisher","unstructured":"Sendrier N (2011) Encyclopedia of Cryptography and Security. Springer, US, Boston, MA, pp 767\u2013768. https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_384","DOI":"10.1007\/978-1-4419-5906-5_384"},{"key":"8622_CR11","doi-asserted-by":"publisher","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proc. 28th Annu. ACM Symp. Theory Comput. (STOC\u2019 96). ACM Press, Philadelphia, Pennsylvania, United States, pp 99\u2013108. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"8622_CR12","doi-asserted-by":"publisher","unstructured":"Boneh D, Freeman DM (2011) Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Public key cryptography (PKC 2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_1","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"8622_CR13","doi-asserted-by":"publisher","unstructured":"Boneh D, Freeman DM (2011) Homomorphic signatures for polynomial functions. In: Advanced cryptology (EUROCRYPT 2011). Springer, Berlin, Heidelberg, pp 149\u2013168. https:\/\/doi.org\/10.1007\/978-3-642-20465-4_10","DOI":"10.1007\/978-3-642-20465-4_10"},{"issue":"11","key":"8622_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-012-4681-9","volume":"56","author":"F Wang","year":"2013","unstructured":"Wang F, Hu Y, Wang B (2013) Lattice-based linearly homomorphic signature scheme over binary field. Sci China Inf Sci 56(11):1\u20139. https:\/\/doi.org\/10.1007\/s11432-012-4681-9","journal-title":"Sci China Inf Sci"},{"issue":"3","key":"8622_CR15","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s00145-017-9270-z","volume":"31","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky V, Micciancio D (2018) Asymptotically efficient lattice-based digital signatures. J Cryptol 31(3):774\u2013797. https:\/\/doi.org\/10.1007\/s00145-017-9270-z","journal-title":"J Cryptol"},{"key":"8622_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2016.04.009","volume":"634","author":"W Chen","year":"2016","unstructured":"Chen W, Lei H, Qi K (2016) Lattice-based linearly homomorphic signatures in the standard model. Theor Comput Sci 634:47\u201354. https:\/\/doi.org\/10.1016\/j.tcs.2016.04.009","journal-title":"Theor Comput Sci"},{"issue":"12","key":"8622_CR17","doi-asserted-by":"publisher","first-page":"1871","DOI":"10.1093\/comjnl\/bxaa034","volume":"63","author":"CJ Lin","year":"2020","unstructured":"Lin CJ, Xue R, Yang SJ et al (2020) Linearly homomorphic signatures from lattices. Comput J 63(12):1871\u20131885. https:\/\/doi.org\/10.1093\/comjnl\/bxaa034","journal-title":"Comput J"},{"key":"8622_CR18","unstructured":"Choi R, Kim K (2017) Design of new linearly homomorphic signatures on lattice. In: Symp. Cryptogr. Inf. Secur. (SCIS 2017). https:\/\/SCIS 2017_RY2.pdf"},{"key":"8622_CR19","doi-asserted-by":"publisher","first-page":"8857815","DOI":"10.1155\/2020\/8857815","volume":"1","author":"J Cai","year":"2020","unstructured":"Cai J, Jiang H, Wang H, Xu Q (2020) Lattice-based linearly homomorphic signature scheme over $$\\mathbb{F} _2$$. Security Commun Netw 1:8857815. https:\/\/doi.org\/10.1155\/2020\/8857815","journal-title":"Security Commun Netw"},{"key":"8622_CR20","unstructured":"Guo H, Liu F, Tian K, Zheng Z (2025) Linearly homomorphic signature with tight security on lattice. arXiv:2412.01641"},{"key":"8622_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2024.114758","volume":"1014","author":"W Chen","year":"2024","unstructured":"Chen W, Huang Z (2024) Toward tightly secure short linearly homomorphic signatures. Theor Comput Sci 1014:1\u201313. https:\/\/doi.org\/10.1016\/j.tcs.2024.114758","journal-title":"Theor Comput Sci"},{"key":"8622_CR22","doi-asserted-by":"publisher","unstructured":"Boyen X, Li Q (2016) Toward tightly secure lattice short signature and id-based encryption. ASIACRYPT 2016, vol 10032. LNCS. Springer, pp 404\u2013434. https:\/\/doi.org\/10.1007\/978-3-662-53890-6_14","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"8622_CR23","unstructured":"Choi R, Kim K (2016) Lattice-based multisignature with linear homomorphism. In: 2016 Symposium on cryptography and information security (SCIS 2016). https:\/\/api.semanticscholar.org\/CorpusID:41787610"},{"issue":"9","key":"8622_CR24","doi-asserted-by":"publisher","first-page":"2739","DOI":"10.1093\/comjnl\/bxae040","volume":"67","author":"D Songshou","year":"2024","unstructured":"Songshou D, Yao Y, Zhou Y, Yang Y (2024) A certificateless linearly homomorphic signature scheme based on lattice for network coding. Comput J 67(9):2739\u20132748. https:\/\/doi.org\/10.1093\/comjnl\/bxae040","journal-title":"Comput J"},{"key":"8622_CR25","doi-asserted-by":"publisher","first-page":"109595","DOI":"10.1016\/j.comnet.2023.109595","volume":"224","author":"X Chen","year":"2023","unstructured":"Chen X, Xu S, Cao Y, He Y, Xiao K (2023) AQRS: anti-quantum ring signature scheme for secure epidemic control with blockchain. Comput Netw 224:109595. https:\/\/doi.org\/10.1016\/j.comnet.2023.109595","journal-title":"Comput Netw"},{"key":"8622_CR26","doi-asserted-by":"publisher","unstructured":"Rivest RL, Shamir A, Tauman Y (2001) How to leak a secret. In: Proc. 2001 Int. Conf. Theory Appl. Cryptol. Inf. Secur. Springer, Cham, pp 552\u2013565. https:\/\/doi.org\/10.5555\/647097.717015","DOI":"10.5555\/647097.717015"},{"key":"8622_CR27","doi-asserted-by":"publisher","unstructured":"Guo H, Tian K, Liu F, Zheng Z (2025) Linearly homomorphic ring signature scheme over lattices. arXiv:2507.02281. https:\/\/doi.org\/10.48550\/arXiv.2507.02281","DOI":"10.48550\/arXiv.2507.02281"},{"key":"8622_CR28","doi-asserted-by":"publisher","first-page":"8431874","DOI":"10.1155\/2022\/8431874","volume":"2022","author":"Q Ye","year":"2022","unstructured":"Ye Q, Wang M, Meng H, Xia F, Yan X (2022) Efficient linkable ring signature scheme over NTRU lattice with unconditional anonymity. Comput Intell Neurosci 2022:8431874. https:\/\/doi.org\/10.1155\/2022\/8431874","journal-title":"Comput Intell Neurosci"},{"issue":"4","key":"8622_CR29","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash D, Hofheinz D, Kiltz E et al (2012) Bonsai trees, or how to delegate a lattice basis. J Cryptol 25(4):601\u2013639. https:\/\/doi.org\/10.1007\/s00145-011-9105-2","journal-title":"J Cryptol"},{"key":"8622_CR30","doi-asserted-by":"publisher","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th annual ACM Symposium on Theory of Computing. ACM, Victoria, British Columbia, Canada, pp 197\u2013206..https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"8622_CR31","doi-asserted-by":"publisher","unstructured":"Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC \u201905). Association for Computing Machinery, New York, NY, USA, pp 84\u201393.https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"8622_CR32","doi-asserted-by":"publisher","unstructured":"Micciancio D, Peikert C (2012) Trapdoors for lattices: simpler, tighter, faster, smaller. In: Advanced cryptology (EUROCRYPT 2012). Springer, Berlin, Heidelberg, pp 700\u2013718. https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"3","key":"8622_CR33","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","volume":"48","author":"J Alwen","year":"2011","unstructured":"Alwen J, Peikert C (2011) Generating shorter bases for hard random lattices. Theory Comput Syst 48(3):535\u2013553. https:\/\/doi.org\/10.1007\/s00224-010-9278-3","journal-title":"Theory Comput Syst"},{"key":"8622_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","author":"D Micciancio","year":"2002","unstructured":"Micciancio D, Goldwasser S (2002) Complexity of lattice problems. Springer US Boston MA. https:\/\/doi.org\/10.1007\/978-1-4615-0897-7","journal-title":"Springer US Boston MA"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08622-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08622-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08622-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T06:37:22Z","timestamp":1781246242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08622-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,12]]},"references-count":34,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["8622"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08622-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,12]]},"assertion":[{"value":"30 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 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"}},{"value":"This research is a theoretical study in cryptography and does not involve human participants, biological samples, animal experiments, or clinical trials. As such, ethical approval from an institutional review board or ethics committee is not applicable. All analyses and constructions are based on mathematical models and lattice-based cryptographic primitives without ethical implications.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"This work exclusively involves theoretical algorithm design and mathematical proofs. No human subjects, personal data, or biological materials were utilized in the study. Therefore, informed consent to participate is not needed.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"The manuscript contains no personally identifiable data, clinical case studies, or individual-level information. All the results are presented as mathematical theorems, cryptographic schemes, and performance comparisons. Consent for publication is not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials Availability"}},{"value":"Not applicable.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}},{"value":"The authors declare no conflict of interest.","order":8,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"496"}}