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.

[1]  Amit Sahai,et al.  Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.

[2]  David A. Wagner,et al.  Generic On-Line/Off-Line Threshold Signatures , 2006, Public Key Cryptography.

[3]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[4]  Xavier Boyen,et al.  Lattice Mixing and Vanishing Trapdoors A Framework for Fully Secure Short Signatures and more , 2010 .

[5]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[6]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[7]  Miklós Ajtai,et al.  Generating Hard Instances of the Short Basis Problem , 1999, ICALP.

[8]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[9]  Silvio Micali,et al.  On-line/off-line digital signatures , 1996, Journal of Cryptology.

[10]  Hugo Krawczyk,et al.  Chameleon Hashing and Signatures , 1998, IACR Cryptol. ePrint Arch..

[11]  Marc Fischlin,et al.  Computing on Authenticated Data for Adjustable Predicates , 2013, ACNS.

[12]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[13]  Yael Tauman Kalai,et al.  Improved Online/Offline Signature Schemes , 2001, CRYPTO.

[14]  Joonsang Baek,et al.  Efficient online/offline identity-based signature for wireless sensor network , 2010, International Journal of Information Security.

[15]  Eike Kiltz,et al.  Programmable Hash Functions and Their Applications , 2008, CRYPTO.

[16]  Léo Ducas,et al.  Improved Short Lattice Signatures in the Standard Model , 2014, CRYPTO.

[17]  Zhenfeng Zhang,et al.  Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes , 2016, CRYPTO.

[18]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..