An Efficient Post-quantum Identity-Based Signature

被引:3
作者
Zhichao, Yang [1 ,4 ]
Duong, Dung H. [2 ]
Susilo, Willy [2 ]
Guomin, Yang [2 ]
Chao, Li [1 ]
Rongmao, Chen [3 ]
机构
[1] Natl Univ Def Technol, Coll Liberal Arts & Sci, Changsha 410000, Peoples R China
[2] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW 2500, Australia
[3] Natl Univ Def Technol, Coll Comp, Changsha 410000, Peoples R China
[4] Naval Univ Engn, Dept Informat Secur, Wuhan 430000, Peoples R China
基金
中国国家自然科学基金;
关键词
Identity‐ based signature; Lattice; Ring‐ learning with errors; Trapdoor; Quantum; LATTICES; SCHEME;
D O I
10.1049/cje.2021.01.006
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:238 / 248
页数:11
相关论文
共 30 条
[1]  
Abdalla M, 2002, LECT NOTES COMPUT SC, V2332, P418
[2]   NEW BOUNDS IN SOME TRANSFERENCE THEOREMS IN THE GEOMETRY OF NUMBERS [J].
BANASZCZYK, W .
MATHEMATISCHE ANNALEN, 1993, 296 (04) :625-635
[3]  
Barreto PSLM, 2005, LECT NOTES COMPUT SC, V3788, P515
[4]   Security Proofs for Identity-Based Identification and Signature Schemes [J].
Bellare, Mihir ;
Namprempre, Chanathip ;
Neven, Gregory .
JOURNAL OF CRYPTOLOGY, 2009, 22 (01) :1-61
[5]  
Cha JC, 2003, LECT NOTES COMPUT SC, V2567, P18
[6]  
Chattopadhyay A., 2020, IMPROVING SPEED DILI
[7]  
Ducas L., 2018, IACR Transactions on Cryptographic Hardware and Embedded Systems, P238, DOI DOI 10.13154/TCHES.V2018.I1.238-268
[8]  
Feige U., 1988, Journal of Cryptology, V1, P77, DOI 10.1007/BF02351717
[9]   HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS [J].
FIAT, A ;
SHAMIR, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 :186-194
[10]   Hierarchical ID-based cryptography [J].
Gentry, C ;
Silverberg, A .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2002, PROCEEDINGS, 2002, 2501 :548-566