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 …

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 …

Lattice-based cryptographic primitives are believed to offer resilience against attacks by
quantum computers. We demonstrate the practicality of post-quantum key exchange by …

In this paper we propose an efficient and compact processor for a ring-LWE based
encryption scheme. We present three optimizations for the Number Theoretic Transform …

Homomorphic encryption (HE)---the ability to perform computation on encrypted data---is an
attractive remedy to increasing concerns about data privacy in deep learning (DL). However …

We conduct a theoretical and practical comparison of two Ring-LWE-based, scale-invariant,
leveled homomorphic encryption schemes–Fan and Vercauteren's adaptation of BGV and …

By replacing the brute-force list search in sieving algorithms with Charikar's angular locality-
sensitive hashing (LSH) method, we get both theoretical and practical speedups for solving …

In this paper, we investigate a variant of the BKZ algorithm, called progressive BKZ, which
performs BKZ reductions by starting with a small blocksize and gradually switching to larger …

Lattice reduction algorithms are notoriously hard to predict, both in terms of running time and
output quality, which poses a major problem for cryptanalysis. While easy to analyze …

Biological data science is an emerging field facing multiple challenges for hosting, sharing,
computing on, and interacting with large data sets. Privacy regulations and concerns about …