You are looking at a specific version 20130326:142050 of this paper.
See the latest version.
Paper 2013/164
Provably Secure LWE-Encryption with Uniform Secret
Daniel Cabarcas and Florian Göpfert and Patrick Weiden
Abstract
In this paper we present the (to the best of our knowledge) first LWE-based encryption scheme that removes the need of Gaussian sampling for the error, i.e. the discrete Gaussian distribution is replaced by the uniform distribution on a (small) set, which at the same time preserves the underlying worst-case hardness. This shows that provable security and efficiency do not necessarily have to mutually exclude each other. We give an asymptotic parameter instantiation for our scheme, as well as some hardness results for LWE which might be of independent interest.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- LWEEncryptionLattice-Based Cryptography
- Contact author(s)
- pweiden @ cdc informatik tu-darmstadt de
- History
- 2014-04-10: revised
- 2013-03-26: received
- See all versions
- Short URL
- https://ia.cr/2013/164
- License
-
CC BY