Tightly-Secure Authenticated Key Exchange without NAXOS’ Approach Based on Decision Linear Problem - Open Access Library Journal

OALibJ > Vol.3 No.10, October 2016

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

HTML XML

Download as PDF (Size: 642KB) PP. 1-16

DOI: 10.4236/oalib.1103033 766 Downloads 1,693 Views Citations

Author(s)

Mojahed Mohamed^1,2, Xiaofen Wang¹, Xiaosong Zhang¹

Affiliation(s)

¹School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China.
²Department of Electronic Engineering, Karary University, Omdurman, Sudan.

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.

KEYWORDS

AKE, eCK Model, NAXOS’ Approach, Decision Linear Assumption

Share and Cite:

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.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies