Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

Data privacy concerns are increasing significantly in the context of the Internet of Things,
cloud services, edge computing, artificial intelligence applications, and other applications …

This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that
revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW …

In this paper, we revisit fully homomorphic encryption (FHE) based on GSW and its ring
variants. We notice that the internal product of GSW can be replaced by a simpler external …

We present a much-improved practical protocol, based on the hardness of Module-SIS and
Module-LWE problems, for proving knowledge of a short vector s→ satisfying A s→= t→ mod …

• Increase noise parameter for Kyber512 In the round-2 submission of Kyber, the decryption
error for Kyber512 was rather conservative, while at the same time, there were requests to …

In this paper we port Brakerski's fully homomorphic scheme based on the Learning With
Errors (LWE) problem to the ring-LWE setting. We introduce two optimised versions of …

We propose a general multiparty computation protocol secure against an active adversary
corrupting up to n-1 of the n players. The protocol may be used to compute securely …

We give new methods for generating and using “strong trapdoors” in cryptographic lattices,
which are simultaneously simple, efficient, easy to implement (even in parallel), and …