A novel pairing-free certificateless authenticated key agreement protocol with provable security  

作　　者：Haiyan SUN Qiaoyan WEN Hua ZHANG Zhengping JIN 

机构地区：[1]State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

出　　处：《Frontiers of Computer Science》2013年第4期544-557,共14页中国计算机科学前沿（英文版）

摘　　要：Recently, He et al. （Computers and Mathematics with Applications, 2012） proposed an efficient pairing-free certificateless authenticated key agreement （CL-AKA） protocol and claimed their protocol was provably secure in the extended Canetti-Krawczyk （eCK） model. By giving concrete attacks, we indicate that their protocol is not secure in the eCK model. We propose an improved protocol and show our improvement is secure in the eCK model under the gap DiffieHellman （GDH） assumption. Furthermore, the proposed protocol is very efficient.Recently, He et al. （Computers and Mathematics with Applications, 2012） proposed an efficient pairing-free certificateless authenticated key agreement （CL-AKA） protocol and claimed their protocol was provably secure in the extended Canetti-Krawczyk （eCK） model. By giving concrete attacks, we indicate that their protocol is not secure in the eCK model. We propose an improved protocol and show our improvement is secure in the eCK model under the gap DiffieHellman （GDH） assumption. Furthermore, the proposed protocol is very efficient.

关 键 词：ATTACKS PAIRINGS eCK model provable security certificateless authenticated key agreement 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术] TP301[自动化与计算机技术—计算机科学与技术]