格上基于身份的可链接环签名方案  

Identity-based linkable ring signature scheme from lattice

作　　者：刘梦情 汪学明[2] Liu Mengqing;Wang Xueming(State Key Laboratory of Public Big Data,Guizhou University,Guiyang 550025,China;College of Computer Science&Technology,Guizhou University,Guiyang 550025,China)

机构地区：[1]贵州大学公共大数据国家重点实验室,贵阳550025 [2]贵州大学计算机科学与技术学院,贵阳550025

出　　处：《计算机应用研究》2022年第10期3130-3135,共6页Application Research of Computers

基　　金：国家自然科学基金资助项目(61163049);贵州省自然科学基金资助项目(黔科合J字(7641))。

摘　　要：为了抵抗量子算法的攻击和应对恶意签名者利用环签名技术的完全匿名性输出多个签名从而进行双重开销攻击这一缺陷,同时为了解决不必要的系统开销浪费问题,提出了一种新的格上基于身份的可链接环签名方案。该方案以格上近似最短向量问题为安全基础,将该问题的求解归约于碰撞问题的求解,利用矩阵向量间的线性运算生成签名,同时结合了基于身份的密码技术。解决了系统开销浪费问题,不涉及陷门生成和高斯采样等复杂算法,提高了签名效率,降低了存储开销,并在随机预言模型下验证了方案满足完全匿名性和强存在不可伪造性。经分析,该方案是一个安全高效的环签名方案。In order to resist the attack of quantum algorithm and deal with the defect that malicious signers can output multiple signatures using the complete anonymity of ring signature technology to carry out double overhead attack,and to solve the unnecessary waste of system overhead,this paper proposed a new identity-based linkable ring signature scheme form lattice.The scheme took the approximate shortest vector problem on the lattice as the security basis,reduced the solution of the problem to the solution of the collision problem,generated the signature by using the linear operation between matrix vectors,and combined the identity-based cryptography technology.It solved the problem of system overhead waste,did not involve complex algorithms such as trapdoor generation and Gaussian sampling,improves the signature efficiency and reduces the storage overhead.It verifies that the scheme meets the requirements of complete anonymity and strong unforgeability under the random oracle model.After analysis,the scheme is a secure and efficient ring signature scheme.

关 键 词：可链接环签名 格 基于身份的密码体制 随机预言模型 

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