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 …

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 …

In this survey, the authors review the main quantum algorithms for solving the computational
problems that serve as hardness assumptions for cryptosystem. To this end, the authors …

Search problems in cryptography Page 1 Search problems in cryptography: from fingerprinting
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …

In this work, we study GPU implementations of various state-of-the-art sieving algorithms for
lattices (Becker-Gama-Joux 2015, Becker-Ducas-Gama-Laarhoven 2016, Herold …

Lattice-based cryptography is one of the leading proposals for post-quantum cryptography.
The Shortest Vector Problem (SVP) is arguably the most important problem for the …

Quantum variants of lattice sieve algorithms are routinely used to assess the security of
lattice based cryptographic constructions. In this work we provide a heuristic, non …

Most algorithms for hard lattice problems are based on the principle of rank reduction: to
solve a problem in ad-dimensional lattice, one first solves one or more problem instances in …

In this work we study speed-ups and time–space trade-offs for solving the shortest vector
problem (SVP) on Euclidean lattices based on tuple lattice sieving. Our results extend and …

Lattice-based cryptography has gained credence recently as a replacement for current
public-key cryptosystems, due to its quantum-resilience, versatility, and relatively low key …