A New Design of Online/Offline Signatures Based on Lattice
With the rapid development of mobile internet, a large number of lightweight devices are widely used. Therefore, lightweight cryptographic primitives are urgently demanded. Among these primitives, online/offline signatures are one of the most promising one. Motivated by this situation, we propose a lattice-based online/offline signature scheme by using the hash-sign-switch paradigm, which was introduced by Shamir and Tauman in 2001. Our scheme not only has the advantages of online/offline signatures, but also can resist quantum computer attacks. The scheme we propose is built on several techniques, such as cover-free sets and programmable hash functions. Furthermore, we design a specific chameleon hash function, which plays an important role in the hash-sign-switch paradigm. Under the Inhomogeneous Small Integer Solution (ISIS) assumption, we prove that our proposed chameleon hash function is collision-resistant, which makes a direct application of this new design. In particular, our method satisfies existential unforgeability against adaptive chosen message attacks in the standard model.
KeywordsOnline/offline signature Lattice Chameleon hash function The Inhomogeneous Small Integer Solution (ISIS) assumption
The authors would like to thank anonymous reviewers for their helpful comments. This work is supported by National Natural Science Foundation of China (61472083, 61771140, 11701089, 61472364), Distinguished Young Scholars Fund of Fujian (2016J06013), Fujian Normal University Innovative Research Team (NO. IRTL1207), Fujian Province Department of Education Project (JOPX 15066), and Zhejiang Provincial Natural Science Foundation (NO. LZ18F020003).
- 1.Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22–24 May 1996, pp. 99–108 (1996). https://doi.org/10.1145/237814.237838
- 5.Deiseroth, B., Fehr, V., Fischlin, M., Maasz, M., Reimers, N.F., Stein, R.: Computing on authenticated data for adjustable predicates. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 53–68. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38980-1_4CrossRefGoogle Scholar
- 9.Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17–20 May 2008, pp. 197–206 (2008). https://doi.org/10.1145/1374376.1374407
- 12.Krawczyk, H., Rabin, T.: Chameleon hashing and signatures. IACR Cryptology ePrint Archive 1998/10 (1998). http://eprint.iacr.org/1998/010
- 17.Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. CoRR abs/1011.3027 (2010). http://arxiv.org/abs/1011.3027
- 18.Xiang, X.Y.: Online/offline signature scheme based on ideal lattices (in Chinese). J. Cryptologic Res. 4(3), 253–261 (2017)Google Scholar
- 19.Xiang, X.Y., Li, H.: Lattice-based online/offline signature scheme (in Chinese). J. Beijing Univ. Posts Telecommun. 38(3), 117–120, 134 (2015)Google Scholar