4,534 research outputs found
Security bounds in Quantum Cryptography using d-level systems
We analyze the security of quantum cryptography schemes for -level systems
using 2 or maximally conjugated bases, under individual eavesdropping
attacks based on cloning machines and measurement after the basis
reconciliation. We consider classical advantage distillation protocols, that
allow to extract a key even in situations where the mutual information between
the honest parties is smaller than the eavesdropper's information. In this
scenario, advantage distillation protocols are shown to be as powerful as
quantum distillation: key distillation is possible using classical techniques
if and only if the corresponding state in the entanglement based protocol is
distillable.Comment: 18 pages, 1 figure. Published versio
Security bound of two-bases quantum key-distribution protocols using qudits
We investigate the security bounds of quantum cryptographic protocols using
-level systems. In particular, we focus on schemes that use two mutually
unbiased bases, thus extending the BB84 quantum key distribution scheme to
higher dimensions. Under the assumption of general coherent attacks, we derive
an analytic expression for the ultimate upper security bound of such quantum
cryptography schemes. This bound is well below the predictions of optimal
cloning machines. The possibility of extraction of a secret key beyond
entanglement distillation is discussed. In the case of qutrits we argue that
any eavesdropping strategy is equivalent to a symmetric one. For higher
dimensions such an equivalence is generally no longer valid.Comment: 12 pages, 2 figures, to appear in Phys. Rev.
Trusted Noise in Continuous-Variable Quantum Key Distribution: a Threat and a Defense
We address the role of the phase-insensitive trusted preparation and
detection noise in the security of a continuous-variable quantum key
distribution, considering the Gaussian protocols on the basis of coherent and
squeezed states and studying them in the conditions of Gaussian lossy and noisy
channels. The influence of such a noise on the security of Gaussian quantum
cryptography can be crucial, even despite the fact that a noise is trusted, due
to a strongly nonlinear behavior of the quantum entropies involved in the
security analysis. We recapitulate the known effect of the preparation noise in
both direct and reverse-reconciliation protocols, as well as the detection
noise in the reverse-reconciliation scenario. As a new result, we show the
negative role of the trusted detection noise in the direct-reconciliation
scheme. We also describe the role of the trusted preparation or detection noise
added at the reference side of the protocols in improving the robustness of the
protocols to the channel noise, confirming the positive effect for the
coherent-state reverse-reconciliation protocol. Finally, we address the
combined effect of trusted noise added both in the source and the detector.Comment: 25 pages, 9 figure
Field test of a practical secure communication network with decoy-state quantum cryptography
We present a secure network communication system that operated with
decoy-state quantum cryptography in a real-world application scenario. The full
key exchange and application protocols were performed in real time among three
nodes, in which two adjacent nodes were connected by approximate 20 km of
commercial telecom optical fiber. The generated quantum keys were immediately
employed and demonstrated for communication applications, including unbreakable
real-time voice telephone between any two of the three communication nodes, or
a broadcast from one node to the other two nodes by using one-time pad
encryption.Comment: 10 pages, 2 figures, 2 tables, typos correcte
Tight Finite-Key Analysis for Quantum Cryptography
Despite enormous progress both in theoretical and experimental quantum
cryptography, the security of most current implementations of quantum key
distribution is still not established rigorously. One of the main problems is
that the security of the final key is highly dependent on the number, M, of
signals exchanged between the legitimate parties. While, in any practical
implementation, M is limited by the available resources, existing security
proofs are often only valid asymptotically for unrealistically large values of
M. Here, we demonstrate that this gap between theory and practice can be
overcome using a recently developed proof technique based on the uncertainty
relation for smooth entropies. Specifically, we consider a family of
Bennett-Brassard 1984 quantum key distribution protocols and show that security
against general attacks can be guaranteed already for moderate values of M.Comment: 11 pages, 2 figure
High-dimensional quantum cryptography with twisted light
Quantum key distributions (QKD) systems often rely on polarization of light
for encoding, thus limiting the amount of information that can be sent per
photon and placing tight bounds on the error that such a system can tolerate.
Here we describe a proof-of-principle experiment that indicates the feasibility
of high-dimensional QKD based on the transverse structure of the light field,
allowing for the transfer of more than 1 bit per photon. Our implementation
uses the orbital angular momentum (OAM) of photons and the corresponding
mutually unbiased basis of angular position (ANG). Our experiment uses a
digital micro-mirror device for the rapid generation of OAM and ANG modes at 4
kHz, and a mode sorter capable of sorting single photons based on their OAM and
ANG content with a separation efficiency of 93\%. Through the use of a
7-dimensional alphabet encoded in the OAM and ANG bases, we achieve a channel
capacity of 2.05 bits per sifted photon. Our experiment shows that, in addition
to having an increased information capacity, QKD systems based on spatial-mode
encoding will be more tolerant to errors and thus more robust against
eavesdropping attacks
Experimental quantum key distribution with source flaws
Decoy-state quantum key distribution (QKD) is a standard technique in current
quantum cryptographic implementations. Unfortunately, existing experiments have
two important drawbacks: the state preparation is assumed to be perfect without
errors and the employed security proofs do not fully consider the finite-key
effects for general attacks. These two drawbacks mean that existing experiments
are not guaranteed to be secure in practice. Here, we perform an experiment
that for the first time shows secure QKD with imperfect state preparations over
long distances and achieves rigorous finite-key security bounds for decoy-state
QKD against coherent attacks in the universally composable framework. We
quantify the source flaws experimentally and demonstrate a QKD implementation
that is tolerant to channel loss despite the source flaws. Our implementation
considers more real-world problems than most previous experiments and our
theory can be applied to general QKD systems. These features constitute a step
towards secure QKD with imperfect devices.Comment: 12 pages, 4 figures, updated experiment and theor
- …