Skip to search formSkip to main contentSkip to account menu

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%).
View via Publisher (opens in a new tab)

Experimental quantum cryptography

An apparatus and protocol designed to implement quantum key distribution is 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.
View on Springer (opens in a new tab)

The SECOQC quantum key distribution network in Vienna

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.
View on IEEE (opens in a new tab)

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.
View via Publisher (opens in a new tab)

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…
View PDF on arXiv (opens in a new tab)

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…
View Paper (opens in a new tab)

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.
View via Publisher (opens in a new tab)

Cryptography in the bounded quantum-storage model

It is shown 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.
View on IEEE (opens in a new tab)

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.
View on Springer (opens in a new tab)

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…
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)