通信学报2025，Vol.46Issue(11)：104-113,10.DOI:10.11959/j.issn.1000-436x.2025217
基于SM9的环签名:常数级计算开销的方案构造
SM9-based ring signature:a scheme with constant-time computational overhead
摘要
Abstract
To address the performance bottleneck of existing identity-based ring signature schemes,an efficient scheme based on the Chinese national cryptographic standard SM9 was proposed.By optimizing the group operation structure,the computational overhead of signing and verification was reduced from linear to constant time,leading to a substantial improvement in performance.In contrast to existing schemes requiring computationally intensive operations(e.g.,bilin-ear pairings or scalar multiplications)per ring member,the proposed scheme shifted member-related calculations to light-weight finite field operations,thus maintaining a fixed count of computationally intensive operations regardless of ring size.Under the random oracle model,the scheme was demonstrated to achieve existential unforgeability and full ano-nymity.Experimental evaluations indicate that for a ring size of 1 024,signing and verification times are 37.06 ms and 48.59 ms respectively,representing performance gains of 241.61×and 10.11×over current state-of-the-art alternatives.The overall efficiency retains a significant advantage even when considering linear communication overhead.关键词
环签名/SM9算法/基于标识的密码/常数级开销/国密算法Key words
ring signature/SM9 algorithm/identity-based cryptography/constant-time overhead/domestic cryptographic algorithm分类
信息技术与安全科学引用本文复制引用
谢振杰,刘胜利,贾志鹏,翟锦源,刘成..基于SM9的环签名:常数级计算开销的方案构造[J].通信学报,2025,46(11):104-113,10.基金项目
装备预先研究基金资助项目(No.30603010601)Equipment Pre Research Project(No.30603010601) （No.30603010601）
