咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Improved lattice-based ring si... 收藏

Improved lattice-based ring signature schemes from basis delegation

Improved lattice-based ring signature schemes from basis delegation

作     者:Gao Wen Hu Yupu Wang Baocang Xie Jia 

作者机构:State Key Laboratory of Integrated Service Networks Xidian University 

出 版 物:《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报(英文版))

年 卷 期:2016年第23卷第3期

页      面:11-17,28页

核心收录:

学科分类:08[工学] 0835[工学-软件工程] 

基  金:supported by the National Natural Science Foundations of China (61472309, 61572390, 61303198, 61402353) the 111 Project (B08038) National Natural Science Foundations of Ningbo (201601HJ-B01382) Research Program of Anhui Education Committee (KJ2016A626, KJ2016A627) 

主  题:lattice-based ring signature scheme anonymous unforgeable 

摘      要: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'I 5 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.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分