中国邮电高校学报(英文) ›› 2016, Vol. 23 ›› Issue (3): 11-17.doi: 10.1016/S1005-8885(16)60027-4

• Artificial Intelligence • 上一篇    下一篇

Improved lattice-based ring signature schemes from basis delegation

高雯1,胡予濮2,王保仓3,谢佳1   

  1. 1. 西安电子科技大学
    2. 西安电子科技大学 计算机网络与信息安全教育部重点实验室
    3. Xidian University
  • 收稿日期:2015-12-14 修回日期:2016-03-17 出版日期:2016-06-28 发布日期:2016-07-05
  • 通讯作者: 高雯 E-mail:gaowen0807@Outlook.com

Improved lattice-based ring signature schemes from basis delegation

  • Received:2015-12-14 Revised:2016-03-17 Online:2016-06-28 Published:2016-07-05

摘要:

Ring signature enables the members to sign anonymously without a manager, it has many online applications, such as e-voting, e-money, whistle blowing etc. As a promising post-quantum candidate, lattice-based cryptography attracts much attention recently. Several efficient lattice-based ring signatures have been naturally constructed from lattice basis delegation, but all of them have large verification key sizes. Our observation finds that a new concept called the split-SIS problem introduced by Nguyen et al. at PKC’15 is excellent in reducing the public key sizes of lattice-based ring signature schemes from basis delegation. In this research, we first define an extended concept called the extended split-SIS problem, and then prove that the hardness of the extended problem is as hard as the approximating SIVP problem within certain polynomial factor. Moreover, we present an improved ring signature and prove that it is anonymous and unforgeable against the insider corruption. Finally, we give two other improved existing ring signature schemes from lattices. In the end, we show the comparison with the original scheme in terms of the verification key sizes. Our research data illustrate that the public key sizes of the proposed schemes are reduced significantly.

关键词:

lattice-based, ring signature scheme, anonymous, unforgeable

Abstract: Ring signature enables the members to sign anonymously without a manager, it has many online applications, such as e-voting, e-money, whistle blowing etc. As a promising post-quantum candidate, lattice-based cryptography attracts much attention recently. Several efficient lattice-based ring signatures have been naturally constructed from lattice basis delegation, but all of them have large verification key sizes. Our observation finds that a new concept called the split- small integer solution (SIS) problem introduced by Nguyen et al. at PKC’15 is excellent in reducing the public key sizes of lattice-based ring signature schemes from basis delegation. In this research, we first define an extended concept called the extended split-SIS problem, and then prove that the hardness of the extended problem is as hard as the approximating shortest independent vectors problem (SIVP) problem within certain polynomial factor. Moreover, we present an improved ring signature and prove that it is anonymous and unforgeable against the insider corruption. Finally, we give two other improved existing ring signature schemes from lattices. In the end, we show the comparison with the original scheme in terms of the verification key sizes. Our research data illustrate that the public key sizes of the proposed schemes are reduced significantly.

Key words: