Provably secure dynamic identity-based three-factor password authentication scheme using extended chaotic maps

With the aim of guaranteeing secure communication through public networks, three-factor password authentication (TF-PWA) scheme plays a key role in many internet applications. Since in TF-PWA scheme, the communicating entities can mutually authenticate each other and generate a shared session key, w...

Full description

Saved in:
Bibliographic Details
Published in:Nonlinear dynamics Vol. 78; no. 3; pp. 2261 - 2276
Main Author: Islam, SK Hafizul
Format: Journal Article
Language:English
Published: Dordrecht Springer Netherlands 01.11.2014
Springer Nature B.V
Subjects:
Authentication
Automotive Engineering
Chaos theory
Classical Mechanics
Communication
Control
Digital imaging
Digital signatures
Dynamical Systems
Encryption
Engineering
Exchange
Mechanical Engineering
Networks
Nonlinear dynamics
Original Paper
Passwords
Public Key Infrastructure
Security
Vibration
Weight reduction
Provable security
Chaotic map
Hash function
Session key
Password
ISSN:0924-090X, 1573-269X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the aim of guaranteeing secure communication through public networks, three-factor password authentication (TF-PWA) scheme plays a key role in many internet applications. Since in TF-PWA scheme, the communicating entities can mutually authenticate each other and generate a shared session key, which will be used for secure exchange of messages in succeeding communication among them. As a result, the TF-PWA schemes gain enormous consideration in recent years. More recently, due to light-weight features of the extended chaotic map, it is also extensively applied in designing of public key encryption, key agreement, image encryption, S-box, hash function, digital signature, password authentication, etc. The aim of this paper was to design a dynamic identity-based three-factor password authentication scheme using extended chaotic map (ECM-TF-PWA) in the random oracle model. The proposed scheme is provably secure based on the intractability assumption of chaotic map-based Diffie–Hellman problem. The informal security analysis gives the evidence that our scheme protects all attacks and provides functionality attributes that are needed in a three-factor authentication system. Besides, the performance discussion shows that our scheme performs better than others in respect of computation and communication cost.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0924-090X
1573-269X
DOI:10.1007/s11071-014-1584-x