The main- part of this work is devoted to proving that a very simple construction of lossy codes for LWE actually is lossy for the error-distribution U([−r, r]) ...
In this work we present the first worst-to-average case reduction for LWE with uniformly distributed errors, which can be sampled very efficiently.
People also ask
What is learning with errors problem?
Lossy Codes and a New Variant of the Learning-With-Errors Problem. Authors: Nico Döttling · Jörn Müller-Quade. Download: DOI: 10.1007/978-3-642-38348-9_2 (login ...
Jul 18, 2019 · Lossy Codes and a New Variant of the Learning-With-Errors Problem. Döttling, Nico and Müller-Quade, Jörn. (2013) Lossy Codes and a New Variant ...
Lossy Codes and a New Variant of the Learning-With-Errors Problem ; Verlag, Springer-Verlag ; Seiten, 18-34 ; Serie, Lecture notes in computer science ; 7881.
In this paper, a new variant of LWE is proposed. By using trapdoor composed by lattice-based matrix and its dual orthogonal matrix, we construct a more ...
Lossy codes and a new variant of the learning-with-errors problem. In Annual International. Conference on the Theory and Applications of Cryptographic ...
In recent years, the Learning with Errors (LWE) problem, introduced in [Reg05], has turned out to be an amazingly versatile basis for cryptographic ...
Apr 10, 2024 · The first ever paper obtaining polynomial time quantum algorithms for solving the decisional shortest vector problem (GapSVP) and the shortest independent ...
As a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret.