• Publications
  • Influence
Experimental Quantum Cryptography
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.
Secret-Key Reconciliation by Public Discussion
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%).
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
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.
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of
Quantum Authentication and Encryption with Key Recycling
We propose an information-theoretically secure encryption scheme for classical messages with quantum ciphertexts that offers detection of eavesdropping attacks, and re-usability of the key in case no
The SECOQC quantum key distribution network in Vienna
In this paper, we present the quantum key distribution (QKD) network designed and implemented by the European project SEcure COmmunication based on Quantum Cryptography (SECOQC) (2004?2008), unifying
SECOQC White Paper on Quantum Key Distribution and Cryptography
It is detailed how the work on QKD networks lead within SECOQC will allow the deployment of long-distance secure communication infrastructures based on quantum cryptography, and what may be the next challenges in this direction.
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing
Actively Secure Two-Party Evaluation of Any Quantum Operation
The first two-party protocol allowing Alice and Bob to evaluate privately even against active adversaries any completely positive, trace-preserving map is provided, constructed from the protocol for the same task secure against specious adversaries present.
Solving the maximum clique problem using a tabu search approach
Two variants of a tabu search heuristic are described, a deterministic one and a probabilistic one, for the maximum clique problem, which produces graphs with larger clique sizes than comparable ones obtained by classical random graph generating techniques.