By Topic

Fully-secure and efficient pairing-free certificateless authenticated key agreement protocol

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mohamed, N.A.F. ; Fac. of Math. Sci., Univ. of Khartoum, Khartoum, Sudan ; Hashim, M.H.A. ; Bashier, E.B.M. ; Hassouna, M.E.H.

Most of the certificateless two-party authenticated key agreement protocols (CTAKA) found in the literature, suffer either serious security problems making them vulnerable to types of attacks or inefficient performance that involves high computational costs. In this paper, we design an secure and efficient CTAKA. Within the proposed scheme, the KGC possesses a certificate to prove its identity to the communicating parties. The communications between the KGC and each party is secured by the SSL protocol. Each of the two communicating parties are able to compute the same secret symmetric key without any interaction between them. The protocol is fully secure against type 1 attack and fully secure against type 2 attack under the assumptions that the KGC is an honest party and each party within the network has the full capability to keep its secret values safe. Moreover, the setup of the protocol does not include pairings, does not require interactions between communicating parties during the key agreement process, and it require only one scalar multiplications over elliptic curves and one hash for the key agreement, which makes the computational cost for the key agreement comes below the computational costs of all the pairing free CTAKAs found in the literature.

Published in:

Internet Security (WorldCIS), 2012 World Congress on

Date of Conference:

10-12 June 2012