Skip to Main content Skip to Navigation
Conference papers

Lattice signatures without trapdoors

Vadim Lyubashevsky 1
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : We provide an alternative method for constructing lattice-based digital signatures which does not use the "hash-and-sign" methodology of Gentry, Peikert, and Vaikuntanathan (STOC 2008). Our resulting signature scheme is secure, in the random oracle model, based on the worst-case hardness of the Õ(n 1.5)-SIVP problem in general lattices. The secret key, public key, and the signature size of our scheme are smaller than in all previous instantiations of the hash-and-sign signature, and our signing algorithm is also quite simple, requiring just a few matrix-vector multiplications and rejection samplings. We then also show that by slightly changing the parameters, one can get even more efficient signatures that are based on the hardness of the Learning With Errors problem. Our construction naturally transfers to the ring setting, where the size of the public and secret keys can be significantly shrunk, which results in the most practical to-date provably secure signature scheme based on lattices.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00864308
Contributor : Vadim Lyubashevsky <>
Submitted on : Friday, September 20, 2013 - 5:40:01 PM
Last modification on : Thursday, July 1, 2021 - 5:58:06 PM

Links full text

Identifiers

Collections

Citation

Vadim Lyubashevsky. Lattice signatures without trapdoors. EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012., Apr 2012, Cambridge, United Kingdom. pp.738-755, ⟨10.1007/978-3-642-29011-4_43⟩. ⟨hal-00864308⟩

Share

Metrics

Record views

2873