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 …

There is mounting evidence of emergent phenomena in the capabilities of deep learning
methods as we scale up datasets, model sizes, and training times. While there are some …

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

Rapid advances in quantum computing, together with the announcement by the National
Institute of Standards and Technology (NIST) to define new standards for digitalsignature …

We introduce the SPIRAL family of single-server private information retrieval (PIR) protocols.
SPIRAL relies on a composition of two lattice-based homomorphic encryption schemes: the …

• 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 …

The main bottleneck affecting the efficiency of all known fully homomorphic encryption (FHE)
schemes is Gentry's bootstrapping procedure, which is required to refresh noisy ciphertexts …

Lattice-based cryptography offers some of the most attractive primitives believed to be
resistant to quantum computers. Following increasing interest from both companies and …

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 …