|
|
Chaotic maps and biometrics-based anonymous three-party authenticated key exchange protocol without using passwords |
Xie Qi (谢琪), Hu Bin (胡斌), Chen Ke-Fei (陈克非), Liu Wen-Hao (刘文浩), Tan Xiao (谭肖) |
Hangzhou Key Laboratory of Cryptography and Network Security, Hangzhou Normal University, Hangzhou 311121, China |
|
|
Abstract In three-party password authenticated key exchange (AKE) protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password-based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well-organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.
|
Received: 10 April 2015
Revised: 05 July 2015
Accepted manuscript online:
|
PACS:
|
05.45.Vx
|
(Communication using chaos)
|
|
05.45.-a
|
(Nonlinear dynamics and chaos)
|
|
Fund: Project supported by the Natural Science Foundation of Zhejiang Province, China (Grant No. LZ12F02005), the Major State Basic Research Development Program of China (Grant No. 2013CB834205), and the National Natural Science Foundation of China (Grant No. 61070153). |
Corresponding Authors:
Xie Qi, Liu Wen-Hao
E-mail: qixie68@126.com;whl819819@163.com
|
Cite this article:
Xie Qi (谢琪), Hu Bin (胡斌), Chen Ke-Fei (陈克非), Liu Wen-Hao (刘文浩), Tan Xiao (谭肖) Chaotic maps and biometrics-based anonymous three-party authenticated key exchange protocol without using passwords 2015 Chin. Phys. B 24 110505
|
[1] |
He D J, Chen C, Ma M D, Chan S and Bu J J 2013 Int. J. Commun. Syst. 26 495
|
[2] |
Khan M K and Kumari S 2014 Secur. Commun. Netw. 7 399
|
[3] |
Mishra D, Das A K and Mukhopadhyay S 2014 Expert Syst. Appl. 41 8129
|
[4] |
Xie Q, Tan X, Wong D S, Wang G, Bao M and Dong N 2014 Secur. Commun. Netw. 7 1264
|
[5] |
He D, Chen J and Hu J 2012 J. Int. Technol. 13 405
|
[6] |
Özkaynak F and Yavuz S 2013 Nonlinear Dyn. 74 551
|
[7] |
Zhang L 2008 Chaos Soliton. Fract. 37 669
|
[8] |
Wang X Y and Liu L T 2013 Chin. Phys. B 22 050503
|
[9] |
Qi G Y and Sandra B M 2014 Chin. Phys. B 23 050507
|
[10] |
Deng S, Li Y and Xiao D 2010 Commun. Nonlinear Sci. Numer. Simul. 15 1338
|
[11] |
Farash M S and Attari M A 2014 Nonlinear Dyn. 76 1203
|
[12] |
He D, Chen Y and Chen Y 2012 Nonlinear Dyn. 69 1149
|
[13] |
Tan Z 2013 Nonlinear Dyn. 72 311
|
[14] |
Xue K and Hong P 2012 Commun. Nonlinear Sci. Numer. Simulat. 17 2969
|
[15] |
Lin H Y 2015 Commun. Nonlinear Sci. Numer. Simulat. 20 482
|
[16] |
Yoon E and Jeon I 2011 Commun. Nonlinear Sci. Numer. Simulat. 16 2383
|
[17] |
Wang X and Zhao J 2010 Commun. Nonlinear Sci. Numer. Simulat. 15 4052
|
[18] |
Lai H, Xiao J, Li L and Yang Y 2012 Math. Probl. Eng. 2012 454823
|
[19] |
Zhao F, Gong P, Li S, Li M and Li P 2013 Nonlinear Dyn. 74 419
|
[20] |
Lee C, Li C and Hsu C 2013 Nonlinear Dyn. 73 125
|
[21] |
Hu X X and Zhang Z F 2014 Nonlinear Dyn. 78 1293
|
[22] |
Xie Q, Hu B, Dong N and Wong D S 2014 PLoS ONE 9 e102747
|
[23] |
Xie Q, Zhao J and Yu X 2013 Nonlinear Dyn. 74 1021
|
[24] |
Lai H, Orgun M A, Xiao J H, Pieprzyk J, Xue L Y and Yang Y X 2014 Nonlinear Dyn. 77 1427
|
[25] |
Farash M S and Attari M A 2014 Nonlinear Dyn. 77 399
|
[26] |
Xie Q, Hu B and Wu T 2015 Nonlinear Dyn. 79 2345
|
[27] |
Shu J 2015 Chin. Phys. B 24 060509
|
[28] |
Lee C C, Li C T, Chiu S T and Lai Y M 2015 Nonlinear Dyn. 79 2485
|
[29] |
Li C T and Hwang M S 2010 J. Netw. Comput. Appl. 33 1
|
[30] |
Abadi M, Blanchet B and Lundh H C 2009 21st International Conference on Computer Aided Verification, June 26, 2009, Grenoble, France, pp. 35–49
|
[31] |
Abadi M and Fournet C Proceedings of the 28th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 2001, New York, USA, p. 104
|
[32] |
Dolev D and Yao A C 1983 IEEE Tran. Inform. Theory 29 198
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|