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

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 …

Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit
special structures of the rings used in those cryptosystems. The same structures are also …

A natural and recurring idea in the knapsack/lattice cryptography literature is to start from a
lattice with remarkable decoding capability as your private key, and hide it somehow to …

Introduced by Hoffstein–Pipher–Silverman in 1998. Security related to lattice problems; pre-
version cryptanalyzed with LLL by Coppersmith and Shamir. System parameters (p, q), p …

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 …

Let encoding of zero and utilize it to attack a security ground of this scheme in the quasi-
polynomial time of its security parameter using the parameters suggested by Garg, Gentry …