A novel and efficient lattice‐based authenticated key exchange protocol in C‐K model

Abstract

Key exchange protocols play an important role in securing the network communication over an insecure channel. In literature, a large number of key exchange schemes exist. The security of most of them is based on the Diffie-Hellman (DH) problems over a group. But these types of DH problems are solvable in the presence of quantum computers. Thus, we require a non-DH type key exchange scheme that resists to the quantum computers and new modern technologies. In this paper, 2 novel lattice-based authenticated key exchange (LB-AKE) protocols, (1) using a signature-based authenticator and (2) using a signcryption-based authenticator, are devised in Canetti-Krawczyk proof model. The security of proposed protocols depends on the hardness of small integer solutions on the lattice. An extensive proof of security to our claim is given. The proposed AKEs characterize faster computation speed and resistance to the modern complex computers. KEYWORDS authentication, key exchange, lattice-based construction, small integer solution problem, secure communication Int J Commun Syst. 2018;31:e3473.wileyonlinelibrary.com/journal/dac

Cryptographic keys exchange model for smart city applications

“…The research of Gupta and Biswas [29] deals with the novel and efficient lattice‐based authenticated key exchange protocol in Canetti‐Krawczyk model. According to the authors, Diffie–Hellman problems are solvable using quantum computers, and a different key exchange scheme resistible to the quantum computer‐based cryptanalysis is discussed.…”

Tightly‐secure two‐pass authenticated key exchange protocol using twin Diffie–Hellman problem

“…Several cryptographic primitives have tight security construction, such as public‐key encryption [4, 6, 8, 13 ], identity‐based encryption [9, 17 ], and signature scheme [5, 7, 18 ]. Unfortunately, most of the existing AKE protocols such as [10–12, 19–23 ] do not consider tight security. To achieve tight security, Bader et al 's protocol [4 ] used multi‐user secure KEM and multi‐user secure signature scheme as building blocks, and has a three‐pass execution.…”

A privacy‐preserving biometrics based authenticated key agreement scheme using ECC

“…Actually, network users are facing the increasing security problems such as the replay attack, the impersonation attack, and privacy disclosure, for the lack of a reliable authentication and privacy protection mechanism with very large possibility. Authentication and key agreement protocols, as the basic cryptographic method, can be used to deal with these security problems, and various related schemes such as in previous works [1][2][3][4] have been presented for different applications using different techniques. Therefore, developing a reliable and privacy-preserving authenticated key agreement (AKA) protocol to ensure the security of mobile communications is a very important issue.…”