摘要
针对签名密钥尺寸过长、基于SIS(Short Integer Solution)身份签名运算复杂度较高、安全性不足的问题,提出了一种基于环上小整数解问题的身份签名方案。首先,利用环上陷门生成算法生成公钥矩阵和陷门矩阵,通过哈希函数将用户身份映射至环元素,并生成短向量私钥。其次,执行双峰高斯采样掩码,再结合消息与承诺值生成挑战,计算响应并进行低位截断压缩,最终输出短签名。最后,验证阶段通过恢复近似响应并检查多项式环运算关系与范数界限,完成签名合法性判定。通过理论分析证明了方案在随机预言机模型下的正确性与强不可伪造性,通过分叉引理,将可能的伪造攻击转化为R-SIS(Ring Short Integer Solution)问题的解,从而论证在多项式时间内无法被有效攻击。实验显示签名生成平均耗时15.8 ms,签名验证时间平均值为10.7 ms,表明方案具有良好的稳定性和高效性。且在时间与存储开销方面,相较于其他方案具备显著优势。
Aiming at the problems of too long signature key size,high computational complexity of SIS(Short Integer Solution)identity signature and insufficient security,an identity signature scheme based on the small integer solution problem on the ring is proposed.Firstly,the trapdoor generation algorithm on the ring is used to generate the public key matrix and the trapdoor matrix,and the user identity is mapped to the ring element through the hash function,and a short vector private key is generated.Secondly,the bimodal Gaussian sampling mask is performed,and the challenge is generated by combining the message and the commitment value,and the response is calculated and low-order truncation compression is performed to finally output the short signature.Finally,the verification stage completes the signature legitimacy judgment by restoring the approximate response and checking the polynomial ring operation relationship and norm limit.The correctness and strong unforgeability of the scheme under the random oracle model are proved by theoretical analysis.Through the bifurcation lemma,the possible forgery attack is converted into the solution of the R-SIS(Ring Short Integer Solution)problem,thus proving that it cannot be effectively attacked in polynomial time.Experiments show that the average signature generation time is 15.8 ms,and the average signature verification time is 10.7 ms,indicating that the scheme has good stability and efficiency.And in terms of time and storage overhead,it has significant advantages over other schemes.
作者
郭冰雨
缪祥华
GUO Bing-yu;MIAO Xiang-hua(School of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China;Yunnan Key Laboratory of Computer Technology Applications,Kunming 650500,China)
出处
《计算机技术与发展》
2026年第2期208-214,共7页
Computer Technology and Development
基金
云南省重大专项计划(202302AD080002)
云南省高层次科技人才及创新团队选拨专项(202405AS350001)。
关键词
身份签名
格
环上小整数解
双峰高斯
截断低位
identity signature
lattice
ring small integer solution
bimodal Gaussians
truncate lows
