Share This Article:

Tightly-Secure Authenticated Key Exchange without NAXOS’ Approach Based on Decision Linear Problem

Full-Text HTML XML Download Download as PDF (Size:642KB) PP. 1-16
DOI: 10.4236/oalib.1103033    437 Downloads   779 Views

ABSTRACT

Design Secure Authenticated Key Exchange (AKE) protocol without NAXOS approach is remaining as an open problem. NAXOS approach [4] is used to hide the ephemeral secret key from an adversary even if the adversary in somehow may obtain the ephemeral secret key. Using NAXOS approach will cause two main drawbacks: (i) leaking of the static secret key which will be utilized in computing the exponent of the ephemeral public key; (ii) maximization of using random oracle when applying to the exponent of the ephemeral public key and session key derivation. In this paper, we present another AKE-secure without NAXOS approach based on decision linear assumption in the random oracle model. We fasten our security using games sequences tool which gives tight security for our protocol.

Cite this paper

Mohamed, M. , Wang, X. and Zhang, X. (2016) Tightly-Secure Authenticated Key Exchange without NAXOS’ Approach Based on Decision Linear Problem. Open Access Library Journal, 3, 1-16. doi: 10.4236/oalib.1103033.

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.