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

Summary 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 ar...

Full description

Saved in:
Bibliographic Details
Published in:International journal of communication systems 2018-02, Vol.31 (3), p.n/a
Main Authors: Gupta, Daya Sagar, Biswas, G. P.
Format: Article
Language:English
Subjects:
authentication
Computer simulation
Cybersecurity
Digital signatures
Encryption
Exchange schemes
key exchange
lattice‐based construction
Mathematical models
Private networks
Protocol (computers)
Quantum computers
secure communication
small integer solution problem
Storage area networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary 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. In this proposal, two 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.
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.3473