A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server through an insecure channel. Lattice based cryptography plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. However, it is not easy to design quantum resistant password based three-party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on a variant of lattice assumption, the ring learning errors. The protocol ensures security against impersonation attack, stolen smartcard attack, password guessing attack, and other existing attacks. In authentication phase, the protocol have used lattice based cryptography that plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. The proposed protocol ensures both securities against quantum attacks and efficiency due to simple algebraic operations that are polynomial addition and multiplications.
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server through an insecure channel. Lattice based cryptography plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. However, it is not easy to design quantum resistant password based three-party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on a variant of lattice assumption, the ring learning errors. The protocol ensures security against impersonation attack, stolen smartcard attack, password guessing attack, and other existing attacks. In authentication phase, the protocol have used lattice based cryptography that plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. The proposed protocol ensures both securities against quantum attacks and efficiency due to simple algebraic operations that are polynomial addition and multiplications.
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over public channel. Shor’s algorithm is a big threat for existing authenticated key exchange protocols. Lattice based cryptography plays a very important role in designing authentication and key agreement secure against the threat of quantum attacks. However, it is not easy job to design quantum resistant password based three party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on ring learning with errors assumption. This protocol is motivated from Islam et al.’s authenticated key exchange protocol. Their protocol is not secure against stolen smartcard attack, password guessing attack, and can’t provide user anonymity. The anonymous communication is a big requirement for practical applications like e-healthcare services/smart vehicular communication. This paper also contains the performance analysis of the proposed protocol along with other relevant protocols.
ABSTRACT A three‐party post‐quantum key agreement protocol involves server with two communicating parties securely agreeing on a shared secret key in a way that is resistant to quantum attacks. Once the shared secret key is shared using authenticated key agreement protocol, then user (A), and user (B) can use it for securing communication channel using symmetric‐key encryption AES‐256 algorithm. Although there are few third‐party post‐quantum authenticated and key agreement schemes exist, but the recent studies in this paper illustrates that they are not satisfying properties like unlinkability, anonymity, perfect forward secrecy, and signal leakage attacks. Therefore, the proposed protocol ensures anonymity, unlinkablity, perfect forward secrecy, and resistant against signal leakage attacks. The proposed protocol uses different random numbers for each of sessions and ensures freshness of the session key to maintain forward secrecy. In this protocol, the user (A) only communicates with server, and establish an authenticated session key with user (B) which avoids server overheads. The use of ring learning with errors (RLWE) instead of the simpler learning with errors (LWE) is primarily motivated by the need for efficiency, compactness, and scalability in cryptographic applications. A comparative study, including both performance and security assessments, demonstrates that the proposed design is more secure and efficient.
An authenticated mobile key exchange is necessary for post quantum secure communication over a public channel. It allows two entities to create a secure and unique session key for every communication session. We feel a need to design two party efficient and secure authenticated key agreement. We have also observed all the protocols given above are based on learning with error assumption over a finite ring. The ”Module Learning with Errors” assumption is the more appropriate choice among ”Learning with Errors” and ”Ring Learning with Errors” for designing practical password-authenticated key exchange protocols. With the help of ”Module Learning with Errors” assumption, and by lowering the number of ring polynomials, several implementations of the protocols can be realized. Therefore, this paper contains quantum safe, efficient, and practical ”Module Learning with Errors” assumption based authenticated key agreement protocol. The protocol’s security analysis is presented within the framework of the random oracle model.
In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.
ABSTRACT In this paper, we introduce a lattice‐based authenticated three‐party key agreement scheme for mobile devices with the aim of achieving both post‐quantum security and efficiency. Our scheme is inspired by the authenticated key exchange protocol developed. We revisit the recently suggested system, which is a communication‐efficient three‐party password‐authenticated key exchange, in which we found that the scheme is not fully correct and also demonstrate that the scheme is not safe from user's anonymity and impersonation assaults. We provide an enhanced scheme that is both effective and resistant to the mentioned assault. We also demonstrate its security in a ROM (Random Oracle Model). A comparison analysis that includes performance, security evaluations, energy consumption, and packet loss rate is also provided, proving the suitability of the suggested design.
Abstract Mobile communication is very important for an individual users, enterprisers, industries, businesses, and organizations. Since the nodes communicate through a public channel, security, and privacy become essential component for mobile communication. Both key exchange and authentication are two important security attributes to establish secure communication between two parties. In the past few years, various post‐quantum secure authentication protocols have been designed, but we have found that either some of the protocols are vulnerable to stolen smart card attack, invalid login, or signal leakage attack. In this article, we have discussed how the protocol Dharminder et al (Dharminder D, Chandran KP. J Ambient Intell Humaniz Comput. 2020; 11:4089‐4100.) is vulnerable to modified version of signal leakage attack, and sometimes called improved signal leakage attack. We have also suggested a remedy over the current existing protocol suffering from signal leakage attacks. The proposed protocol is secure against quantum attacks. We have proved the security of the proposed protocol under ring learning with errors assumption. The proposed authentication and key agreement needs only two messages exchange. We have also found the proposed is efficient in terms of computation with respect to relevant protocols.