An efficient authentication with key agreement procedure using Mittag–Leffler–Chebyshev summation chaotic map under the multi-server architecture

Author(s):  
Chandrashekhar Meshram ◽  
Rabha W. Ibrahim ◽  
Sarita Gajbhiye Meshram ◽  
Sajjad Shaukat Jamal ◽  
Agbotiname Lucky Imoize
2017 ◽  
Vol 43 (2) ◽  
pp. 811-828 ◽  
Author(s):  
Azeem Irshad ◽  
Shehzad Ashraf Chaudhry ◽  
Qi Xie ◽  
Xiong Li ◽  
Mohammad Sabzinejad Farash ◽  
...  

2017 ◽  
Vol 77 (1) ◽  
pp. 1167-1204 ◽  
Author(s):  
Azeem Irshad ◽  
Muhammad Sher ◽  
Shehzad Ashraf Chaudhry ◽  
Qi Xie ◽  
Saru Kumari ◽  
...  

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Peng Jiang ◽  
Qiaoyan Wen ◽  
Wenmin Li ◽  
Zhengping Jin ◽  
Hua Zhang

With advancement of computer community and widespread dissemination of network applications, users generally need multiple servers to provide different services. Accordingly, the multiserver architecture has been prevalent, and designing a secure and efficient remote user authentication under multiserver architecture becomes a nontrivial challenge. In last decade, various remote user authentication protocols have been put forward to correspond to the multi-server scenario requirements. However, these schemes suffered from certain security problems or their cost consumption exceeded users’ own constrained ability. In this paper, we present an anonymous remote user authentication with key agreement scheme for multi-server architecture employing self-certified public keys without pairings. The proposed scheme can not only retain previous schemes’ advantages but also achieve user privacy concern. Moreover, our proposal can gain higher efficiency by removing the pairings operation compared with the related schemes. Through analysis and comparison with the related schemes, we can say that our proposal is in accordance with the scenario requirements and feasible to the multi-server architecture.


Sign in / Sign up

Export Citation Format

Share Document