Tightly-Secure Authenticated Key Exchange without NAXOS' approach based on Decision Linear Problem

Mojahed Mohamed; Xiaofen Wang; Xiaosong Zhang

Paper 2016/388

Tightly-Secure Authenticated Key Exchange without NAXOS' approach based on Decision Linear Problem

Mojahed Mohamed, Xiaofen Wang, and Xiaosong Zhang

Abstract

Design secure Authenticated Key Exchange (AKE) protocol without NAXOS approach is remaining as an open problem. NAXOS approach \cite{4} is used to hide the secret ephemeral 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 used in computing the exponent of the ephemeral public key. (ii) maximize 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.

Note: Modified some mistyping errors

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: AKE eCK model NAXOS' approach Decision Linear assumption
Contact author(s): mmmmoj @ hotmail com
History: 2016-04-19: received
Short URL: https://ia.cr/2016/388
License: CC BY

BibTeX

@misc{cryptoeprint:2016/388,
      author = {Mojahed Mohamed and Xiaofen Wang and Xiaosong Zhang},
      title = {Tightly-Secure Authenticated Key Exchange without {NAXOS}' approach based on Decision Linear Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/388},
      year = {2016},
      url = {https://eprint.iacr.org/2016/388}
}