An efficient and anonymous multi-server authenticated key agreement based on chaotic map without engaging Registration Centre

被引:43
作者
Irshad, Azeem [1 ]
Sher, Muhammad [1 ]
Chaudhary, Shehzad Ashraf [1 ]
Naqvi, Husnain [1 ]
Farash, Mohammad Sabzinejad [2 ]
机构
[1] Int Islamic Univ, Dept Comp Sci & Software Engn, Islamabad, Pakistan
[2] Kharazmi Univ, Fac Math Sci & Comp, Tehran, Iran
关键词
Multi-server authentication; Chebyshev chaotic map; Registration centre; Authentication key agreement; PASSWORD AUTHENTICATION; SCHEME; SECURITY; PROTOCOL;
D O I
10.1007/s11227-016-1688-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-server authentication (MSA) enables the user to avail multiple services permitted from various servers out of a single registration through registration centre. Earlier, through single-server authentication, a user had to register all servers individually for availing the respective services. In the last few years, many MSA-based schemes have been presented; however, most of these suffer communication overhead cost due to the Registration Centre (RC) involvement in every mutual authentication session. In voice communication this round-trip latency becomes even more noticeable. Hence, the focus of the protocols design has been shifted towards light-weight cryptographic techniques such as Chebyshev chaotic map technique (CCM). We have reviewed few latest MSA-related schemes based on CCM and elliptic curve cryptography (ECC) as well. Based on these limitations and considerations, we have proposed a single-round trip MSA protocol based on CCM technique that foregoes the RC involvement during mutual authentication. Our study work is cost efficient in terms of communication delay and computation, and provides enhanced security by the use of public key cryptosystem. The proposed scheme is duly backed by formal security analysis and performance evaluation.
引用
收藏
页码:1623 / 1644
页数:22
相关论文
共 45 条
[1]   Cryptography with chaos [J].
Baptista, MS .
PHYSICS LETTERS A, 1998, 240 (1-2) :50-54
[2]   A fast chaotic encryption scheme based on piecewise nonlinear chaotic maps [J].
Behnia, S. ;
Akhshani, A. ;
Ahadpour, S. ;
Mahmodi, H. ;
Akhavan, A. .
PHYSICS LETTERS A, 2007, 366 (4-5) :391-396
[3]   Practice-oriented provable-security [J].
Bellare, M .
LECTURES ON DATA SECURITY, 1999, 1561 :1-15
[4]   An anonymous multi-server authenticated key agreement scheme based on trust computing using smart cards and biometrics [J].
Chuang, Ming-Chin ;
Chen, Meng Chang .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (04) :1411-1418
[5]   Analysis and Improvement of a Robust Smart Card Based-Authentication Scheme for Multi-Server Architecture [J].
Guo, Dianli ;
Wen, Fengtong .
WIRELESS PERSONAL COMMUNICATIONS, 2014, 78 (01) :475-490
[6]   Secure group key agreement protocol based on chaotic Hash [J].
Guo, Xianfeng ;
Zhang, Jiashu .
INFORMATION SCIENCES, 2010, 180 (20) :4069-4074
[7]   Security of a key agreement protocol based on chaotic maps [J].
Han, Song .
CHAOS SOLITONS & FRACTALS, 2008, 38 (03) :764-768
[8]   Applying Semigroup Property of Enhanced Chebyshev Polynomials to Anonymous Authentication Protocol [J].
Lai, Hong ;
Xiao, Jinghua ;
Li, Lixiang ;
Yang, Yixian .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
[9]   Improvement of the secure dynamic ID based remote user authentication scheme for multi-server environment [J].
Hsiang, Han-Cheng ;
Shih, Wei-Kuan .
COMPUTER STANDARDS & INTERFACES, 2009, 31 (06) :1118-1123
[10]   Anonymous authentication protocol based on elliptic curve Diffie-Hellman for wireless access networks [J].
Hsieh, Wen-Bin ;
Leu, Jenq-Shiou .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2014, 14 (10) :995-1006