[1]邓浩明,彭长根,丁红发,等.基于国密 SM9 算法的门限环签名方案[J].计算机技术与发展,2022,32(12):95-102.[doi:10. 3969 / j. issn. 1673-629X. 2022. 12. 015]
　DENG Hao-ming,PENG Chang-gen,DING Hong-fa,et al.A Threshold Ring Signature Scheme Based on GM SM9 Algorithm[J].,2022,32(12):95-102.[doi:10. 3969 / j. issn. 1673-629X. 2022. 12. 015]
点击复制

基于国密 SM9 算法的门限环签名方案()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
32
期数:
2022年12期
页码:
95-102
栏目:
移动与物联网络
出版日期:
2022-12-10

文章信息/Info

Title:
A Threshold Ring Signature Scheme Based on GM SM9 Algorithm
文章编号:
1673-629X(2022)12-0095-08
作者:
邓浩明1; 2 ; 彭长根1; 2; 3 ; 丁红发4 ; 叶延婷1; 2
1. 贵州大学 计算机科学与技术学院,贵州 贵阳 550025;
2. 贵州大学 公共大数据国家重点实验室,贵州 贵阳 550025;
3. 贵州大学 密码学与数据安全研究所,贵州 贵阳 550025;
4. 贵州财经大学 信息学院,贵州 贵阳 550025
Author(s):
DENG Hao-ming1; 2 ; PENG Chang-gen1; 2; 3 ; DING Hong-fa4 ; YE Yan-ting1; 2
1. School of Computer Science and Technology,Guizhou University,Guiyang 550025,China;
2. State Laboratory of Public Big Data,Guizhou University,Guiyang 550025,China;
3. Institute of Cryptography and Data Security,Guizhou University,Guiyang 550025,China;
4. School of Information,Guizhou University of Finance and Economics,Guiyang 550025,China
关键词:
国密算法; 门限环签名; 身份标识密码算法; 不可伪造性; 可证明安全
Keywords:
GM algorithms; threshold ring signature; identity-based cryptography; unforgeability; provably safe
分类号:
TP309
DOI:
10. 3969 / j. issn. 1673-629X. 2022. 12. 015
摘要:
环签名具有隐匿签名成员真实身份的优势,但现有环签名方案仍存在没有很好同时解决效率与安全性等问题。针对此问题,提出一种基于国密 SM9 算法的门限环签名方案( GMTRS) 。 首先,利用强抗碰撞性的 SM3 密码杂凑算法生成长度为 256 bit 的常数项值,利用安全冗余度更高的 SM4 分组密码算法对签名进行加解密处理,并在密文中嵌入具备时效性的时间戳,来提高签名算法的安全性;其次,在基于身份的环签名基础上利用门限参数提取算法引入门限值 t ,使签名过程的效率得到提高,并将无需维护公钥证书和加解密速度快的 SM9 算法与门限环签名相结合,既保留了门限环签名的特性,又提高了签名算法的效率;最后,在随机预言模型下证明了 GMTRS 方案具有适应性选择消息攻击下的不可伪造性。与现有方案相比,该方案具备不可伪造性、匿名性、抗重放攻击性、前向后向安全性等优势。 效率分析表明,GMTRS 方案在签名生成和验证阶段的效率分别提升约 52. 38% 和 32. 16% 。 并且门限值 t 的变化,对方案总体计算开销影响较小。
Abstract:
Ring signature has the advantage of concealing the identity of the signature members in the ring,but the existing ring signatureschemes have some problems 　such as low security and efficiency. To solve this problem,a threshold ring signature scheme based on SM9algorithm is proposed. Firstly,the strong anti-collision SM3 cryptographic hash algorithm is used to generate the constant term value witha length of 256 bit,encrypt the signature with the more secure SM4 algorithm,　and the time stamp with timeliness is embedded in the ci鄄phertext to improve the security of the signature algorithm. Secondly,based on the identity based ring signature,the threshold parameterextraction algorithm is used to introduce the threshold value t , which improves the efficiency of the signature process. The SM9algorithm,which does not need to maintain the public key certificate and has fast encryption and decryption speed,is combined with thethreshold ring signature,which not only retains the characteristics of the threshold ring signature,but also improves the efficiency of thesignature algorithm. Finally,it is proved 　that the proposed scheme has strong unforgeability under the random oracle model. Comparedwith most ring signature schemes,the proposed scheme has the advantages of strong unforgeability,anonymity,anti replay attack,forwardand backward security and so on. Efficiency analysis shows that the efficiency of GMTRS scheme in the signature generation andverification stages is improved by about 52. 38% and 32. 16% respectively. The change of threshold value t has little impact on theoverall computational overhead of the scheme.

相似文献/References:

[1]崔永杰,彭长根,丁红发,等.一种支持多用户的公平密文检索方案[J].计算机技术与发展,2022,32(10):100.[doi:10. 3969 / j. issn. 1673-629X. 2022. 10. 017]
　CUI Yong-jie,PENG Chang-gen,DING Hong-fa,et al.A Fair Searchable Encryption Scheme Supporting Multiple Users[J].,2022,32(12):100.[doi:10. 3969 / j. issn. 1673-629X. 2022. 10. 017]

更新日期/Last Update: 2022-12-10