基于线性同态签名的敏感物联网设备后量子安全接入认证
Post-Quantum Secure Access Authentication for Sensitive IoT Devices Based on Linear Homomorphic Signature
DOI: 10.12677/csa.2025.1511309, PDF,    科研立项经费支持
作者: 谢金红:武警工程大学密码工程学院,陕西 西安;武警云南总队临沧支队,云南 临沧;乔建辉*:网络与信息安全武警部队重点实验室,陕西 西安;李淏峰:武警工程大学密码工程学院,陕西 西安;车小亮:武警工程大学密码工程学院,陕西 西安;网络与信息安全武警部队重点实验室,陕西 西安
关键词: 物联网格密码线性同态签名后量子密码Internet of Things (IoT) Lattice-Based Cryptography Linear Homomorphic Signature Post-Quantum Cryptography
摘要: 当敏感设备批量请求接入物联网时,对其接入认证过程的安全性与效率提出了更高要求。一方面,设备接入认证方案需具备抵御量子计算攻击的能力,以适应后量子时代的安全需求;另一方面,还需高效处理海量终端设备的并发认证请求,高效处理批量设备请求验证。本文提出一种基于线性同态签名的物联网设备接入认证方案,旨在实现批量设备的安全接入和高效认证。该方案首先基于NTRU密码签名体制与格理论困难问题,设计一种新型线性同态签名算法,使其不仅具备抗量子安全性,还能够支持对多个签名进行线性聚合与高效验证,将该算法嵌入认证服务中心与网关,实现对设备身份与传输数据的联合批量验证;再次,设计了高效的分层认证故障设备定位协议,并利用PUF技术实现密钥管控,提高了方案的可行性。安全性分析表明,该方案可有效抵御量子计算环境下的伪造与篡改攻击;性能评估显示,在千级设备规模下,在存储开销保持可行范围内,实现高效批量验证。
Abstract: When a large number of sensitive devices request access to the Internet of Things (IoT) in batches, higher requirements are put forward for the security and efficiency of their access authentication process. On the one hand, device access authentication schemes need to have the ability to resist quantum computing attacks to meet the security needs of the post-quantum era; on the other hand, they also need to efficiently handle concurrent authentication requests from massive terminal devices and verify batch device access requests. This paper proposes an IoT device access authentication scheme based on linear homomorphic signatures, aiming to achieve secure access and efficient authentication of batch devices. First, based on the NTRU cryptographic signature scheme and hard problems in lattice theory, the scheme designs a new linear homomorphic signature algorithm. This algorithm not only has post-quantum security, but also supports linear aggregation and efficient verification of multiple signatures. It is embedded in the authentication service center (ASC) and gateways to realize the joint batch verification of device identities and transmitted data. Second, an efficient hierarchical authentication protocol for faulty device localization is designed, and Physical Unclonable Function (PUF) technology is used to realize key management and control, which improves the feasibility of the scheme. Security analysis shows that the scheme can effectively resist forgery and tampering attacks in the quantum computing environment; performance evaluation indicates that under the scale of thousands of devices, efficient batch verification is achieved while the storage overhead remains within a feasible range.
文章引用:谢金红, 乔建辉, 李淏峰, 车小亮. 基于线性同态签名的敏感物联网设备后量子安全接入认证[J]. 计算机科学与应用, 2025, 15(11): 338-348. https://doi.org/10.12677/csa.2025.1511309

参考文献

[1] Liu, C.W., Liu, Y., Du, L., et al. (2023) Enhanced Sensing of Optomechanically Induced Nonlinearity by Linewidth Suppression and Optical Bistability in Cavity-Waveguide Systems. Optics Express, 31, 9236-9250. [Google Scholar] [CrossRef
[2] Yang, J.M., Liu, F., Wang, B.Y., et al. (2021) Blood Pressure States Transition Inference Based on Multi-State Markov Model. IEEE Journal of Biomedical and Health Informatics, 25, 237-246. [Google Scholar] [CrossRef
[3] Zsiborács, D. (2025) Human-Machine Teaming in Modern Warfare: Evolving Collaboration at Edge on the Battlefield.
https://www.karveinternational.com/insights/human-machine-teaming-in-modern-warfare
[4] Aleisa, M.A. (2025) Block-chain-Enabled Zero Trust Architecture for Privacy-Preserving Cybersecurity in IoT Environments. IEEE Access, 13, 18660-18676. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10839415 [Google Scholar] [CrossRef
[5] Lin, C., Xue, R., Yang, S., Huang, X. and Li, S. (2020) Linearly Homo-morphic Signatures from Lattices. The Computer Journal, 63, 1871-1885. [Google Scholar] [CrossRef
[6] Wu, B., Wang, C. and Yao, H. (2021) A Certificateless Linearly Homomorphic Signature Scheme for Network Coding and Its Application in the IoT. Peer-to-Peer Networking and Applications, 14, 852-872. [Google Scholar] [CrossRef
[7] Fouque, P.A., Hoffstein, J., Kirchner, P., et al. (2018) Falcon: Fast-Fourier Lattice-Based Compact Signatures over NTRU. Submission to the NIST’s Post-Quantum Cryptography Standardization Pro-cess.
[8] Shah, A., Pandya, H., Soni, M., Karimov, A., Maaliw, R.R. and Keshta, I. (2023) PUF-Based Lightweight Authentication Protocol for IoT Devices. In: Lecture Notes in Networks and Systems, Springer, 401-412. [Google Scholar] [CrossRef
[9] Rana, M., Mamun, Q. and Islam, R. (2022) Lightweight Cryptography in IoT Networks: A Survey. Future Generation Computer Systems, 129, 77-89. [Google Scholar] [CrossRef
[10] 李进. 基于物理不可克隆函数的芯片安全技术研究[D]: [硕士学位论文]. 成都: 电子科技大学, 2022.
[11] Johnson, R., Molnar, D., Song, D. and Wagner, D. (2002) Homomorphic Signature Schemes. In: Lecture Notes in Computer Science, Springer, 244-262. [Google Scholar] [CrossRef
[12] Zhou, X., Zhou, T., Tian, Y., Zhong, W. and Yang, X. (2024) Linearly Homo-morphic Signature Scheme with High-Signature Efficiency and Its Application in IoT. IEEE Internet of Things Journal, 11, 38126-38136. [Google Scholar] [CrossRef
[13] Chen, W., Lei, H. and Qi, K. (2016) Lattice-Based Linearly Homomorphic Sig-natures in the Standard Model. Theoretical Computer Science, 634, 47-54. [Google Scholar] [CrossRef
[14] Cash, D., Hofheinz, D., Kiltz, E. and Peikert, C. (2012) Bonsai Trees, or How to Delegate a Lattice Basis. Journal of Cryptology, 25, 601-639. [Google Scholar] [CrossRef
[15] Boneh, D. and Freeman, D.M. (2011) Homomorphic Signatures for Polynomial Functions. In: Lecture Notes in Computer Science, Springer, 149-168. [Google Scholar] [CrossRef
[16] Léo, D., Eamonn, W., Ludo, N.P., et al. (2022) Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple. http://eprint.iacr.org/2022/1155
[17] Léo, D.S. and Wessel, V.W. (2021) On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography. Lecture Notes in Computer Science, 13277, 643-673. [Google Scholar] [CrossRef
[18] Jackson, K.A., Miller, C.A. and Wang, D. (2024) Evaluating the Security of Crystals-Dilithium in the Quantum Random Oracle Model. In: Lecture Notes in Computer Science, Springer, 418-446. [Google Scholar] [CrossRef
[19] Babai, L. (1986) On Lovász’ Lattice Reduction and the Nearest Lattice Point Problem. Combinatorica, 6, 1-13. [Google Scholar] [CrossRef