Abstract Authenticated key exchange protocol is widely applied in the Internet services. Lattice‐based key exchange protocols turn out to be quantum‐resistant and hence have attracted tremendous attention. A lattice‐based explicit authenticated key exchange protocol is constructed by combining an IND‐CPA key encapsulation mechanism with a strong EUF‐CMA digital signature under the message‐recovery mode. Concrete parameter specifications are suggested under the 102 and 218 bits post‐quantum security, respectively. Compared with the implicit authenticated key exchange derived directly from the key encapsulation mechanism, our proposals reduce the communication costs by 21.7% and 25.7%, respectively, under the same post‐quantum security level. Rough analysis shows that the proposals also obtain some advantages over previous constructions in term of computational efficiency. Moreover, our scheme achieves perfect forward secrecy while the original scheme only satisfies weak forward secrecy.
Abstract Authenticated key exchange protocol is widely applied in the Internet services. Lattice‐based key exchange protocols turn out to be quantum‐resistant and hence have attracted tremendous attention. A lattice‐based explicit authenticated key exchange protocol is constructed by combining an IND‐CPA key encapsulation mechanism with a strong EUF‐CMA digital signature under the message‐recovery mode. Concrete parameter specifications are suggested under the 102 and 218 bits post‐quantum security, respectively. Compared with the implicit authenticated key exchange derived directly from the key encapsulation mechanism, our proposals reduce the communication costs by 21.7% and 25.7%, respectively, under the same post‐quantum security level. Rough analysis shows that the proposals also obtain some advantages over previous constructions in term of computational efficiency. Moreover, our scheme achieves perfect forward secrecy while the original scheme only satisfies weak forward secrecy.
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.
To solve the problem that existing Authenticated Key Exchange(AKE) protocols have high computational complexity and cannot resist quantum attacks,this paper proposes an AKE protocol based on R-LWE problem on lattice.The KEM scheme constructed based on R-LWE problem is combined with the digital signature algorithm with the message recovery function to achieve authentication,and the Peikert-type error coordination mechanism is replaced by the encrypted construction method to obtain the random and uniform session key.Analysis results show that,compared with the protocol designed by BOS,et al.,the proposed protocol has lower computational complexity,significantly reduces traffic,and effectively resists quantum attacks.
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.
Abstract To address the issue of low efficiency caused by the repeated use of quantum attack resistant static identity authentication methods in a satellite integrated smart grid, this paper proposes a quantum attack resistant continuous identity authentication protocol. First, in the initial authentication stage, in order to reduce computational complexity, the key encryption mechanism in the CRYSTALS‐Kyber algorithm was improved and combined with the NTRU message recovery digital signature scheme to construct a lattice based explicit AKE (Kyber NTRU. AKE), which achieved mutual authentication and negotiated shared tokens. Second, in the continuous authentication stage, incorporating quantum attack resistant tokens into the current algorithm to improve authentication efficiency. The formal analysis results indicate that compared to the weakly forward secure Kyber.AKE in the CRYSTALS‐Kyber algorithm, Kyber‐NTRU.AKE achieves complete forward secrecy, while the non‐formal analysis results demonstrate the security of the continuous authentication phase. Through theoretical analysis and efficiency comparison with Cyber.AKE, the analysis shows that the Cyber‐NTRU.AKE has higher computational and communication efficiency than Cyber.AKE.
Summary The mobile satellite communication (MSC) system represents a crucial means of communication, facilitating connections between mobile users and network control centres through satellites. Given the wireless nature of satellite communication, ensuring communication security is paramount for maintaining accountability. Key exchange and authentication (KEA) mechanisms are commonly employed to secure data transmitted over insecure or open channels. Developing a lattice‐based KEA protocol for MSC systems is imperative to achieve both quantum security and efficient communication. In this direction, Yadav et al. devised ring learning with an error‐based KEA technique to ensure a quantum‐safe environment. Their scheme is quantum‐safe and satisfies desirable security attributes but has low efficiency in computation. Moreover, we have identified that their scheme is susceptible to denial of service attack and session key established at user and NCC ends is different. To overcome the flaws of Yadav et al., we propose a lattice‐based KEA protocol for the MSC system to improve computation efficiency, and get resistance against key mismatch attack. The security analysis of the proposed scheme is presented in the random oracle model. Comparative study is also presented to observe advantages in computation efficiency.
Abstract Password‐authenticated key exchange ( PAKE ) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post‐quantum PAKE scheme becomes an open research question. In this paper, the authors construct a quantum‐safe PAKE protocol, which is a horizontal extension of the password‐authenticated key (PAK) protocol in the field of module lattices. Subsequently, the authors accompany the proposed protocol with a rigorous security proof in the random oracle model with two adaptions: applying the CDF‐Zipf model to characterise the ability of the adversary and using the pairing with errors assumption to simplify the proof. Taking the flexibility of the module learning with errors ( MLWE ) problem, the authors elaborately select three parameter sets to meet different application scenarios. Specifically, the authors’ Recommended‐PAKE implementation achieves 177‐bit post‐quantum security with a generous margin to cope with later improvement in cryptanalysis. The performance results indicate that the authors’ MLWE‐PAKE is quite practical: compared with the latest Yang‐PAK , the authors’ Recommended‐PAK reduces the communication cost and the running time by 36.8% and 13.8%, respectively.