Louis Salvail

TL;DR: Initial results from an apparatus and protocol designed to implement quantum public key distribution are described, by which two users exchange a random quantum transmission, consisting of very faint flashes of polarized light, which remains secure against an adversary with unlimited computing power.

TL;DR: A more efficient protocol is presented, which leaks an amount of information acceptably close to the minimum possible for sufficiently reliable secret channels (those with probability of any symbol being transmitted incorrectly as large as 15%).

TL;DR: The paper presents the architecture and functionality of the principal networking agent?the SECOQC node module, which enables the authentic classical communication required for key distillation, manages the generated key material, determines a communication path between any destinations in the network, and realizes end-to-end secure transport of key material between these destinations.

TL;DR: A precise characterization for when one can base OT on WOT is given, and a similar threshold phenomenon for bit commitment is shown, which shows that no information-theoretic reductions from OT (even against passive adversaries) and BC exist.

TL;DR: In this paper, the authors study two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size, and show that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory, whereas an adversarial player needs quantum memory of size at least n/2 in order to break the protocol, where n is the number of qubits transmitted.