Similar articles

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.

格上高效的身份基签名

[1]Al Sharif S, Al Ali M, Al Reqabi N, et al., 2016. Magec: an image searching tool for detecting forged images in forensic investigation. 8^th IFIP Int Conf on New Technologies, Mobility and Security, p.1-6.

[2]Al-Sharif S, Iqbal F, Baker T, et al., 2016. White-hat hacking framework for promoting security awareness. 8^th IFIP Int Conf on New Technologies, Mobility and Security, p.1-6.

[3]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.

[4]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.

[5]Choon JC, Cheon JH, 2002. An identity-based signature from gap Diffie-Hellman groups. Int Workshop on Public Key Cryptography, p.18-30.

[6]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.

[7]Gao W, Hu YP, Wang BC, et al., 2017a. Identity-based blind signature from lattices. Wuhan Univ J Nat Sci, 22(4):355-360.

[8]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.

[9]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.

[10]Hamdi D, Iqbal F, Baker T, et al., 2016. Multimedia file signature analysis for smartphone forensics. 9^th Int Conf on Developments in eSystems Engineering, p.130-137.

[11]Hess F, 2003. Efficient identity based signature schemes based on pairings. Int Workshop on Selected Areas in Cryptography, p.310-324.

[12]Iqbal F, Yankson B, AlYammahi MA, et al., 2019. Drone forensics: examination and analysis. Int J Electron Secur Dig Forens, 11(3):245-264.

[13]Karam Y, Baker T, Taleb-Bendiab A, 2012. Security support for intention driven elastic cloud computing. 6^th UKSim/AMSS European Symp on Computer Modeling and Simulation, p.67-73.

[14]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.

[15]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.

[16]Lyubashevsky V, Micciancio D, 2006. Generalized compact knapsacks are collision resistant. Int Colloquium on Automata, Languages, and Programming, p.144-155.

[17]Micciancio D, 2007. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput Compl, 16(4):365-411.

[18]Paterson KG, Schuldt JCN, 2006. Efficient identity-based signatures secure in the standard model. Australasian Conf on Information Security and Privacy, p.207-222.

[19]Pointcheval D, Stern J, 2000. Security arguments for digital signatures and blind signatures. J Cryptol, 13(3):361-396.

[20]Rückert M, 2010. Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. Proc 3^rd Int Workshop on Post-Quantum Cryptography, p.182-200.

[21]Shamir A, 1985. Identity-based cryptosystems and signature schemes. Proc Advances in Cryptology, p.47-53.

[22]Tian MM, Huang LS, 2014. Efficient identity-based signature from lattices. 29^th ICT Systems Security and Privacy Protection, p.321-329.

[23]Tian MM, Huang LS, Yang W, 2013. Efficient hierarchical identity-based signatures from lattices. Int J Electron Secur Dig Forens, 5(1):1-10.

[24]Wei BD, Du YS, Zhang H, et al., 2014. Identity based threshold ring signature from lattices. 8^th Int Conf on Network and System Security, p.233-245.

[25]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.

[26]Zhang YH, Gan Y, Yin YF, et al., 2018a. Efficient lattice FIBS for identities in a small universe. 1^st Int Conf on Frontiers in Cyber Security, p.83-95.

[27]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.

[28]Zhao GM, Tian MM, 2018. A simpler construction of identity-based ring signatures from lattices. 12^th Int Conf on Provable Security, p.277-291.