[Resource Topic] 2016/388: Tightly-Secure Authenticated Key Exchange without NAXOS' approach based on Decision Linear Problem

Welcome to the resource topic for 2016/388

Title:
Tightly-Secure Authenticated Key Exchange without NAXOS’ approach based on Decision Linear Problem

Authors: Mojahed Mohamed, Xiaofen Wang, 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.

ePrint: https://eprint.iacr.org/2016/388

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .