Provably Secure Certificateless One-Way and Two-Party Authenticated Key Agreement Protocol

Abstract

Abstract. Key agreement protocols are one of the fundamental primitives in cryptography. In this paper, we formalize the security model for certificateless one-way and two-party authenticated key agreement protocols and propose a concrete certificateless one-way and two-party authenticated key agreement protocol. The security of our protocol is proven under the computational Diffie-Hellman, square computational Diffie-Hellman and gap bilinear Diffie-Hellman assumptions. As for efficiency, the protocol requires only one pass and has low communication overhead.

A Taxonomy and Comparison of Two-Party Key Agreement Protocols

“…This can be redefined in the following way: [13] 3 T spmul + 3 T padd + 2T hash Amr Farouk [11] 3 T spmul + 5 T padd + 2 T hash Debiao He [3] 5 T spmul + 3 T padd + 2 T hash He Debiao [7] 5T spmul + 3 T padd + 2 T hash + 1 T sinv He Debiao [8] 5 T spmul + 4 T padd + 2 T hash G. Yang [9] 9 T spmul + 2 T hash Mengbo Hou [10] 6 T spmul + 2 T hash Manman Geng [6] 7 T spmul + 2 T hash S-M Ghoreishi [26] 3 T spmul + 1 T hash [12] 2 T pair + 4 T spmul + 2 T hash LI Gui-ying [14] 2 T pair + 5 T spmul + 4 T padd + 1 T hash Lei Zhang [15] 2 T pair + 4 T spmul + 2 T hash PAN Jin [16] 2 T pair + 2 T spmul + 1 T padd + 2 T hash Lei Zhang [17] 1 T pair + 4 T spmul + 2 T padd + 2 T hash Liu Wenhao [18] 2 T pair + 2 T spmul + 2 T hash Mengbo Hou [19] 1 T pair + 1 T exp + 4 T spmul + 1 T padd + 1 T hash Tarjei K. Mandt [20] 2 T pair + 1 T exp + 3 T spmul + 2 T padd + 1 T mac SHI Yijuan [21] 1 T pair + 1 T exp + 2 T spmul + 1 T padd + 1 T hash WANG Shengbao [22] 1 T pair + 3 T spmul + T hash…”