The enormous benefits of Internet of Things (IoT) technology have driven its deployment in various applications. Additionally, the development of quantum computers has directed attention towards lattice-based cryptography. Consequently, the computational capabilities of quantum computers pose a threat to the security of the existing IoT signature mechanisms. Quantum computers are proficient at unraveling the complexity bound of computationally hard problems like the integer factorization problem (IFP) and the discrete logarithm problem (DLP). As a result, security is an essential requirement for the IoT communication network against quantum attacks. The amalgamation of certificateless public key cryptosystems (CL-PKC) and lattice-based cryptography (LBC) is one of the solution for alleviating these security menaces. Lucidly, CL-PKC prevents key escrow issues and key management problems; LBC prevents quantum attacks. The Shortest Integer Solution (SIS) problem, which the NTRU lattices offer, serves as the basis for this paper’s introduction of a certificateless signature mechanism for IoT environments. By adopting the Random Oracle Model, we demonstrated the security of the suggested mechanism against Type 1 and Type 2 attackers. Furthermore, security analysis and performance evaluation demonstrate robust communication, as evidenced by metrics such as the computational cost of CL-Sign and CL-Verify phases at 536μs, 376.81μs and communication cost of KGC at 418 bits, CL-Sign at 532 bits and CL-Verify at 446 bits. Also, we calculate the cost of single-message signature generation and verification on an IoT device. These results show that the suggested mechanism’s security and computational efficiency are more reliable, and efficient than other relevant competing frameworks.
The enormous benefits of Internet of Things (IoT) technology have driven its deployment in various applications. Additionally, the development of quantum computers has directed attention towards lattice-based cryptography. Consequently, the computational capabilities of quantum computers pose a threat to the security of the existing IoT signature mechanisms. Quantum computers are proficient at unraveling the complexity bound of computationally hard problems like the integer factorization problem (IFP) and the discrete logarithm problem (DLP). As a result, security is an essential requirement for the IoT communication network against quantum attacks. The amalgamation of certificateless public key cryptosystems (CL-PKC) and lattice-based cryptography (LBC) is one of the solution for alleviating these security menaces. Lucidly, CL-PKC prevents key escrow issues and key management problems; LBC prevents quantum attacks. The Shortest Integer Solution (SIS) problem, which the NTRU lattices offer, serves as the basis for this paper’s introduction of a certificateless signature mechanism for IoT environments. By adopting the Random Oracle Model, we demonstrated the security of the suggested mechanism against Type 1 and Type 2 attackers. Furthermore, security analysis and performance evaluation demonstrate robust communication, as evidenced by metrics such as the computational cost of CL-Sign and CL-Verify phases at 536μs, 376.81μs and communication cost of KGC at 418 bits, CL-Sign at 532 bits and CL-Verify at 446 bits. Also, we calculate the cost of single-message signature generation and verification on an IoT device. These results show that the suggested mechanism’s security and computational efficiency are more reliable, and efficient than other relevant competing frameworks.
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.
A lightweight, robust, and efficient security mechanism is necessary to combat quantum-generation threats across multiple domains, including healthcare, transportation, and industrial automation, in the Internet of Things (IoT). Post-quantum cryptography has emerged in response to the increasing vulnerability of traditional cryptographic methods, such as RSA and ECC, to quantum attacks. Taking advantage of the hardness of Short Integer Solutions (SIS) and Learning with Errors (LWE), we propose a lattice-based signature scheme for IoT applications. A computationally efficient IoT device model that maintains authenticated, integrity, and anonymity is proposed. The scheme has the advantage of being faster and more efficient than existing key size schemes such as IBS, CLS, and FALCON, according to a detailed security assessment. The proposed scheme maintains practical deployment ability while reducing post-quantum security in IoT ecosystems.
With the rapid development of quantum computers and quantum computing, Internet of Things (IoT) networks equipped with traditional cryptographic algorithms have become very weak against quantum attacks. This paper focuses on the privacy-preserving problem in IoT networks and proposes a certificateless ring signature (CLRS) scheme. This CLRS is constructed with lattice theories, which show promising advantages in resisting quantum attacks. Meanwhile, the certificateless mechanism reduces the key control ability of the key generation center (KGC) by adding personal secret keys to the private key generated by the system. Meanwhile, the ring signature mechanism protects users' privacy information through a non-central control mechanism. Next, the security proof in a random oracle model is given, which shows that this CLRS scheme can obtain unforgeability and ensure the signer's anonymity. Its security properties include non-repudiation, traceability, and post-quantum security. Then, the efficiency comparison and performance results show that this CLRS scheme is more efficient and practical than similar schemes. Moreover, this work presents an exploration of the post-quantum cryptographic algorithm and its application in IoT networks.
In recent years, the Internet of Things (IoT) has gained immense popularity in various aspects of work, learning, and daily life. Within the IoT realm, there is a growing concern regarding communication security issues between users and servers. However, addressing the communication security between servers is equally imperative, which has not received as much attention. To this end, we propose a certificateless anonymous authenticated key agreement (AKA) algorithm based on learning with errors (LWEs) and inhomogeneous small integer solution (ISIS) security assumptions. Our scheme provides strong resistance to quantum attacks and protects the privacy of communication servers. It also has constant communication costs and lower computational requirements than existing lattice-based anonymous AKA algorithms on the broadcast channel. Additionally, the proposed scheme eliminates the resource consumption of managing complex certificates and addresses the security risks associated with key escrow in the key generation center (KGC). Through security and performance analysis, we demonstrate that our approach can enhance the security of IoT-based healthcare systems while significantly improving communication efficiency. Our proposed scheme provides a promising solution to security issues related to server communication in IoT systems.
The rapid proliferation of IoT technology has brought billions of devices into play that need to operate in a variety of diverse, resource-constrained environments. Secure authentication among these devices is a critical challenge, as traditional certificate-based public key infrastructures incur heavy computation and management overhead. Moreover, recent breakthroughs in quantum computing put at risk the security of classical cryptographic algorithms commonly used in IoT systems. This paper proposes a post-quantum certificateless authentication framework designed to address the efficiency-long-term security requirements of IoT environments. The proposed framework uses lattice-based cryptography to resist quantum-enabled adversaries while eliminating the need for digital certificates. The certificateless approach evades the problem of key escrow of identity-based cryptography and simplifies the key management process. A lightweight authentication protocol, which is suitable for constrained IoT devices, is developed. Security analyses prove that our proposed framework resists common attacks such as impersonation, replay, and man-in-the-middle attacks. The performance evaluation shows that our proposed framework reduces the communication and computational overheads compared with the traditional certificatebased authentication schemes. In this way, it is appropriate for large-scale and futureproof deployments of IoT systems.
Internet of Things (IoT) is one of the most representative application scenarios in the 5G and 6G era. The concurrent access of massive IoT devices definitely poses enormous communication, computation, and certificate management challenges to the wireless authentication. Moreover, the emergence of quantum computing makes classical cryptography-based authentication protocols, such as 5G-AKA, more easier to be broken. Facing the challenges posed by the massive concurrent authentication and quantum attacks, this paper proposes a lattice cryptography based group authentication scheme, where lattice-based aggregate signature algorithm and identity-based encryption (IBE) are leveraged to achieve simultaneous authentication of concurrent accessed devices. The proposed authentication scheme eliminates the process of public key certificate management, greatly reducing the storage overhead of core network. Moreover, the utilization of lattice cryptography enables the resistance of quantum attacks. The proposed solution does not rely on additional security assumptions such as security channel or trusted group center, making it more flexible to be deployed in actual network scenario. Finally, formal security analysis of the proposed protocol is provided with the tool ProVerif. It is demonstrated that the proposed protocol can satisfy the goals of identity privacy, authentication, data confidentiality and forward secrecy. In addition, compared with existing advanced solutions, the outperformance of the proposed scheme in terms of computation overhead, signaling overhead, communication overhead, and security properties is validated with simulations.