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 advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

To solve the approximate nearest neighbor search problem (NNS) on the sphere, we
propose a method using locality-sensitive filters (LSF), with the property that nearby vectors …

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 present a novel approach to fully homomorphic encryption (FHE) that dramatically
improves performance and bases security on weaker assumptions. A central conceptual …

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 propose the first fully homomorphic encryption scheme, solving an old open problem.
Such a scheme allows one to compute arbitrary functions over encrypted data without the …

The best lattice reduction algorithm known in practice for high dimension is Schnorr-
Euchner's BKZ: all security estimates of lattice cryptosystems are based on NTL's old …

Many recent private set intersection (PSI) protocols encode input sets as polynomials. We
consider the more general notion of an oblivious key-value store (OKVS), which is a data …