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

doi:10.1007/s11704-013-2305-1

Front Comput Sci

2013, Vol. 7

Issue (4) : 544-557 https://doi.org/10.1007/s11704-013-2305-1

RESEARCH ARTICLE

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

Haiyan SUN(

), Qiaoyan WEN, Hua ZHANG, Zhengping JIN

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

Download: PDF(428 KB) HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

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 Diffie- Hellman (GDH) assumption. Furthermore, the proposed protocol is very efficient.

Keywords attacks pairings eCK model provable security certificateless authenticated key agreement

Corresponding Author(s): SUN Haiyan,Email:wenzhong2520@gmail.com

Issue Date: 01 August 2013

Cite this article:

Haiyan SUN,Qiaoyan WEN,Hua ZHANG, et al. A novel pairing-free certificateless authenticated key agreement protocol with provable security[J]. Front Comput Sci, 2013, 7(4): 544-557.

URL:

https://academic.hep.com.cn/fcs/EN/10.1007/s11704-013-2305-1
https://academic.hep.com.cn/fcs/EN/Y2013/V7/I4/544

1	Shamir A. Identity-based cryptosystems and signature schemes. Lecture Notes in Computer Science , 1985, 196: 47-53 doi: 10.1007/3-540-39568-7_5
2	Al-Riyami S, Paterson K G. Certificateless public key cryptography. Lecture Notes in Computer Science , 2003, 2894: 452-473 doi: 10.1007/978-3-540-40061-5_29
3	Wang S, Cao Z, Dong X. Certificateless authenticated key agreement based on theMTI/CO protocol. Journal of Information and Computational Science , 2006, 3(3): 575-581
4	Shi Y, Li J. Two-party authenticated key agreement in certificateless public key cryptography. Wuhan University Journal of Natural Sciences , 2007, 12(1): 71-74 doi: 10.1007/s11859-006-0194-y
5	Luo M, Wen Y, Zhao H. An enhanced authentication and key agreement mechanism for SIP using certificateless public-key cryptography. In: Proceedings of the 9th International Conference for Young Computer Scientists . 2008, 1577-1582
6	Mandt T, Tan C. Certificateless authenticated two-party key agreement protocols. Lecture Notes in Computer Science , 2007, 4435: 37-44 doi: 10.1007/978-3-540-77505-8_4
7	Wang F, Zhang Y. A new provably secure authentication and key agreement mechanism for SIP using certificateless public-key cryptography. Computer Communications , 2008, 31(10): 2142-2149 doi: 10.1016/j.comcom.2008.01.054
8	Swanson C, Jao D. A study of two-party certificateless authenticated key agreement protocols. Lecture Notes in Computer Science , 2009, 5922: 57-71 doi: 10.1007/978-3-642-10628-6_4
9	Lippold G, Boyd C, Nieto González J. Strongly secure certificateless key agreement. Lecture Notes in Computer Science , 2009, 5671: 206-230 doi: 10.1007/978-3-642-03298-1_14
10	Zhang L, Zhang F, Wu Q, Domingo-Ferrer J. Simulatable certificateless two party authenticated key agreement protocol . Information Sciences , 2010, 180(6): 1020-1030 doi: 10.1016/j.ins.2009.11.036
11	He D, Chen C, Chan S, Bu J. Secure and efficient handover authentication based on bilinear pairing functions. IEEE Transactions on Wireless Communications , 2012, 11(1): 48-53 doi: 10.1109/TWC.2011.110811.111240
12	Aranha D, Faz-Hernández A, López J, Rodríguez-Henríquez F. Faster implementation of scalar multiplication on Koblitz curves. In: Proceedings of the 2nd International Conference on Cryptology and Information Security in Latin America . 2012, 177-193
13	Aranha D, Karabina K, Longa P, Gebotys C, López J. Faster explicit formulas for computing pairings over ordinary curves. Lecture Notes in Computer Science , 2011, 6632: 48-68 doi: 10.1007/978-3-642-20465-4_5
14	Hou M, Xu Q. A two-party certificateless authenticated key agreement protocol without pairing. In: Proceedings of the 2nd IEEE International Conference on Computer Science and Information Technology . 2009, 412-416
15	He D, Chen Y, Chen J. A pairing-free certificateless authenticated key agreement protocol. International Journal of Communication Systems , 2012, 25(2): 221-230 doi: 10.1002/dac.1265
16	He D, Chen Y, Chen J, Zhang R, Han W. A new two-round certificateless authenticated key agreement protocol without bilinear pairings . Mathematical and Computer Modelling , 2011, 54(11-12): 3143-3152 doi: 10.1016/j.mcm.2011.08.004
17	Xiong H, Wu Q, Chen Z. Toward pairing-free certificateless authenticated key exchanges. Lecture Notes in Computer Science , 2011, 7001: 79-94 doi: 10.1007/978-3-642-24861-0_6
18	Geng M, Zhang F. Provably secure certificateless two-party authenticated key agreement protocol without pairing. In: Proceedings of the 2009 International Conference on Computational Intelligence and Security . 2009, 208-212 doi: 10.1109/CIS.2009.152
19	Yang G, Tan C. Strongly secure certificateless key exchange without pairing. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security . 2011, 71-79
20	He D, Padhye S, Chen J. An efficient certificateless two-party authenticated key agreement protocol. Computers and Mathematics with Applications , 2012, 64(6): 1914-1926 doi: 10.1016/j.camwa.2012.03.044
21	Bellare M, Rogaway P. Entity authentication and key distribution. Lecture Notes in Computer Science , 1993, 773: 232-249 doi: 10.1007/3-540-48329-2_21
22	Canetti R, Krawczyk H. Analysis of key-exchange protocols and their use for building secure channels. Lecture Notes in Computer Science , 2001, 2045: 453-474 doi: 10.1007/3-540-44987-6_28
23	LaMacchia B, Lauter K, Mityagin A. Stronger security of authenticated key exchange. In: Proceedings of the 1st International Conference on Provable Security . 2007, 1-16 doi: 10.1007/978-3-540-75670-5_1
24	Choo K, Boyd C, Hitchcock Y. Examining indistinguishability-based proof models for key establishment protocols. Lecture Notes in Computer Science , 2005, 3788: 585-604 doi: 10.1007/11593447_32
25	Boneh D, Gentry C, Lynn B, Shacham H. A survey of two signature aggregation techniques. CryptoBytes , 2003, 6(2): 1-10

[1]	Yudi ZHANG, Debiao HE, Mingwu ZHANG, Kim-Kwang Raymond CHOO. A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm[J]. Front. Comput. Sci., 2020, 14(3): 143803-.
[2]	Wei GAO, Guilin WANG, Kefei CHEN, Xueli WANG. Efficient identity-based threshold decryption scheme from bilinear pairings[J]. Front. Comput. Sci., 2018, 12(1): 177-189.
[3]	Huiyan ZHAO,Jia YU,Shaoxia DUAN,Xiangguo CHENG,Rong HAO. Key-insulated aggregate signature[J]. Front. Comput. Sci., 2014, 8(5): 837-846.
[4]	Wenbo SHI,Neeraj KUMAR,Peng GONG,Zezhong ZHANG. Cryptanalysis and improvement of a certificateless signcryption scheme without bilinear pairing[J]. Front. Comput. Sci., 2014, 8(4): 656-666.
[5]	Lin CHENG, Qiaoyan WEN, Zhengping JIN, Hua ZHANG. Cryptanalysis and improvement of a certificateless encryption scheme in the standard model[J]. Front. Comput. Sci., 2014, 8(1): 163-173.
[6]	Rajeev Anand SAHU, Sahadeo PADHYE. Efficient ID-based proxy multi-signature scheme secure in random oracle[J]. Front Comput Sci, 2012, 6(4): 421-428.
[7]	Boyang WANG, Hui LI, Jin CAO. An efficient MAC scheme for secure network coding with probabilistic detection[J]. Front Comput Sci, 2012, 6(4): 429-441.
[8]	WANG Lingling, ZHANG Guoyin, MA Chunguang. ID-based deniable ring authentication with constant-size signature[J]. Front. Comput. Sci., 2008, 2(1): 106-112.

Viewed

Full text

Abstract

Cited

Shared

Discussed