This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme
by
Zhanzhen Wei
Zhanzhen Wei ,
Gongjian Lan
Gongjian Lan *
,
Hong Zhao
Hong Zhao
,
Zhaobin Li
Zhaobin Li and
Zheng Ju
Zheng Ju
Department of Electronic and Communication Engineering, Beijing Electronic Science and Technology Institute, Beijing 100070, China
*
Author to whom correspondence should be addressed.
Sensors 2025, 25(15), 4848; https://doi.org/10.3390/s25154848 (registering DOI)
Submission received: 3 July 2025
/
Revised: 31 July 2025
/
Accepted: 2 August 2025
/
Published: 6 August 2025
Abstract
Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access control. However, most existing proxy re-signature schemes, which are predominantly based on traditional public-key cryptosystems, face security vulnerabilities and certificate management bottlenecks. While identity-based schemes alleviate some issues, they introduce key escrow concerns. Certificateless schemes effectively resolve both certificate management and key escrow problems but remain vulnerable to quantum computing threats. To address these limitations, this paper constructs an efficient post-quantum certificateless proxy re-signature scheme based on algebraic lattices. Building upon algebraic lattice theory and leveraging the Dilithium algorithm, our scheme innovatively employs a lattice basis reduction-assisted parameter selection strategy to mitigate the potential algebraic attack vectors inherent in the NTRU lattice structure. This ensures the security and integrity of multi-party communication in quantum-threat environments. Furthermore, the scheme significantly reduces computational overhead and optimizes signature storage complexity through structured compression techniques, facilitating deployment on resource-constrained devices like Internet of Things (IoT) terminals. We formally prove the unforgeability of the scheme under the adaptive chosen-message attack model, with its security reducible to the hardness of the corresponding underlying lattice problems.
Share and Cite
MDPI and ACS Style
Wei, Z.; Lan, G.; Zhao, H.; Li, Z.; Ju, Z.
Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme. Sensors 2025, 25, 4848.
https://doi.org/10.3390/s25154848
AMA Style
Wei Z, Lan G, Zhao H, Li Z, Ju Z.
Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme. Sensors. 2025; 25(15):4848.
https://doi.org/10.3390/s25154848
Chicago/Turabian Style
Wei, Zhanzhen, Gongjian Lan, Hong Zhao, Zhaobin Li, and Zheng Ju.
2025. "Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme" Sensors 25, no. 15: 4848.
https://doi.org/10.3390/s25154848
APA Style
Wei, Z., Lan, G., Zhao, H., Li, Z., & Ju, Z.
(2025). Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme. Sensors, 25(15), 4848.
https://doi.org/10.3390/s25154848
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article metric data becomes available approximately 24 hours after publication online.