Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme

Area of Science:

• Cryptography
• Post-Quantum Cryptography
• Digital Signatures

Background:

• Existing proxy re-signature schemes face security vulnerabilities and certificate management issues.
• Identity-based schemes have key escrow concerns, and certificateless schemes are vulnerable to quantum attacks.
• There is a need for secure and efficient proxy re-signature schemes resistant to quantum computing.

Purpose of the Study:

• To construct an efficient post-quantum certificateless proxy re-signature scheme.
• To address security vulnerabilities and certificate management bottlenecks in current schemes.
• To provide a solution for secure digital identity authentication in quantum-threat environments.

Main Methods:

• Utilizing algebraic lattice theory and the Dilithium algorithm.
• Employing a lattice basis reduction-assisted parameter selection strategy to mitigate algebraic attacks.
• Applying structured compression techniques for optimized signature storage and reduced computational overhead.

Main Results:

• Developed an efficient post-quantum certificateless proxy re-signature scheme.
• Demonstrated mitigation of algebraic attack vectors in the NTRU lattice structure.
• Achieved reduced computational overhead and optimized signature storage complexity.

Conclusions:

• The proposed scheme offers enhanced security against quantum computing threats.
• The scheme is suitable for resource-constrained devices like Internet of Things (IoT) terminals.
• Formal proofs confirm the scheme's unforgeability under adaptive chosen-message attacks.