Blockchain and other Distributed Ledger Technologies (DLTs) have evolved significantly in
the last years and their use has been suggested for numerous applications due to their …

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 …

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

We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on
the learning with errors (LWE) problem. In previous LWE-based FHE schemes, multiplication …

Given the computational cost and technical expertise required to train machine learning
models, users may delegate the task of learning to a service provider. Delegation of learning …

A fully homomorphic encryption (FHE) scheme allows anyone to transform an encryption of
a message, m, into an encryption of any (efficient) function of that message, f(m), without …

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 …

The “learning with errors”(LWE) problem is to distinguish random linear equations, which
have been perturbed by a small amount of noise, from truly uniform ones. The problem has …

We provide an alternative method for constructing lattice-based digital signatures which
does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan …