Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwarting unauthorized intrusions, yet the vast majority of existing schemes rely on conventional public-key cryptography (such as ECC, RSA), which is provably insecure in the post-quantum era due to Shor's algorithm. This motivates the design of post-quantum authentication that is also lightweight for resource-limited sensors. To address this challenge, we propose an efficient authentication and key agreement protocol based on Number Theory Research Unit (NTRU), a lattice-based cryptosystem offering proven resistance to quantum attacks. We have proven the correctness and security of our scheme through BAN logic and random oracle model and demonstrated through informal analysis that our scheme can resist various attack methods and possesses high security features. Moreover, we thoroughly evaluate our protocol against the most recent state-of-the-art schemes. The results indicate that our scheme has the lowest computational cost, and its communication cost is superior to that of most other schemes. Overall, our proposed protocol provides a robust, efficient, and future-proof authentication solution for WSNs, well-suited for deploying WSNs environments.
Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwarting unauthorized intrusions, yet the vast majority of existing schemes rely on conventional public-key cryptography (such as ECC, RSA), which is provably insecure in the post-quantum era due to Shor's algorithm. This motivates the design of post-quantum authentication that is also lightweight for resource-limited sensors. To address this challenge, we propose an efficient authentication and key agreement protocol based on Number Theory Research Unit (NTRU), a lattice-based cryptosystem offering proven resistance to quantum attacks. We have proven the correctness and security of our scheme through BAN logic and random oracle model and demonstrated through informal analysis that our scheme can resist various attack methods and possesses high security features. Moreover, we thoroughly evaluate our protocol against the most recent state-of-the-art schemes. The results indicate that our scheme has the lowest computational cost, and its communication cost is superior to that of most other schemes. Overall, our proposed protocol provides a robust, efficient, and future-proof authentication solution for WSNs, well-suited for deploying WSNs environments.
Abstract Wireless Sensor Networks (WSNs) have been heavily deployed to facilitate continuous monitoring of their environments as they collect the necessary data which enable autonomous decision making or predictive control. As such, these networks have found applications in fields such as smart agriculture, military, industrial automation, and healthcare. During the message transfers among sensors or between sensors and mobile sinks, public communication channels are deployed. This exposes the collected data to a myriad of security threats such as tampering, eavesdropping, and replay. Although the recent past has witnessed the development of numerous security frameworks for this ecosystem, most of the current solutions are defenseless against threats such as session hijacking, side-channeling, ephemeral secret leakages and quantum attacks. In this paper, we leverage on lattice cryptography to develop an effective authentication framework for the WSNs. Formal security analysis confirms the robustness of our protocol under the Random Oracle Model (ROM). In addition, extensive semantic security analyses demonstrate the resilience of the proposed framework against typical attacks such as denial of service, key compromise and forgery. In terms of performance, we show that the developed framework incurs slightly lower computation and energy overheads when compared with its peers.
In emerging environments such as cloud computing and the Internet of Things (IoT), secure authentication and key negotiation play a crucial role in protecting data transmitted over public networks. However, many existing authentication protocols are still designed based on classical public-key cryptography primitives, and quantum computing may threaten their security. To address this challenge, we propose a post-quantum authentication and key agreement protocol that uses the lattice-based Kyber key encapsulation mechanism (KEM). Our proposed protocol integrates cryptographic authentication, smart card protection, and post-quantum key encapsulation mechanisms, enabling mutual authentication between users and servers and securely establishing session keys. The security of the protocol is formally analyzed in the Real-or-Random (ROR) model under the random oracle assumption and the IND-CCA security of the underlying KEM scheme. Furthermore, through informal security analysis, we have further demonstrated that the protocol possesses important security properties, including anonymity, untraceability, perfect forward confidentiality, and resistance to known attacks. In addition, the computational cost and communication overhead of the proposed scheme are evaluated and compared with several representative authentication protocols. The results show that the proposed protocol can provide strong security while maintaining low computational cost and communication overhead.
In order to build a secure and an efficient scheme even in the presence of quantum computers, we propose an improved authenticated key agreement scheme based on NTRU for applications in e-health platforms. In fact, user authentication and key agreement are important cryptographic primitives that allow two entities to establish a secure and an authenticated channel over insecure networks. Currently, the security of the most of these primitives relies on RSA or ECC standards, which ensure high security levels. Unfortunately, all cryptosystems based on factorization problems (e.g., RSA) or the discrete logarithm problem in finite groups (e.g., ECC) will be vulnerable to quantum attacks in the next few years due to Shor’s algorithm. Security and efficiency analysis show that the proposed scheme can resist various attacks, including quantum attacks while preserving efficiency.
Abstract In internet of things (IOT) healthcare systems, sensitive patient information is transmitted over the network to medical professionals. Numerous lightweight authentication protocols have been proposed; however, most of them remain vulnerable to various cyberattacks, allowing attackers to eavesdrop on or manipulate transmitted data. We examine several recently proposed lightweight authentication schemes for healthcare systems. Our security analysis demonstrates that these schemes remain vulnerable to malicious gateway attacks, desynchronization attacks, and key screw attacks. .To address these issues and ensure post- quantum security in healthcare IoT, we propose a post-quantum key establishment protocol based on lattice- based cryptography (LWE). the proposed scheme prevents the gateway from accessing both the secret keys and their parameters, thereby eliminating the possibility of malicious gateway attacks. The proposed protocol ensures user anonymity, forward secrecy, and resistance to impersonation, key screw, and desynchronization attacks.. The proposed protocol ensures secure and efficient establishment of three-round key establishment among entities . Our performance evaluation shows that the proposed scheme achieves lower computation and communication overhead compared to recent related works. The security of the protocol is thoroughly analyzed through informal reasoning, Burrows–Abadi–Needham (BAN) logic, and ProVerif, confirming its robustness and suitability for resource-constrained IoT-based healthcare environments.
As smart home devices become more widely available, their limited resources and potential exposure to various types of cyber-attacks make it difficult for the traditional security protocols to remain effective. Cloud-enabled smart home IoT platforms have helped to improve device intelligence and overall efficiency when controlling them, but the additional use of cloud computing has also created additional complexity in controlling these devices through user-defined automated rules and remote access via vendor apps. Conventional security schemes do not consider these types of control models, nor do they provide a reasonable balance of the additional computational overhead introduced, the efficiency of communications, and the level of security provided. Additionally, with the introduction of quantum computing, current public key cryptography primitives will become obsolete, necessitating the requirement for an adoption of post-quantum security measures. To overcome these issues, this paper presents a proposal for a lightweight mutual authentication and key agreement scheme that employs post-quantum cryptography primitives to facilitate a secure interaction between the user’s cloud platforms, smart home devices, and the user. The protocol also supports remote secure control, while providing the resistance to both classical and quantum attacks. The proposed protocol has been thoroughly evaluated through formal verification using the ProVerif tool and multiple heuristic evaluation techniques. Additionally, the security features of the proposed protocol have been compared to those of several existing methods, providing evidence that it offers improved security features, forward secrecy, and quantum resistance while maintaining a lightweight profile compatible with the limitations of modern smart homes.
As a non-contact identification technology, RFID (Radio Frequency Identification) is widely used in various Internet of Things applications. However, RFID systems are highly vulnerable to diverse attacks due to the openness of communication links between readers and tags, leading to serious security and privacy concerns. Numerous RFID authentication protocols have been designed that employ hash functions and symmetric cryptography to secure communications. Despite these efforts, such schemes generally exhibit limitations in key management flexibility and scalability, which significantly restricts their applicability in large-scale RFID deployments. Confronted with this challenge, public key cryptography offers an effective solution. Taking into account factors such as parameter size, computational complexity, and resistance to quantum attacks, the NTRU algorithm emerges as one of the most promising choices. Since the NTRU signature algorithm is highly complex and requires large parameters, there are currently only a few NTRU encryption-based RFID authentication protocols available, all of which exhibit significant security flaws-such as supporting only one-way authentication, failing to address public key distribution, and so on. Moreover, performance evaluations of the algorithm in these contexts are often incomplete. This paper proposes a mutual authentication protocol for RFID based on the NTRU encryption algorithm to address security and privacy issues. The security of the protocol is analyzed using the BAN-logic tools and some non-formalized methods, and it is further validated through simulation with the AVISPA tool. With the parameter set (N, p, q) = (443, 3, 2048), the NTRU algorithm can provide 128 bits of post-quantum security strength. This configuration not only demonstrates greater foresight at the theoretical security level but also offers significant advantages in practical energy consumption and computation time when compared to traditional algorithms such as ECC, making it a highly competitive candidate in the field of post-quantum cryptography.