Identity-based strong designate verifier signature over lattices

作     者：WANG Feng-he HU Yu-pu WANG Chun-xiao 

作者机构：Department of the Mathematics and Physics Shandong Jianzhu University State Key Laboratory of Integrate Services Networks Xidian University 

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

年 卷 期：2014年第21卷第6期

页      面：52-60页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 0839[工学-网络空间安全] 08[工学] 110505[军事学-密码学] 110503[军事学-军事通信学] 

基　　金：supported by the National Natural Science Foundation of China (61303198) Natural Science Foundation of Shandong Province (ZR2013FQ031) supported by the Doctor Foundation of Shandong Jianzhu University 

主　　题：SDVS lattice-based cryptography id-based cryptography Gaussian sample SIS problem LWE problem 

摘      要：The notion of the identity-based（id-based） strong designate verifier signature（SDVS） was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors（LWE） problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution（SIS） problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than（3m＋n） lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature（SDVRS） scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.