RSA型基于证书签名方案  

An Efficient RSA-based Certificated Signature Scheme

作　　者：郭亚峰[1] 黄慧 陈红英 Guo Yafeng;Huang Hui;Chen Hongying(Department of Electronics and Informatics,Zhangzhou City College,Zhangzhou 363000,China;College of Computer Science,Minnan Normal University,Zhangzhou 363000,China)

机构地区：[1]漳州城市职业学院电子信息工程系,福建漳州363000 [2]闽南师范大学计算机学院,福建漳州363000

出　　处：《宁夏大学学报（自然科学版）》2023年第1期61-67,共7页Journal of Ningxia University(Natural Science Edition)

基　　金：福建省自然科学基金资助项目(2019J01750,2019J01752);漳州市自然科学基金资助项目(ZZ2019J27,ZZ2021J48);2020年福建省中青年教师教育科研项目(科技类)(JAT201387,JAT201384)。

摘　　要：为了提高基于证书签名方案的效率,利用RSA困难问题构造一个新的可证明安全的基于证书签名方案.方案使用RSA签名算法为用户生成证书,用户的私钥与该证书一起组成用户的签名密钥.在RSA困难假设下,所提出的方案能够抵抗恶意权威机构和非认证用户的攻击.所提出方案的所有算法都只需要计算开销较小的模乘和模幂指数运算法,不需要计算开销较大的双线性对运算.实验模拟结果显示,方案证书生成仅需0.023 s,签名生成仅需0.051 s,签名验证仅需0.029 s.与已有的方案比较表明,所提出的方案具有明显的效率优势.In order to improve the efficiency of certificate-based signature schemes,a new provably secure certificate-based signature scheme is constructed by using the RSA difficult problem.The scheme uses the RSA signature algorithm to generate a certificate for the user,and the user’s private key and the certificate together form the user’s signature key.Under the assumption of RSA difficulty,the proposed scheme can resist attacks from malicious authorities and unauthenticated users.All the algorithms of the proposed scheme only need modular multiplication and modular exponentiation algorithms with low computational overhead,and do not need bi-linear pairing operations with high computational overhead.Simulation results show that the scheme takes 0.023 seconds for certificate generation,0.051 seconds for signature generation and 0.029 seconds for signature verification.Compared with the existing schemes,the proposed scheme has obvious efficiency advantages.

关 键 词：数字签名 基于证书签名 可证明安全 RSA困难假设 随机预言机模型 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]