Novel efficient identity-based signature on lattices

• Published in: Frontiers of information technology & electronic engineering Vol. 22; no. 2; pp. 244 - 250
• Main Authors: Chen, Jiang-shan, Hu, Yu-pu, Liang, Hong-mei, Gao, Wen
• Format: Journal Article
• Language: English
• Published: Hangzhou Zhejiang University Press 01.02.2021; Springer Nature B.V; School of Mathematics and Statistics,Minnan Normal University,Zhangzhou 363000,China%State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an 710071,China%School of Mathematics and Statistics,Minnan Normal University,Zhangzhou 363000,China%School of Cyberspace Security,Xi'an University of Posts & Telecommunications,Xi'an 710061,China; State Key Laboratory of Integrated Services Networks,Xidian University,Xi'an 710071,China
• Subjects: Communications Engineering; Computer Hardware; Computer Science; Computer systems; Computer Systems Organization and Communication Networks; Cryptography; Digital signatures; Electrical Engineering; Electronics and Microelectronics; Instrumentation; Lattices; Networks; Quantum computers; Quantum cryptography; Sampling; Security; 身份基签名; TN918.4; Identity-based signature; Random oracle model; 强不可伪造性; Strong unforgeability; 格; 随机谕言机模型; Lattice
• ISSN: 2095-9184; 2095-9230
• DOI: 10.1631/FITEE.1900318

With the rapid development of electronic information technology, digital signature has become an indispensable part of our lives. Traditional public key certificate cryptosystems cannot overcome the limitations of certificate management. Identity-based cryptosystems can avoid the certificate management issues. The development of quantum computers has brought serious challenges to traditional cryptography. Post-quantum cryptography research is imperative. At present, almost all post-quantum identity-based signature (IBS) schemes are constructed using Gaussian sampling or trapdoor technologies. However, these two technologies have a great impact on computational efficiency. To overcome this problem, we construct an IBS scheme on lattices by employing Lyubashevsky’s signature scheme. Based on the shortest vector problem on lattices, our scheme does not use Gaussian sampling or trapdoor technologies. In the random oracle model, it is proved that our scheme is strongly unforgeable against adaptive chosen messages and identity attacks. The security level of our scheme is strongly unforgeable, which is a higher level than the existential unforgeability of other schemes. Compared with other efficient schemes, our scheme has advantages in computation complexity and security.