Results 91 to 100 of about 6,148 (198)
Revocable Identity-Based Encryption Scheme Under LWE Assumption in the Standard Model
A revocable identity-based encryption (IBE) scheme under learning with error (LWE) assumption from lattice is proposed; compared with the existing IBE schemes from lattices, two improvements are available in the new scheme.
Yaling Zhang, Shangping Wang, Qing Du
doaj +1 more source
On the Asymptotic Complexity of Solving LWE [PDF]
We provide for the first time an asymptotic comparison of all known algorithms for the search version of the Learning with Errors (LWE) problem. This includes an analysis of several lattice-based approaches as well as the combinatorial BKW algorithm. Our
Alexander May +2 more
core +1 more source
Additively Homomorphic Ring-LWE Masking [PDF]
In this paper, we present a new masking scheme for ring-LWE decryption. Our scheme exploits the additively-homomorphic property of the existing ring-LWE encryption schemes and computes an additive-mask as an encryption of a random message. Our solution differs in several aspects from the recent masked ring-LWE implementation by Reparaz et al. presented
De Clercq, Ruan +4 more
openaire +3 more sources
The Learning With Errors problem is the basis of a few cryptosystems, and a foundation for many fully homomorphic encryption (FHE) schemes. In this article I'll describe a technique used in some of these schemes called modulus switching. In brief, an LWE sample is a vector of values in $\mathbb{Z}/q\mathbb{Z}$ for some $q$, and in LWE cryptosystems an ...
openaire +1 more source
Last time we covered an operation in the LWE encryption scheme called modulus switching, which allows one to switch from one modulus to another, at the cost of introducing a small amount of extra noise, roughly $\sqrt{n}$, where $n$ is the dimension of the LWE ciphertext.
openaire +1 more source
High-Secure Fingerprint Authentication System Using Ring-LWE Cryptography
This paper presents a high-secure fingerprint authentication system using ring learning with errors (ring-LWE) cryptography to protect users' fingerprint data more securely.
Tuy Nguyen Tan, Hanho Lee
doaj +1 more source
Succinct LWE Sampling, Random Polynomials, and Obfuscation [PDF]
We present a construction of indistinguishability obfuscation (iO) that relies on the learning with errors (LWE) assumption together with a new notion of succinctly sampling pseudo-random LWE samples.
Hoeteck Wee +4 more
core
(In)Security of Ring-LWE Under Partial Key Exposure
We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under ...
Dachman-Soled Dana +3 more
doaj +1 more source
CRT representation of LWE Based TFHE
Abstract Homomorphic encryption is a special type of encryption that allows you to perform homomorphic operations on encrypted data without decryption, ensuring data security. This is the most important system that needs to be developed for customer and/or patient privacy on behalf of all sectors using a cloud system.
Mehmet Özen +3 more
openaire +1 more source
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
In this work, we consider the ring- and module- variants of the LWE problem and investigate cold boot attacks on cryptographic schemes based on these problems, wherein an attacker is faced with the problem of recovering a scheme’s secret key from a noisy
Martin R. Albrecht +2 more
doaj +1 more source

