Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (18): 103-108.

Previous Articles     Next Articles

Improved algorithm research for lattice-based verifier ring signature

ZHAO Hongjian1, DA Hanqiao2, HU Yuanming3   

  1. 1.Department of Logistics, Wuhan University, Wuhan 430072, China
    2.State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430072, China
    3.School of Mathematics and Statistics, Wuhan University, Wuhan 430072, China
  • Online:2014-09-15 Published:2014-09-12

基于Lattice的验证方环签名改进算法研究

赵洪建1,达汉桥2,胡元明3   

  1. 1.武汉大学 后勤服务集团,武汉 430072
    2.武汉大学 测绘遥感信息工程国家重点实验室,武汉 430072
    3.武汉大学 数学与统计学院,武汉 430072

Abstract: In order to solve various privacy problems about existing signature schemes, such as issuing software license, issuing patent license and public bidding, in this paper, the random oracle model is the basis theory, and it designs a lattice-based strong constraint verifier ring signature improved algorithm(L_SRS). This algorithm provides detailed security analysis, and it adds a strong constraint security mechanism based on SIS. L_SRS algorithm can efficiently resist adaptive chosen message attack with strong unforgeability. The performance analysis shows L_SRS algorithm has characteristics of shorter signature length, high efficiency and stronger security.

Key words: strong constraint, small integer solution, Lattice-based Strong constraint verifier Ring Signature(L-SRS), ring signature, strong unforgeability

摘要: 为了解决现有的数字签名机制在发放软件著作、专利许可证以及项目工程招投标等应用中出现的各种隐私安全问题,以随机预言模型下的相关签名方案为理论基础,提出了一种基于格结构(Lattice)的强约束验证方环签名改进算法,即L_SRS算法。该算法在标准模型下给出了详实的安全性分析,依据标准的小整数解困难问题,L_SRS算法增加了一种强约束安全机制,能够有效抵抗适应性选择消息攻击,对其具有强不可伪造性。通过安全性与性能分析,L_SRS算法具有应用高安全性、签名计算高效率性等特点。

关键词: 强约束, 小整数解困难问题, 基于格结构(Lattice)的强约束验证方环签名(L_SRS), 环签名, 强不可伪造性