Name
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 Õ(n1.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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-29011-4_43 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
efficient signature,lattice signature,hash-and-sign signature,sivp problem,lattice-based digital signature,resulting signature scheme,secret key,errors problem,to-date provably secure signature,signature size,public key | Conference | 2011 |
ISSN | Citations | PageRank |
0302-9743 | 79 | 2.89 |
References | Authors | |
40 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vadim Lyubashevsky | 1 | 1174 | 59.91 |