Assuming that Alice and Bob use a secret noisy channel (modelled by a binary symmetric
channel) to send a key, reconciliation is the process of correcting errors between Alice’s and …

We describe results from an apparatus and protocol designed to implement quantum key
distribution, by which two users, who share no secret information initially: (1) exchange a …

In this paper, we present the quantum key distribution (QKD) network designed and implemented
by the European project SEcure COmmunication based on Quantum Cryptography (…

We initiate the study of two-party cryptographic primitives with unconditional security, assuming
that the adversary's quantum memory is of bounded size. We show that oblivious transfer …

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 investigate the possibility of having someone carry out the work of executing a function
for you, but without letting him learn anything about your input. Say Alice wants Bob to …

A Quantum Key Distribution (QKD) network is an infrastructure capable of performing long-distance
and high-rate secret key agreement with information-theoretic security. In this paper …

We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic
one, for the maximum clique problem. This heuristic may be viewed as a natural alternative …

We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with
information theoretic security, on seemingly weaker primitives. We introduce a general model …

We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is
tight and can be applied in various quantum-cryptographic settings. Protocols for quantum 1…