%0 Journal Article
%T Tightly-Secure Authenticated Key Exchange without NAXOS¡¯ Approach Based on Decision Linear Problem
%A Mojahed Mohamed
%A Xiaofen Wang
%A Xiaosong Zhang
%J Open Access Library Journal
%V 3
%N 10
%P 1-16
%@ 2333-9721
%D 2016
%I Open Access Library
%R 10.4236/oalib.1103033
%X
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.
%K AKE
%K eCK Model
%K NAXOS¡¯ Approach
%K Decision Linear Assumption
%U http://www.oalib.com/paper/5273393