论文信息 - Parallizable simple authenticated key agreement protocol

Parallizable simple authenticated key agreement protocol

Recently, Yeh and Sun proposed a simple authenticated key agreement protocol resistant to password guessing attacks called SAKA that is simple and cost-effective. And they provided a formal proof of security to show its strength against both passive and active adversaries. Compared with the previous well-known protocols, SAKA has less number of steps and less computation cost. However, considering the total execution time, SAKA is not the most efficient method, since it does not provide parties with parallel computation. In this paper, we present parallelizable simple authenticated key agreement protocol for improving the efficiency of the SAKA while maintaining provable security.

Kee-Young Yoo | Sung-Woon Lee | Hyun-Sung Kim | Woo-Hun Kim

[1] Mihir Bellare,et al. Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.

[2] Taekyoung Kwon,et al. A Study on the Generalized Key Agreement and Password Authentication Protocol , 2000 .

[3] Peter Sweeney,et al. Simple authenticated key agreement algorithm , 1999 .

[4] Sarvar Patel,et al. Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman , 2000, EUROCRYPT.

[5] Hung-Min Sun,et al. Simple authenticated key agreement protocol resistant to password guessing attacks , 2002, OPSR.

[6] Steven M. Bellovin,et al. Encrypted key exchange: password-based protocols secure against dictionary attacks , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.

[7] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.