An improved and secure chaotic map based authenticated key agreement in multi-server architecture

被引:17
作者
Irshad, Azeem [1 ]
Sher, Muhammad [1 ]
Chaudhry, Shehzad Ashraf [1 ]
Xie, Qi [2 ]
Kumari, Saru [3 ]
Wu, Fan [4 ]
机构
[1] Int Islamic Univ, Comp Sci Dept, Islamabad, Pakistan
[2] Hangzhou Normal Univ, Hangzhou Key Lab Cryptog & Network Secur, Hangzhou, Peoples R China
[3] Chaudhary Charan Singh Univ, Meerut 250004, Uttar Pradesh, India
[4] Xiamen Inst Technol, Xiamen, Peoples R China
关键词
Multi-server authentication; Chebyshev chaotic map; Cryptography; Authentication key agreement; WAY HASH FUNCTION; SMART CARDS; PASSWORD AUTHENTICATION; CHEBYSHEV POLYNOMIALS; SCHEME; PROTOCOL; EFFICIENT; PRIVACY; CRYPTANALYSIS; SYSTEM;
D O I
10.1007/s11042-016-4236-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-Server Authentication (MSA) provides the user an efficient way to avail multiple services of various multimedia service providers, once after getting registered from a registration centre. Previously, a user had to register all servers individually to use their respective service; which proves to be a redundant and inefficient procedure in comparison with MSA. Many MSA-based techniques have been put forward by researchers, so far, however with proven pitfalls. In the last few years, the focus has been shifted towards a more flexible and efficient Chebyshev cryptographic technique. In this regard, recently Tan's scheme presented a chaotic map based multi-server authentication scheme with a focus on login scalability. Nonetheless, Tan's scheme has been found vulnerable to insider (impersonation attack) and stolen smart card attacks. Besides, the Tan's scheme fails to differentiate the login requests between the two presented cases. The current study work is based on improving the Tan's technique in terms of security in almost an equivalent cost. The security for proposed work is evaluated in the performance evaluation section, while it shows that the security is provable under formal security model, as well as using BAN Logic.
引用
收藏
页码:1167 / 1204
页数:38
相关论文
共 50 条
[1]  
[Anonymous], J SUPERCOMPUT
[2]   Logic of authentication [J].
Burrows, Michael ;
Abadi, Martin ;
Needham, Roger .
Operating Systems Review (ACM), 1989, 23 (05) :1-13
[3]  
Chen Y.L, 2009, NOVEL MULTISERVER AU, P161
[4]   More on security of public-key cryptosystems based on Chebyshev polynomials [J].
Cheong, Kai Y. ;
Koshiba, Takeshi .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (09) :795-799
[5]   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
[6]  
He D, 2013, WIRELESS PERS COMMUN, P1
[7]   Cryptanalysis and improvement of an extended chaotic maps-based key agreement protocol [J].
He, Debiao ;
Chen, Yitao ;
Chen, Jianhua .
NONLINEAR DYNAMICS, 2012, 69 (03) :1149-1157
[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]   A single round-trip SIP authentication scheme for Voice over Internet Protocol using smart card [J].
Irshad, Azeem ;
Sher, Muhammad ;
Rehman, Eid ;
Ch, Shehzad Ashraf ;
Ul Hassan, Mahmood ;
Ghani, Anwar .
MULTIMEDIA TOOLS AND APPLICATIONS, 2015, 74 (11) :3967-3984