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)

Related topics

Related topics

16 relations
Chosen-ciphertext attackComputational hardness assumptionHomomorphic encryptionIdeal lattice cryptography

Broader (2)

CryptographyMachine learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Algebraic aspects of solving Ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm
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
Integer Version of Ring-LWE and its Applications
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
Practical Implementation of Lattice-Based Program Obfuscators for Point Functions
Lattice-based cryptography has recently produced several time-efficient cryptosystems that are provably secure under assumptions… 
2016
2016
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security
Over the last few years a new breed of cryptographic primitives has arisen: on one hand they have previously unimagined utility… 
2015
2015
Efficient Secure Outsourcing of Genome-Wide Association Studies
A genome-wide association study aimed at finding genetic variations associated with a particular disease is a common approach… 
2015
2015
On the Linearization of Human Identification Protocols: Attacks Based on Linear Algebra, Coding Theory, and Lattices
Human identification protocols are challenge-response protocols that rely on human computational ability to reply to random… 
2014
2014
Adaptively Secure UC Constant Round Multi-Party Computation Protocols
We present a universally composable multiparty computation protocol that is adaptively secure against corruption of n − 1 of the… 
2013
2013
HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with… 
2012
2012
The Implemention and Application of Fully Homomorphic Encryption Scheme
Fully homomorphic encryption scheme (FHE) has numerous applications, especially in the cloud computation. Recently, FHE has been… 
2002
2002
Application of combined non-thermal treatments for the processing of liquid whole egg
The objective of this research was to investigate the applicability of non-thermal treatments for the processing of liquid whole… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)