An efficient identity-based signature scheme with provable security

被引：16

作者：

Yi, Peng ^{[1
]}

Li, Jiguo ^{[1
,2
,3
]}

Liu, Chengdong ^{[4
]}

Han, Jinguang ^{[5
]}

Wang, Huaqun ^{[6
]}

Zhang, Yichen ^{[1
]}

Chen, Yu ^{[1
]}

机构：

[1] Fujian Normal Univ, Coll Comp & Cyber Secur, Fuzhou 350117, Fujian, Peoples R China

[2] Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou 350117, Fujian, Peoples R China

[3] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China

[4] Beijing Applicat Inst Informat Technol BAIIT, Beijing 100091, Peoples R China

[5] Nanjing Univ Finance & Econ, Jiangsu Prov Key Lab Business, Nanjing 210003, Jiangsu, Peoples R China

[6] Nanjing Univ Posts & Telecommun, Coll Comp, Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing 210003, Peoples R China

来源：

INFORMATION SCIENCES | 2021年 / 576卷

基金：

中国国家自然科学基金;

关键词：

Identity-based signature; Bilinear map; Standard model; CDH-problem; ATTRIBUTE-BASED ENCRYPTION; BROADCAST ENCRYPTION;

D O I：

10.1016/j.ins.2021.08.053

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Many identity-based digital signature schemes are proved secure in the random oracle model. However, the application of the random oracle may lead to security risks. The used hash function is specific and the response result of the query is not always random, hence it may cause the insecurity of the scheme. To solve the above issues, this paper presents an efficient identity-based signature scheme which is proved secure under the standard model. The security of the proposed scheme is reduced to the well-known computational Diffie-Hellman (CDH) assumption. Furthermore, compared with the related identity-based signature schemes, the scheme proposed in this paper has great advantages in the compu-tation cost of signing and verification. (c) 2021 Elsevier Inc. All rights reserved.

引用

页码：790 / 799

页数：10

共 41 条

[1]

Bellare M., 1993, P ACM CCS, V1993, P62, DOI DOI 10.1145/168588.168596

[2] Identity-based encryption from the Weil pairing [J].

Boneh, D ;

Franklin, M .

SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615

[3] Secure network coding from secure proof of retrievability [J].

Chang, Jinyong ;

Shao, Bilin ;

Ji, Yanyan ;

Xu, Maozhi ;

Xue, Rui .

SCIENCE CHINA-INFORMATION SCIENCES, 2021, 64 (12)

[4] RKA Security for Identity-Based Signature Scheme [J].

Chang, Jinyong ;

Wang, Huiqun ;

Wang, Fei ;

Zhang, Anling ;

Ji, Yanyan .

IEEE ACCESS, 2020, 8 :17833-17841

[5] Identity-Based Signature Schemes for Multivariate Public Key Cryptosystems [J].

Chen, Jiahui ;

Ling, Jie ;

Ning, Jianting ;

Ding, Jintai .

COMPUTER JOURNAL, 2019, 62 (08) :1132-1147

[6] Adaptively secure certificate-based broadcast encryption and its application to cloud storage service [J].

Chen, Liqing ;

Li, Jiguo ;

Lu, Yang ;

Zhang, Yichen .

INFORMATION SCIENCES, 2020, 538 :273-289

[7] Efficient CP-ABE Scheme With Shared Decryption in Cloud Storage [J].

Chen, Ningyu ;

Li, Jiguo ;

Zhang, Yichen ;

Guo, Yuyan .

IEEE TRANSACTIONS ON COMPUTERS, 2022, 71 (01) :175-184

[8] Efficient Attribute Based Server-Aided Verification Signature [J].

Chen, Yu ;

Li, Jiguo ;

Liu, Chengdong ;

Han, Jinguang ;

Zhang, Yichen ;

Yi, Peng .

IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (06) :3224-3232

[9]

Coron JS, 2005, LECT NOTES COMPUT SC, V3621, P430

[10]

Cramer R, 1998, LECT NOTES COMPUT SC, V1462, P13, DOI 10.1007/BFb0055717

← 1 2 3 4 5 →