{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T15:39:14Z","timestamp":1785425954529,"version":"3.56.0"},"reference-count":38,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"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":"crossref","award":["62272420"],"award-info":[{"award-number":["62272420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12001498"],"award-info":[{"award-number":["12001498"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"award":["62272420"],"award-info":[{"award-number":["62272420"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]},{"award":["12001498"],"award-info":[{"award-number":["12001498"]}],"id":[{"id":"https:\/\/ror.org\/01h0zpd94","id-type":"ROR","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Linearly homomorphic signatures (LHSs) are widely used in scenarios such as network coding and the Internet of Things, but their security faces the serious threat of key leakage. To address this issue, this paper introduces a forward secure mechanism into LHSs, aiming to construct a linearly homomorphic signature (LHS) scheme that can resist the risk of key leakage. By combining the binary tree minimal cover set mechanism with lattice-based extension algorithms, we construct an LHS scheme that supports time-period key updates. We prove its forward secure unforgeability under the standard model (SM) by reducing it to the Short Integer Solution (SIS) problem. To the best of our knowledge, this scheme is the first provably secure lattice-based forward secure linearly homomorphic signature (FSLHS) scheme in the SM, filling a theoretical gap in existing research. Furthermore, we apply this scheme to a smart grid data acquisition system and verify its practicality through concrete performance analysis.<\/jats:p>","DOI":"10.3390\/e28060706","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T14:37:42Z","timestamp":1781879862000},"page":"706","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forward-Secure Linearly Homomorphic Signature Scheme in the Standard Model and Its Application"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3447-0865","authenticated-orcid":false,"given":"Linlin","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450046, China"},{"name":"Institute of Mathematics, Henan Academy of Sciences, Zhengzhou 450046, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3282-6811","authenticated-orcid":false,"given":"Zuling","family":"Chang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450046, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2026,6,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","article-title":"Linear network coding","volume":"49","author":"Li","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Katz, J., Krawczyk, H., and Rabin, T. (2010). Secure network coding over the integers. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-13013-7_9"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10623-015-0079-1","article-title":"Linearly homomorphic structure-preserving signatures and their applications","volume":"77","author":"Libert","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Johnson, R., Molnar, D., Song, D., and Wagner, D. (2002). Homomorphic signature schemes. Cryptographers\u2019 Track at the RSA Conference, Springer.","DOI":"10.1007\/3-540-45760-7_17"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Freeman, D., Katz, J., and Waters, B. (2009). Signing a linear subspace: Signature schemes for network coding. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Freeman, D.M. (2012). Improved security for linearly homomorphic signatures: A generic framework. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-30057-8_41"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Attrapadung, N., Libert, B., and Peters, T. (2013). Efficient completely context-hiding quotable and linearly homomorphic signatures. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-36362-7_24"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1007\/s10623-017-0444-3","article-title":"Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions","volume":"86","author":"Catalano","year":"2018","journal-title":"Des. Codes Cryptogr."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"H\u00e9bant, C., Pointcheval, D., and Sch\u00e4dlich, R. (2023). Tracing a linear subspace: Application to linearly-homomorphic group signatures. IACR International Conference on Public-Key Cryptography, Springer Nature.","DOI":"10.1007\/978-3-031-31368-4_12"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Shor, P.W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Boneh, D., and Freeman, D.M. (2011). Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Boneh, D., and Freeman, D.M. (2011). Homomorphic signatures for polynomial functions. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/978-3-642-20465-4_10"},{"key":"ref_14","first-page":"1","article-title":"Lattice-based linearly homomorphic signature scheme over binary field","volume":"56","author":"Wang","year":"2013","journal-title":"Sci. China Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.tcs.2016.04.009","article-title":"Lattice-based linearly homomorphic signatures in the standard model","volume":"634","author":"Chen","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1093\/comjnl\/bxaa034","article-title":"Linearly homomorphic signatures from lattices","volume":"63","author":"Lin","year":"2020","journal-title":"Comput. J."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"8857815","DOI":"10.1155\/2020\/8857815","article-title":"Lattice-based linearly homomorphic signature scheme over F2","volume":"2020","author":"Cai","year":"2020","journal-title":"Secur. Commun. Netw."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"114758","DOI":"10.1016\/j.tcs.2024.114758","article-title":"Towards tightly secure short linearly homomorphic signatures","volume":"1014","author":"Chen","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"ref_19","unstructured":"Guo, H., Liu, F., Tian, K., and Zheng, Z. (2024). Linearly homomorphic signature with tight security on lattice. arXiv."},{"key":"ref_20","unstructured":"Anderson, R. (1997, January 1\u20134). Two remarks on public-key cryptology. Proceedings of the Fourth ACM Conference on Computer and Communications Security (CCS 1997), Zurich, Switzerland."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bellare, M., and Miner, S.K. (1999). A forward-secure digital signature scheme. Proceedings of Advances in Cryptology (CRYPTO 1999), Santa Barbara, CA, USA, Springer.","DOI":"10.1007\/3-540-48405-1_28"},{"key":"ref_22","first-page":"116","article-title":"A new forward-secure digital signature scheme","volume":"Volume 1976","author":"Abdalla","year":"2000","journal-title":"Proceedings of Advances in Cryptology (ASI ACRYPT 2000)"},{"key":"ref_23","first-page":"499","article-title":"Forward-secure signatures with optimal signing and verifying","volume":"Volume 2139","author":"Itkis","year":"2001","journal-title":"Proceedings of Advances in Cryptology (CRYPTO 2001)"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kozlov, A., and Reyzin, L. (2002). Forward-secure signatures with fast key update. International Conference on Security in Communication Networks, Springer.","DOI":"10.1007\/3-540-36413-7_18"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ins.2014.03.082","article-title":"One forward secure signature scheme using bilinear maps and its applications","volume":"279","author":"Yu","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_26","unstructured":"Hu, F., Wu, C., and Irwin, J.D. (2026, June 15). A New Forward Secure Signature Scheme Using Bilinear Maps. Cryptology ePrint Archive, Report 2003\/188. Available online: http:\/\/eprint.iacr.org\/2003\/188."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1963","DOI":"10.1016\/j.compeleceng.2013.12.003","article-title":"Efficient forward secure identity-based shorter signature from lattice","volume":"40","author":"Zhang","year":"2014","journal-title":"Comput. Electr. Eng."},{"key":"ref_28","first-page":"5","article-title":"Lattice based forward-secure identity based encryption scheme with shorter ciphertext","volume":"3","author":"Singh","year":"2013","journal-title":"J. Internet Serv. Inf. Secur"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ling, S., Nguyen, K., Wang, H., and Xu, Y. (2019). Forward-secure group signatures from lattices. International Conference on Post-Quantum Cryptography, Springer International Publishing.","DOI":"10.1007\/978-3-030-25510-7_3"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Le, H.Q., Duong, D.H., Susilo, W., Tran, H.T.N., Trinh, V.C., Pieprzyk, J., and Plantard, T. (2020). Lattice blind signatures with forward security. Australasian Conference on Information Security and Privacy, Springer International Publishing.","DOI":"10.1007\/978-3-030-55304-3_1"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s11235-024-01227-1","article-title":"A efficient lattice-based forward-secure linearly homomorphic signature scheme for network coding","volume":"87","author":"Wu","year":"2024","journal-title":"Telecommun. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s12083-025-01917-w","article-title":"A key leakage resistant linearly homomorphic signature scheme and its application","volume":"18","author":"Wu","year":"2025","journal-title":"Peer-Peer Netw. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Liu, F., and Tian, K. (2023). Modern cryptography, Volume 2: A classical introduction to informational and mathematical principle. Financial Mathematics and Fintech, Springer.","DOI":"10.1007\/978-981-19-7644-5"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","article-title":"Worst-case to average-case reductions based on Gaussian measures","volume":"37","author":"Micciancio","year":"2007","journal-title":"SIAM J. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","article-title":"Generating shorter bases for hard random lattices","volume":"48","author":"Alwen","year":"2011","journal-title":"Theory Comput. Syst."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., and Boyen, X. (June, January 30). Efficient lattice (H)IBE in the standard model. Proceedings of the Advances in Cryptology-EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco, France.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Micciancio, D., and Peikert, C. (2012). Trapdoors for lattices: Simpler, tighter, faster, smaller. Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/978-3-642-29011-4_41"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/6\/706\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:26:13Z","timestamp":1782534373000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/6\/706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":38,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["e28060706"],"URL":"https:\/\/doi.org\/10.3390\/e28060706","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,18]]}}}