Abstract
As a special digital signature, proxy signature is becoming more and more important in electronic authentication. Compared with the insecurity of proxy signatures based on the decomposition of large integers and the difficulty of discrete logarithms, lattice-based cryptography have higher security and computational efficiency. This paper uses the pre-image sampling algorithm and trapdoor generation algorithm to construct a certificateless proxy signature scheme on lattices, and puts the scheme into the background of big data to realize authentication. The safety of the problem is proved by using the difficulty of small integer solutions on the lattices. Compared with other existing proxy signature schemes, it has low computational complexity and higher security.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Riyami, S.S., Paterson, K.G.: International conference on the theory and application of cryptology and information security. Certificateless Cryptogr. J. 2(5), 99–110 (2016)
Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127–144. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054122
Ateniese, G., Hohenberger, S.: Proxy re-signatures: new definitions, algorithms, and applications. In: Proceedings of ACM Conference on Computer and Communications Security, pp. 310–319. ACM (2005). https://doi.org/10.1145/1102120.1102161
Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738–755. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_43
Tian, M.M., Huang, L.S.: Certificateless and certificate-based signatures from lattices. Secur. Commun. Netw. 8(8), 1575–1586 (2015). https://doi.org/10.1002/sec.1105
Tian, M.M.: Identity-based proxy re-signatures from lattices. Inf. Process. Lett. 115(4), 462–467 (2015). https://doi.org/10.1016/j.ipl.2014.12.002
Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267–302 (2007)
Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th ACM Symposium on Theory of Computing (STOC 2008), pp. 197–206. ACM (2008). https://doi.org/10.1145/1374376.1374407
Dent, A.: A survey of certificateless encryption schemes and security models. Int. J. Inf. Secur. 7(5), 347–377 (2008). https://doi.org/10.1007/s10207-008-0055-0
Zhang, F.T., Sun, Y.X., Zhang, L., Geng, M.M., Li, S.J.: Research on certificateless public key cryptography. Comput. Knowl. Technol. (15), 33, 44 (2018)
Chen, D.M.: Discussion on big data security and privacy protection based on cloud computing. Comput. Knowl. Technol. (15), 33, 44 (2018)
Xie, J.: Research on big data security and privacy protection based on cloud computing. Commun. World (02), 112 (2017)
Jiang, M.M., Hu, Y.P., Wang, B.C., et al.: Efficient proxy signature on the lattices. J. Beijing Univ. Posts Telecommun. 37(3), 89–92 (2014)
Chen, H., Hu, Y.P., Lian, Z.Z., et al.: Efficient certificateless encryption schemes from lattices. J. Softw. 27(11), 2884–2897 (2016)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yu, S., Cui, Y., Li, F. (2021). Certificateless Proxy Authentication Scheme on Lattices Under the Background of Big Data. In: Tan, Y., Shi, Y., Zomaya, A., Yan, H., Cai, J. (eds) Data Mining and Big Data. DMBD 2021. Communications in Computer and Information Science, vol 1454. Springer, Singapore. https://doi.org/10.1007/978-981-16-7502-7_21
Download citation
DOI: https://doi.org/10.1007/978-981-16-7502-7_21
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-7501-0
Online ISBN: 978-981-16-7502-7
eBook Packages: Computer ScienceComputer Science (R0)