Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We provide a reduction of the Ring-LWE problem to Ring-LWE problems in subrings, in the presence of samples of a restricted form… 
2019
2019
In this work, we introduce an integer version of ring-LWE (I-RLWE) over the polynomial rings and present a public key encryption… 
2017
2017
Lattice-based cryptography has recently produced several time-efficient cryptosystems that are provably secure under assumptions… 
2016
2016
Over the last few years a new breed of cryptographic primitives has arisen: on one hand they have previously unimagined utility… 
2015
2015
The demand for privacy is more important consideration for digital data maintenance and handling in the systems. However, the… 
2015
2015
A genome-wide association study aimed at finding genetic variations associated with a particular disease is a common approach… 
2013
2013
We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with… 
2013
2013
First, we prove that a homomorphic encryption with a function of detecting zero, detecting equality, comparing the value or… 
2012
2012
Fully homomorphic encryption scheme (FHE) has numerous applications, especially in the cloud computation. Recently, FHE has been… 
Highly Cited
2007
Highly Cited
2007
Anti‐cyclonic eddies northwest of Luzon of the Philippines in summer‐fall are identified in the merged data products of satellite…