Open AccessAn Efficient Post‐quantum Identity‐Based Signature
Author(s) -
Zhichao Yang,
Duong Dung H.,
Susilo Willy,
Guomin Yang,
Chao Li,
Rongmao Chen
Publication year - 2021
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2021.01.006
Subject(s) - ring signature , random oracle , computer science , digital signature , cryptography , schnorr signature , merkle signature scheme , theoretical computer science , learning with errors , lattice based cryptography , quantum computer , cryptanalysis , authentication (law) , quantum cryptography , quantum , blind signature , computer security , encryption , public key cryptography , hash function , quantum information , quantum mechanics , physics
Digital signature is one of the most important cryptography primitives. Recently, more and more works have been done to construct signatures over lattice problems to keep them secure in the quantum age. Among them, a ring‐based signature scheme named Dilithium is the most efficient one and a candidate in the third round of the National Institute of Standards and Technology's post‐quantum cryptography project. To make those schemes work well in large network, we constructed the first ring‐based Identity‐based signature (IBS) scheme for light‐weight authentication. The construction in this paper relies on the transformations introduced by Bellare et al. in Journal of Cryptology (Vol.22, No.1, pp.1–61, 2009) and its security can be proved under the hardness of ring‐learning with errors problem in the random oracle model. Due to better trapdoor and polynomial ring setting, our proposed scheme are much better than the previous ones in terms of both computation and communication complexities.