Journal of shanghai Jiaotong University (Science) ›› 2014, Vol. 19 ›› Issue (4): 436-439.doi: 10.1007/s12204-014-1521-7

Previous Articles     Next Articles

Provably Secure Authenticated Diffie-Hellman Key Exchange for Resource-Limited Smart Card

Provably Secure Authenticated Diffie-Hellman Key Exchange for Resource-Limited Smart Card

CHIEN Hung-yu (简宏宇)   

  1. (Department of Information Management, National Chi-Nan University, Nantou 542, Taiwan, China)
  2. (Department of Information Management, National Chi-Nan University, Nantou 542, Taiwan, China)
  • Published:2014-10-13
  • Contact: CHIEN Hung-yu (简宏宇) E-mail: hychien@ncnu.edu.tw

Abstract: Authenticated Diffie-Hellman key agreement is quite popular for establishing secure session keys. As resource-limited mobile devices are becoming more popular and security threats are increasing, it is desirable to reduce computational load for these resource-limited devices while still preserving its strong security and convenience for users. In this paper, we propose a new smart-card-based user authenticated key agreement scheme which allows users to memorize passwords, reduces users’ device computational load while still preserves its strong security. The proposed scheme effectively improves the computational load of modular exponentiations by 50%, and the security is formally proved.

Key words: Diffie-Hellman| key agreement| forward secrecy| authentication| password

摘要: Authenticated Diffie-Hellman key agreement is quite popular for establishing secure session keys. As resource-limited mobile devices are becoming more popular and security threats are increasing, it is desirable to reduce computational load for these resource-limited devices while still preserving its strong security and convenience for users. In this paper, we propose a new smart-card-based user authenticated key agreement scheme which allows users to memorize passwords, reduces users’ device computational load while still preserves its strong security. The proposed scheme effectively improves the computational load of modular exponentiations by 50%, and the security is formally proved.

关键词: Diffie-Hellman| key agreement| forward secrecy| authentication| password

CLC Number: