Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan's Scheme from Wireless Personal Communications (2018)

被引:22
作者
Rastegari, Parvin [1 ]
Susilo, Willy [2 ]
Dakhlalian, Mohammad [1 ]
机构
[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan 8415683111, Iran
[2] Univ Wollongong, Inst Cybersecur & Cryptol, Sch Comp & Informat Technol, Wollongong, NSW 2522, Australia
关键词
certificateless public key cryptography; signcryption; ROM; standard model; KSSTIS; IDENTITY-BASED ENCRYPTION; SIGNATURE SCHEME; SECURITY;
D O I
10.1093/comjnl/bxz041
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Certificateless public key cryptography (CL-PKC) promises a practical resolution in establishing practical schemes, since it addresses two fundamental issues, namely the necessity of requiring certificate managements in traditional public key infrastructure (PKI) and the key escrow problem in identity-based (ID-based) setting concurrently. Signcryption is an important primitive that provides the goals of both encryption and signature schemes as it is more efficient than encrypting and signing messages consecutively. Since the concept of certificateless signcryption (CL-SC) scheme was put forth by Barbosa and Farshim in 2008, many schemes have been proposed where most of them are provable in the random oracle model (ROM) and only a few number of them are provable in the standard model. Very recently, Luo and Wan (Wireless Personal Communication, 2018) proposed a very efficient CL-SC scheme in the standard model. Furthermore, they claimed that their scheme is not only more efficient than the previously proposed schemes in the standard model, but also it is the only scheme which benefits from known session-specific temporary information security (KSSTIS). Therefore, this scheme would indeed be very practical. The contributions of this paper are 2-fold. First, in contrast to the claim made by Luo and Wan, we show that unfortunately Luo and Wan made a significant error in the construction of their proposed scheme. While their main intention is indeed interesting and useful, the failure of their construction has indeed left a gap in the research literature. Hence, the second contribution of this paper is to fill this gap by proposing a CL-SC scheme with KSSTIS, which is provably secure in the standard model.
引用
收藏
页码:1178 / 1193
页数:16
相关论文
共 27 条
[1]  
Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452
[2]  
[Anonymous], CASE STUDIES SECURE
[3]  
Barbosa M., 2008, P 2008 ACM S INFORM, P369
[4]  
Bellare M., 1993, P ACM CCS, P62, DOI DOI 10.1145/168588.168596
[5]   Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting [J].
Benhamouda, Fabrice ;
Couteau, Geoffroy ;
Pointcheval, David ;
Wee, Hoeteck .
ADVANCES IN CRYPTOLOGY, PT II, 2015, 9216 :107-129
[6]   The random oracle methodology, revisited [J].
Canetti, R ;
Goldreich, O ;
Halevi, S .
JOURNAL OF THE ACM, 2004, 51 (04) :557-594
[7]   Efficient generic on-line/off-line (threshold) signatures without key exposure [J].
Chen, Xiaofeng ;
Zhang, Fangguo ;
Tian, Haibo ;
Wei, Baodian ;
Susilo, Willy ;
Mu, Yi ;
Lee, Hyunrok ;
Kim, Kwangjo .
INFORMATION SCIENCES, 2008, 178 (21) :4192-4203
[8]   Identity-based chameleon hashing and signatures without key exposure [J].
Chen, Xiaofeng ;
Zhang, Fangguo ;
Susilo, Willy ;
Tian, Haibo ;
Li, Jin ;
Kim, Kwangjo .
INFORMATION SCIENCES, 2014, 265 :198-210
[9]  
Cheng L., 2015, Int. J. Netw. Security, V17, P597
[10]  
Gentry C, 2009, LECT NOTES COMPUT SC, V5444, P437