《计算机应用》唯一官方网站 ›› 2024, Vol. 44 ›› Issue (2): 512-518.DOI: 10.11772/j.issn.1001-9081.2022121876

• 网络空间安全 • 上一篇    

基于SM2门限盲签名电子选举方案

饶金涛1,2(), 崔喆1,2   

  1. 1.中国科学院 成都计算机应用研究所,成都 610213
    2.中国科学院大学,北京 100049
  • 收稿日期:2022-12-21 修回日期:2023-04-24 接受日期:2023-04-25 发布日期:2023-06-05 出版日期:2024-02-10
  • 通讯作者: 饶金涛
  • 作者简介:崔喆(1970—),男,四川成都人,研究员,博士生导师,博士,主要研究方向:可信计算、信息安全。

Electronic voting scheme based on SM2 threshold blind signature

Jintao RAO1,2(), Zhe CUI1,2   

  1. 1.Chengdu Institute of Computer Application,Chinese Academy of Sciences,Chengdu Sichuan 610213,China
    2.University of Chinese Academy of Sciences,Beijing 100049,China
  • Received:2022-12-21 Revised:2023-04-24 Accepted:2023-04-25 Online:2023-06-05 Published:2024-02-10
  • Contact: Jintao RAO
  • About author:CUI Zhe,born in 1970,Ph. D., research fellow. His research interests include trusted computing,information security.
  • Supported by:
    Program of Sichuan Science and Technology Department(2022ZHCG0007)

摘要:

针对提高国产化电子选举系统算法协议层的安全和效率问题,提出一种基于SM2门限盲签名电子选举方案。首先,基于SM2签名算法构造SM2门限盲签名算法,在不改变原有签名流程的前提下,采用Shamir秘密分享、随机秘密分享(RSS)、秘密和差、乘积分享、逆的秘密分享(ISS)等方法分享SM2签名算法中的秘密私钥和随机数,同时引入盲化因子对签名的消息进行盲化,实现签名过程中消息发送方的隐私保护及敏感信息的有效分享;其次,算法安全分析结果表明,在随机预言机模型下,所提的盲签名算法具有盲性、健壮性和不可伪造性,相较于现有的RSA(Rivest-Shamir-Adleman)、椭圆曲线数字签名算法(ECDSA)门限盲签名算法,所提的SM2门限盲签名算法具有计算复杂度低、通信开销较小的优势,适用于大规模选举;最后,基于SM2门限盲签名算法设计安全电子选举协议,分析结果表明,所提协议具有不可伪造性、保密性、合法性和鲁棒性,并且完成一次投票过程仅需15.706 1 ms。

关键词: 电子选举, SM2签名算法, 门限密码学, 不可伪造性, 健壮性

Abstract:

An electronic voting scheme based on SM2 blind threshold signature was proposed to address the security and efficiency issues in the algorithm protocol layer of domestic electronic election system. Firstly,the SM2 threshold blind signature algorithm was constructed based on the SM2 signature algorithm,the methods of Shamir secret sharing, Random Secret Sharing (RSS), secret sum, difference and product sharing, and Inversion Secret Sharing (ISS) were used to share the secret private key and random number in SM2 signature algorithm without changing the original signature process. At the same time,a blinding factor was introduced to blind the message to be signed, achieving the privacy protection of the message sender and effective sharing of sensitive information. Secondly,the algorithm security analysis results show that, the constructed blind signature algorithm has blindness, robustness,and non-forgeability under the random oracle model. Compared with the existing RSA (Rivest-Shamir-Adleman) and Elliptic Curve Digital Signature Algorithm (ECDSA) threshold blind signature algorithms,the constructed SM2 threshold blind signature algorithm has the advantages of low computational complexity and small computational cost, making it suitable for large-scale elections. Finally, a secure electronic voting protocol was designed based on the SM2 threshold blind signature algorithm. The analysis results show that the proposed protocol has properties such as non-forgeability, confidentiality, legality, and robustness. Furthermore, a single voting process can be completed in just 15.706 1 ms.

Key words: electronic voting, SM2 signature algorithm, threshold cryptography, non-forgeability, robustness

中图分类号: