{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T15:31:17Z","timestamp":1786375877174,"version":"build-2736575974"},"reference-count":63,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.comnet.2026.112536","type":"journal-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T20:25:32Z","timestamp":1783628732000},"page":"112536","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A quantum-resistant identity-based linearly homomorphic signature scheme for secure XOR network coding"],"prefix":"10.1016","volume":"287","author":[{"given":"Heng","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengxia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.comnet.2026.112536_b1","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10.1016\/j.comnet.2026.112536_b2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1186\/s42400-023-00198-1","article-title":"A survey on lattice-based digital signature","volume":"7","author":"Liu","year":"2024","journal-title":"Cybersecurity"},{"key":"10.1016\/j.comnet.2026.112536_b3","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"738","article-title":"Lattice signatures without trapdoors","author":"Lyubashevsky","year":"2012"},{"key":"10.1016\/j.comnet.2026.112536_b4","series-title":"Digital Signatures","author":"Katz","year":"2010"},{"key":"10.1016\/j.comnet.2026.112536_b5","series-title":"Annual International Cryptology Conference","first-page":"41","article-title":"Short group signatures","author":"Boneh","year":"2004"},{"key":"10.1016\/j.comnet.2026.112536_b6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s001450010003","article-title":"Security arguments for digital signatures and blind signatures","volume":"13","author":"Pointcheval","year":"2000","journal-title":"J. Cryptology"},{"key":"10.1016\/j.comnet.2026.112536_b7","series-title":"Advances in Cryptology: Proceedings of CRYPTO 84 4","first-page":"47","article-title":"Identity-based cryptosystems and signature schemes","author":"Shamir","year":"1985"},{"key":"10.1016\/j.comnet.2026.112536_b8","series-title":"Annual International Cryptology Conference","first-page":"213","article-title":"Identity-based encryption from the Weil pairing","author":"Boneh","year":"2001"},{"key":"10.1016\/j.comnet.2026.112536_b9","series-title":"Cryptography and Coding: 8th IMA International Conference Cirencester, UK, December 17\u201319, 2001 Proceedings 8","first-page":"360","article-title":"An identity based encryption scheme based on quadratic residues","author":"Cocks","year":"2001"},{"key":"10.1016\/j.comnet.2026.112536_b10","series-title":"Progress in Cryptology\u2013AFRICACRYPT 2009: Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings 2","first-page":"135","article-title":"A Schnorr-like lightweight identity-based signature scheme","author":"Galindo","year":"2009"},{"key":"10.1016\/j.comnet.2026.112536_b11","series-title":"Advances in Cryptology-ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings 11","first-page":"515","article-title":"Efficient and provably-secure identity-based signatures and signcryption from bilinear maps","author":"Barreto","year":"2005"},{"issue":"1","key":"10.1016\/j.comnet.2026.112536_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-008-9028-8","article-title":"Security proofs for identity-based identification and signature schemes","volume":"22","author":"Bellare","year":"2009","journal-title":"J. Cryptology"},{"key":"10.1016\/j.comnet.2026.112536_b13","series-title":"Public Key Cryptography\u2014PKC 2003: 6th International Workshop on Practice and Theory in Public Key Cryptography Miami, FL, USA, January 6\u20138, 2003 Proceedings 6","first-page":"18","article-title":"An identity-based signature from gap Diffie\u2013Hellman groups","author":"Choon","year":"2002"},{"key":"10.1016\/j.comnet.2026.112536_b14","series-title":"Australasian Conference on Information Security and Privacy","first-page":"207","article-title":"Efficient identity-based signatures secure in the standard model","author":"Paterson","year":"2006"},{"key":"10.1016\/j.comnet.2026.112536_b15","series-title":"Cryptographers\u2019 Track At the RSA Conference","first-page":"244","article-title":"Homomorphic signature schemes","author":"Johnson","year":"2002"},{"key":"10.1016\/j.comnet.2026.112536_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cose.2017.08.007","article-title":"Secure attribute-based data sharing for resource-limited users in cloud computing","volume":"72","author":"Li","year":"2018","journal-title":"Comput. Secur."},{"key":"10.1016\/j.comnet.2026.112536_b17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10586-017-0849-9","article-title":"Privacy-preserving outsourced classification in cloud computing","volume":"21","author":"Li","year":"2018","journal-title":"Clust. Comput."},{"issue":"2","key":"10.1016\/j.comnet.2026.112536_b18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TC.2013.208","article-title":"Identity-based encryption with outsourced revocation in cloud computing","volume":"64","author":"Li","year":"2013","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2026.112536_b19","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.future.2017.02.006","article-title":"Multi-key privacy-preserving deep learning in cloud computing","volume":"74","author":"Li","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.comnet.2026.112536_b20","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.knosys.2014.04.010","article-title":"L-EncDB: A lightweight framework for privacy-preserving data queries in cloud computing","volume":"79","author":"Li","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.comnet.2026.112536_b21","series-title":"Linearly homomorphic signature with tight security on lattice","author":"Guo","year":"2024"},{"key":"10.1016\/j.comnet.2026.112536_b22","series-title":"International Workshop on Public Key Cryptography","first-page":"1","article-title":"Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures","author":"Boneh","year":"2011"},{"key":"10.1016\/j.comnet.2026.112536_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114758","article-title":"Towards tightly secure short linearly homomorphic signatures","volume":"1014","author":"Chen","year":"2024","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.comnet.2026.112536_b24","series-title":"International Conference on Data Security and Privacy Protection","first-page":"374","article-title":"Short lattice-based linearly homomorphic signatures in the standard model","author":"Lei","year":"2025"},{"key":"10.1016\/j.comnet.2026.112536_b25","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":"10.1016\/j.comnet.2026.112536_b26","series-title":"Advances in Cryptology\u2013EUROCRYPT 2011: 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings 30","first-page":"149","article-title":"Homomorphic signatures for polynomial functions","author":"Boneh","year":"2011"},{"key":"10.1016\/j.comnet.2026.112536_b27","series-title":"The 30th Symposium on Cryptography and Information Security","article-title":"Homomorphic signatures for polynomial functions with shorter signatures","author":"Hiromasa","year":"2013"},{"key":"10.1016\/j.comnet.2026.112536_b28","series-title":"Annual Cryptology Conference","first-page":"371","article-title":"Homomorphic signatures with efficient verification for polynomial functions","author":"Catalano","year":"2014"},{"key":"10.1016\/j.comnet.2026.112536_b29","series-title":"2017 IEEE International Conference on Smart Computing","first-page":"1","article-title":"A homomorphic signature scheme for quadratic polynomials","author":"Arita","year":"2017"},{"key":"10.1016\/j.comnet.2026.112536_b30","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, D. Wichs, Leveled fully homomorphic signatures from standard lattices, in: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, 2015, pp. 469\u2013477.","DOI":"10.1145\/2746539.2746576"},{"key":"10.1016\/j.comnet.2026.112536_b31","series-title":"International Conference on Wireless Algorithms, Systems, and Applications","first-page":"494","article-title":"A new fully homomorphic signatures from standard lattices","author":"Wang","year":"2020"},{"key":"10.1016\/j.comnet.2026.112536_b32","series-title":"Adaptively secure fully homomorphic signatures based on lattices","author":"Boyen","year":"2014"},{"key":"10.1016\/j.comnet.2026.112536_b33","series-title":"Advances in Internetworking, Data & Web Technologies: The 5th International Conference on Emerging Internetworking, Data & Web Technologies","first-page":"524","article-title":"An efficient identity-based homomorphic signature scheme for network coding","author":"Zhang","year":"2018"},{"key":"10.1016\/j.comnet.2026.112536_b34","doi-asserted-by":"crossref","first-page":"20632","DOI":"10.1109\/ACCESS.2018.2809426","article-title":"An ID-based linearly homomorphic signature scheme and its application in blockchain","volume":"6","author":"Lin","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.comnet.2026.112536_b35","doi-asserted-by":"crossref","first-page":"50858","DOI":"10.1109\/ACCESS.2019.2908244","article-title":"RKA security of identity-based homomorphic signature scheme","volume":"7","author":"Chang","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.comnet.2026.112536_b36","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1109\/TSC.2020.3039976","article-title":"Secure data delivery with identity-based linearly homomorphic network coding signature scheme in IoT","volume":"15","author":"Li","year":"2020","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"4","key":"10.1016\/j.comnet.2026.112536_b37","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":"10.1016\/j.comnet.2026.112536_b38","series-title":"2007 IEEE International Symposium on Information Theory","first-page":"556","article-title":"Signatures for content distribution with network coding","author":"Zhao","year":"2007"},{"key":"10.1016\/j.comnet.2026.112536_b39","series-title":"International Workshop on Public Key Cryptography","first-page":"68","article-title":"Signing a linear subspace: Signature schemes for network coding","author":"Boneh","year":"2009"},{"issue":"5","key":"10.1016\/j.comnet.2026.112536_b40","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/TIFS.2016.2515517","article-title":"Security analysis and improvements on two homomorphic authentication schemes for network coding","volume":"11","author":"Cheng","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"10.1016\/j.comnet.2026.112536_b41","article-title":"A homomorphic network coding signature scheme for multiple sources and its application in IoT","volume":"2018","author":"Li","year":"2018","journal-title":"Secur. Commun. Netw."},{"issue":"23","key":"10.1016\/j.comnet.2026.112536_b42","doi-asserted-by":"crossref","first-page":"38126","DOI":"10.1109\/JIOT.2024.3443282","article-title":"Linearly homomorphic signature scheme with high-signature efficiency and its application in IoT","volume":"11","author":"Zhou","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.comnet.2026.112536_b43","series-title":"2016 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology","first-page":"7","article-title":"An identity-based digital signature scheme to detect pollution attacks in intra-session network coding","author":"SadrHaghighi","year":"2016"},{"key":"10.1016\/j.comnet.2026.112536_b44","article-title":"An enhanced linearly homomorphic network coding signature scheme for secure data delivery in IoT networks","author":"Huang","year":"2025","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.comnet.2026.112536_b45","doi-asserted-by":"crossref","DOI":"10.7717\/peerj-cs.3068","article-title":"Identity-based linear homomorphic signature for a restricted combiners\u2019 group for e-commerce","volume":"11","author":"Tian","year":"2025","journal-title":"PeerJ Comput. Sci."},{"issue":"6","key":"10.1016\/j.comnet.2026.112536_b46","doi-asserted-by":"crossref","first-page":"2615","DOI":"10.1109\/TNET.2020.3013902","article-title":"Certificateless homomorphic signature scheme for network coding","volume":"28","author":"Chang","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"10.1016\/j.comnet.2026.112536_b47","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1007\/s12083-020-01028-8","article-title":"A certificateless linearly homomorphic signature scheme for network coding and its application in the IoT","volume":"14","author":"Wu","year":"2021","journal-title":"Peer-to-Peer Netw. Appl."},{"issue":"1","key":"10.1016\/j.comnet.2026.112536_b48","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1049\/ise2.12011","article-title":"Lightweight certificateless linearly homomorphic network coding signature scheme for electronic health system","volume":"15","author":"Li","year":"2021","journal-title":"IET Inf. Secur."},{"issue":"13","key":"10.1016\/j.comnet.2026.112536_b49","doi-asserted-by":"crossref","first-page":"13707","DOI":"10.1109\/JSEN.2022.3177317","article-title":"Certificateless homomorphism network coding signature scheme","volume":"22","author":"Yu","year":"2022","journal-title":"IEEE Sens. J."},{"issue":"3","key":"10.1016\/j.comnet.2026.112536_b50","doi-asserted-by":"crossref","first-page":"2570","DOI":"10.1007\/s11227-022-04719-6","article-title":"Certificateless network coding scheme from certificateless public auditing protocol","volume":"79","author":"Bian","year":"2023","journal-title":"J. Supercomput."},{"key":"10.1016\/j.comnet.2026.112536_b51","series-title":"GLOBECOM 2024-2024 IEEE Global Communications Conference","first-page":"4818","article-title":"Secure and efficient certificateless homomorphic signature scheme for network coding","author":"Huang","year":"2024"},{"issue":"3","key":"10.1016\/j.comnet.2026.112536_b52","doi-asserted-by":"crossref","first-page":"503","DOI":"10.3390\/electronics15030503","article-title":"An efficient certificate-based linearly homomorphic signature scheme for secure network coding","volume":"15","author":"Li","year":"2026","journal-title":"Electronics"},{"issue":"9","key":"10.1016\/j.comnet.2026.112536_b53","doi-asserted-by":"crossref","first-page":"2739","DOI":"10.1093\/comjnl\/bxae040","article-title":"A certificateless linearly homomorphic signature scheme based on lattice for network coding","volume":"67","author":"Dong","year":"2024","journal-title":"Comput. J."},{"key":"10.1016\/j.comnet.2026.112536_b54","first-page":"1","article-title":"Lattice-based certificateless linearly homomorphic signature scheme","author":"Wang","year":"2026","journal-title":"Ann. Telecommun."},{"key":"10.1016\/j.comnet.2026.112536_b55","series-title":"Modern Cryptography Volume 1: A Classical Introduction to Informational and Mathematical Principle","author":"Zheng","year":"2022"},{"key":"10.1016\/j.comnet.2026.112536_b56","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Generating hard instances of lattice problems, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, pp. 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"10.1016\/j.comnet.2026.112536_b57","doi-asserted-by":"crossref","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, 2008, pp. 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"10.1016\/j.comnet.2026.112536_b58","series-title":"Advances in Cryptology\u2013CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings 30","first-page":"98","article-title":"Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE","author":"Agrawal","year":"2010"},{"key":"10.1016\/j.comnet.2026.112536_b59","series-title":"Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29","first-page":"553","article-title":"Efficient lattice (H)IBE in the standard model","author":"Agrawal","year":"2010"},{"issue":"1","key":"10.1016\/j.comnet.2026.112536_b60","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":"10.1016\/j.comnet.2026.112536_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2025.111703","article-title":"Identity-based linearly homomorphic proxy signature scheme","author":"Guo","year":"2025","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112536_b62","series-title":"Theory of Cryptography Conference","first-page":"37","article-title":"Asymptotically efficient lattice-based digital signatures","author":"Lyubashevsky","year":"2008"},{"key":"10.1016\/j.comnet.2026.112536_b63","series-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","first-page":"700","article-title":"Trapdoors for lattices: Simpler, tighter, faster, smaller","author":"Micciancio","year":"2012"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626005487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626005487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T15:14:35Z","timestamp":1786374875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626005487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":63,"alternative-id":["S1389128626005487"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112536","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A quantum-resistant identity-based linearly homomorphic signature scheme for secure XOR network coding","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112536","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112536"}}