首页 | 本学科首页   官方微博 | 高级检索  
     

新的NTRU格上抗量子攻击的群签名方案
引用本文:叶青,杨晓孟,秦攀科,赵宗渠,汤永利.新的NTRU格上抗量子攻击的群签名方案[J].计算机工程与应用,2020,56(2):89-96.
作者姓名:叶青  杨晓孟  秦攀科  赵宗渠  汤永利
作者单位:河南理工大学 计算机科学与技术学院,河南 焦作 454000
基金项目:河南省教育厅项目;国家自然科学基金;河南省科技厅项目;"十三五"国家密码发展基金;河南理工大学博士基金;河南理工大学自然科学基金
摘    要:分析以往基于格的群签名方案,虽能有效抵抗量子攻击,但都存在计算复杂度高、通信代价大和系统公钥尺寸过大的弱点,而NRTU格是一类基于多项式环的特殊格,因只涉及多项式环上的乘法和小整数求模运算,与一般格相比,NTRU格密码体制所需公私钥长度更短,运算速度更快。方案中使用NTRU格上高效的参数生成算法,构建了一个新的基于NTRU格的群签名方案,缩短了系统公钥长度,且系统公钥、追踪密钥和签名密钥之间可并行计算,使得计算效率更高,降低了通信代价。方案安全性归约至判定性LWE问题和近似CVP问题的难解性,并给出方案详细的效率分析。

关 键 词:格密码  NTRU格  群签名  容错学习问题  近似最近向量问题  

Novel Against Quantum Attacks Group Signature Scheme Based on NTRU Lattice
YE Qing,YANG Xiaomeng,QIN Panke,ZHAO Zongqu,TANG Yongli.Novel Against Quantum Attacks Group Signature Scheme Based on NTRU Lattice[J].Computer Engineering and Applications,2020,56(2):89-96.
Authors:YE Qing  YANG Xiaomeng  QIN Panke  ZHAO Zongqu  TANG Yongli
Affiliation:School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan 454000, China
Abstract:The previous lattice-based group signature schemes are analyzed.Though those schemes can effectively resist the quantum attack,they have several weaknesses such as the computation complexity and communication cost are too high,and the group public key size is too large.NTRU lattice is a particular kind of lattice based on polynomial ring,and the schemes based on NTRU lattice require shorter public and private keys and compute faster than the general lattice because they only involve multiplication and small integer modulus calculation in polynomial ring.The proposed scheme gives the first construction of a group signature scheme based on NTRU lattice,using an algorithm which can efficiently generate parameters on NTRU lattice.The scheme shortens the length of group public key,group public key,tracking key and signing key can be calculated in parallel,which make the computation faster and reduce the communication cost.The security of the proposed scheme strictly reduces to the hardness of decisional learning with errors and approximate closest vector problem,and the performance analysis is given in detail.
Keywords:lattice-based cryptography  NTRU lattice  group signature  learning with errors problem  approximate closest vector problem
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号