Abstract
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.
摘要
随着电子信息技术的飞速发展, 数字签名已成为人们生活中不可或缺的一部分. 由于证书管理的局限性, 传统的公钥证书密码系统无法满足现有需求. 基于身份的密码系统避免了证书管理问题. 量子计算机的发展给传统密码学带来严峻挑战. 后量子密码学研究势在必行. 目前, 几乎所有后量子基于身份的签名方案都是利用高斯采样技术或陷门技术构建的. 但是, 这两种技术对计算效率有很大影响. 为克服该问题, 采用Lyubashevsky签名方案构造了格上基于身份的签名方案. 基于格上的最短向量问题, 该方案既不使用高斯采样技术也不使用陷门技术. 在随机谕言机模型中, 可以证明该方案对适应性选择的消息和身份攻击是不可伪造的. 其安全性级别是强不可伪造的, 比其他方案存在性不可伪造的安全性更高. 与其他有效方案相比, 所提方案在计算复杂度和安全性方面具有优势.
Similar content being viewed by others
References
Al Sharif S, Al Ali M, Al Reqabi N, et al., 2016. Magec: an image searching tool for detecting forged images in forensic investigation. 8th IFIP Int Conf on New Technologies, Mobility and Security, p. 1–6. https://doi.org/10.1109/NTMS.2016.7792460
Al-Sharif S, Iqbal F, Baker T, et al., 2016. White-hat hacking framework for promoting security awareness. 8th IFIP Int Conf on New Technologies, Mobility and Security, p. 1–6. https://doi.org/10.1109/NTMS.2016.7792489
Baker T, Asim M, MacDermott Á, et al., 2019. A secure fog-based platform for SCADA-based IoT critical infrastructure. Softw Pract Exp, 50:503–518. https://doi.org/10.1002/spe.2688
Barreto PSLM, Libert B, McCullagh N, et al., 2005. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. Int Conf on Theory and Application of Cryptology and Information Security, p. 515–532. https://doi.org/10.1007/11593447_28
Choon JC, Cheon JH, 2002. An identity-based signature from gap Diffie-Hellman groups. Int Workshop on Public Key Cryptography, p. 18–30. https://doi.org/10.1007/3-540-36288-6_2
Fiat A, Shamir A, 1987. How to prove yourself: practical solutions to identification and signature problems. Conf on the Theory and Application of Cryptographic Techniques, p. 186–194. https://doi.org/10.1007/3-540-47721-7_12
Gao W, Hu YP, Wang BC, et al., 2017a. Identity-based blind signature from lattices. Wuhan Univ J Nat Sci, 22(4):355–360. https://doi.org/10.1007/s11859-017-1258-x
Gao W, Hu YP, Wang BC, et al., 2017b. Identity-based blind signature from lattices in standard model. Int Conf on Information Security and Cryptology, p. 205–218. https://doi.org/10.1007/978-3-319-54705-3_13
Gu CX, Chen L, Zheng YH, 2012. ID-based signatures from lattices in the random oracle model. Int Conf on Web Information Systems and Mining, p. 222–230. https://doi.org/10.1007/978-3-642-33469-6_31
Hamdi D, Iqbal F, Baker T, et al., 2016. Multimedia file signature analysis for smartphone forensics. 9th Int Conf on Developments in eSystems Engineering, p. 130–137. https://doi.org/10.1109/DeSE.2016.22
Hess F, 2003. Efficient identity based signature schemes based on pairings. Int Workshop on Selected Areas in Cryptography, p. 310–324. https://doi.org/10.1007/3-540-36492-7_20
Iqbal F, Yankson B, AlYammahi MA, et al., 2019. Drone forensics: examination and analysis. Int J Electron Secur Dig Forens, 11(3):245–264. https://doi.org/10.1504/IJESDF.2019.10020543
Karam Y, Baker T, Taleb-Bendiab A, 2012. Security support for intention driven elastic cloud computing. 6th UKSim/AMSS European Symp on Computer Modeling and Simulation, p. 67–73. https://doi.org/10.1109/EMS.2012.17
Liu ZH, Hu YP, Zhang XS, et al., 2013. Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model. Secur Commun Netw, 6(1):69–77. https://doi.org/10.1002/sec.531
Lyubashevsky V, 2009. Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. Int Conf on the Theory and Application of Cryptology and Information Security, p. 598–616. https://doi.org/10.1007/978-3-642-10366-7_35
Lyubashevsky V, Micciancio D, 2006. Generalized compact knapsacks are collision resistant. Int Colloquium on Automata, Languages, and Programming, p. 144–155. https://doi.org/10.1007/11787006_13
Micciancio D, 2007. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput Compl, 16(4):365–411. https://doi.org/10.1007/s00037-007-0234-9
Paterson KG, Schuldt JCN, 2006. Efficient identity-based signatures secure in the standard model. Australasian Conf on Information Security and Privacy, p. 207–222. https://doi.org/10.1007/11780656_18
Pointcheval D, Stern J, 2000. Security arguments for digital signatures and blind signatures. J Cryptol, 13(3):361–396. https://doi.org/10.1007/s001450010003
Rückert M, 2010. Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. Proc 3rd Int Workshop on Post-Quantum Cryptography, p. 182–200. https://doi.org/10.1007/978-3-642-12929-2_14
Shamir A, 1985. Identity-based cryptosystems and signature schemes. Proc Advances in Cryptology, p. 47–53. https://doi.org/10.1007/3-540-39568-7_5
Tian MM, Huang LS, 2014. Efficient identity-based signature from lattices. 29th ICT Systems Security and Privacy Protection, p. 321–329. https://doi.org/10.1007/978-3-642-55415-5_26
Tian MM, Huang LS, Yang W, 2013. Efficient hierarchical identity-based signatures from lattices. Int J Electron Secur Dig Forens, 5(1):1–10. https://doi.org/10.1504/IJESDF.2013.054403
Wei BD, Du YS, Zhang H, et al., 2014. Identity based threshold ring signature from lattices. 8th Int Conf on Network and System Security, p. 233–245. https://doi.org/10.1007/978-3-319-11698-3_18
Xie J, Hu YP, Gao JT, et al., 2016. Efficient identity-based signature over NTRU lattice. Front Inform Technol Electron Eng, 17(2):135–142. https://doi.org/10.1631/FITEE.1500197
Zhang YH, Gan Y, Yin YF, et al., 2018a. Efficient lattice FIBS for identities in a small universe. 1st Int Conf on Frontiers in Cyber Security, p. 83–95. https://doi.org/10.1007/978-981-13-3095-7_7
Zhang YH, Gan Y, Yin YF, et al., 2018b. Fuzzy identity-based signature from lattices for identities in a large universe. Int Conf on Cloud Computing and Security, p. 573–584.
Zhao GM, Tian MM, 2018. A simpler construction of identity-based ring signatures from lattices. 12th Int Conf on Provable Security, p. 277–291. https://doi.org/10.1007/978-3-030-01446-9_16
Author information
Authors and Affiliations
Contributions
Jiang-shan CHEN designed the research. Jiang-shan CHEN and Hong-mei LIANG processed the data. Jiang-shan CHEN drafted the manuscript. Wen GAO helped organize the manuscript. Jiang-shan CHEN and Yu-pu HU revised and finalized the paper.
Corresponding author
Ethics declarations
Jiang-shan CHEN, Yu-pu HU, Hong-mei LIANG, and Wen GAO declare that they have no conflict of interest.
Additional information
Project supported by the National Natural Science Foundation of China (Nos. 61672412 and 61972457), the National Cryptography Development Fund of China (No. MMJJ20170104), and the Young and Middle-Aged Teacher Education Research Project of Fujian Province, China (Nos. JT180308 and JAT190372)
Rights and permissions
About this article
Cite this article
Chen, Js., Hu, Yp., Liang, Hm. et al. Novel efficient identity-based signature on lattices. Front Inform Technol Electron Eng 22, 244–250 (2021). https://doi.org/10.1631/FITEE.1900318
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/FITEE.1900318