An Efficient ID-Based Authenticated Key Ezchange Protocol
Its well known that the ID-based authenticated key exchange protocol is surprisingly difficult to design and prove, since it is difficult for simulator to fully support the Session Key Reveal query without static private key. The purported security of many ID-based protocols is either based on heuristic security arguments or the protocols are proven secure in a restricted model. In this paper, we propose an efficient ID-based authenticated key exchange protocol, called EIDAKE, which is provably secure in the currently strongest AKE security model, the eCK model. The protocol achieves the efficiency of the most efficient ID-based AKE protocol in terms of exponentiation. Moreover, our protocol enjoys a simple and intuitive reduction.Index Terms-ID-based, Authenticated key exchange, Provably secure, Gap Bilinear Diffie-Hellman assumption, Computational Diffie-Hellman assumption.
Xuexian Hu Wenfen Liu Jianhui Zhang
Zhengzhou Information Science and Technology Institute, Zhengzhou 450002, P.R.China National Digital Switching System Engineering and Technological Research Center, Zhengzhou 450002, P
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
888-892
2009-07-10（万方平台首次上网日期，不代表论文的发表时间）