Learning with errors

Known as: LWE, Learning with error, R-LWE 
Learning with errors (LWE) is a problem in machine learning that is conjectured to be hard to solve. Introduced by Oded Regev in 2005, it is a… (More)
Wikipedia

Related topics

Related topics

16 relations
Chosen-ciphertext attackComputational hardness assumptionHomomorphic encryptionIdeal lattice cryptography
(More)

Broader (2)

CryptographyMachine learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Middle-Product Learning With Errors
We introduce a new variant MP-LWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials… (More)
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Faster Bootstrapping with Polynomial Error
Bootstrapping is a technique, originally due to Gentry (STOC 2009), for “refreshing” ciphertexts of a somewhat homomorphic… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Classical hardness of learning with errors
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems… (More)
  • figure 1
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. In… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
On Ideal Lattices and Learning with Errors over Rings
The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Functional Encryption for Inner Product Predicates from Learning with Errors
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Robustness of the Learning with Errors Assumption
Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography… (More)
Is this relevant?
Review
2010
Review
2010
The Learning with Errors Problem (Invited Survey)
  • Oded Regev
  • IEEE 25th Annual Conference on Computational…
  • 2010
In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On lattices, learning with errors, random linear codes, and cryptography
 
Is this relevant?