Quantum cryptography is the art and science of exploiting quantum mechanical effects in
order to perform cryptographic tasks. While the most well-known example of this discipline is …

The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is
the ability to prove the information-theoretic security (ITS) of the established keys. As a key …

We met as a group during the Homomorphic Encryption Standardization Workshop on July
13–14, 2017, hosted at Microsoft Research in Redmond, and again during the second …

We present qTESLA, a post-quantum provably-secure digital signature scheme that exhibits
several attractive features such as simplicity, strong security guarantees against quantum …

Quantum random-access lookup of a string of classical bits is a necessary ingredient in
several important quantum algorithms. In some cases, the cost of such quantum random …

In this paper, we study the Learning With Errors problem and its binary variant, where
secrets and errors are binary or taken in a small interval. We introduce a new variant of the …

By applying a quantum search algorithm to various heuristic and provable sieve algorithms
from the literature, we obtain improved asymptotic quantum results for solving the shortest …

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 …

We met as a group during the Homomorphic Encryption Standardization Workshop on July
13-14, 2017, hosted at Microsoft Research in Redmond. Researchers from around the world …

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 …