scholarly journals Security proof of practical quantum key distribution with detection-efficiency mismatch

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Yanbao Zhang ◽  
Patrick J. Coles ◽  
Adam Winick ◽  
Jie Lin ◽  
Norbert Lütkenhaus
Keyword(s):  
Quantum Key Distribution ◽  
Detection Efficiency ◽  
Key Distribution ◽  
Security Proof

Security proof of quantum key distribution with detection efficiency mismatch

2009 ◽  
Vol 9 (1&2) ◽  
pp. 131-165
Author(s):  
C.-H. F. Fung ◽  
K. Tamaki ◽  
B. Qi ◽  
H.-K. Lo ◽  
X. Ma
Keyword(s):  
Quantum Key Distribution ◽  
Detection Efficiency ◽  
Key Distribution ◽  
Unconditional Security ◽  
Generation Rate ◽  
Key Generation ◽  
Efficiency Ratio ◽  
Physical Origin ◽  
Security Proof ◽  
Time Domains

In theory, quantum key distribution (QKD) offers unconditional security based on the laws of physics. However, as demonstrated in recent quantum hacking theory and experimental papers, detection efficiency loophole can be fatal to the security of practical QKD systems. Here, we describe the physical origin of detection efficiency mismatch in various domains including spatial, spectral, and time domains and in various experimental set-ups. More importantly, we prove the unconditional security of QKD even with detection efficiency mismatch. We explicitly show how the key generation rate is characterized by the maximal detection efficiency ratio between the two detectors. Furthermore, we prove that by randomly switching the bit assignments of the detectors, the effect of detection efficiency mismatch can be completely eliminated.

scholarly journals Computing conditional entropies for quantum correlations

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Peter Brown ◽  
Hamza Fawzi ◽  
Omar Fawzi
Keyword(s):  
Quantum Key Distribution ◽  
Detection Efficiency ◽  
Conditional Entropy ◽  
Key Distribution ◽  
Quantum Correlations ◽  
Upper Bounds ◽  
Cryptographic Protocols ◽  
Quantum States ◽  
Security Proofs

AbstractThe rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum states jointly held by the adversary and the parties that are consistent with the statistics that are seen by the parties. Here, we introduce a method to approximate such entropic quantities. Applied to the setting of device-independent randomness generation and quantum key distribution, we obtain improvements on protocol rates in various settings. In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution without additional preprocessing. Furthermore, we show that our construction can be readily combined with the entropy accumulation theorem in order to establish full finite-key security proofs for these protocols.

scholarly journals Apply current exponential de Finetti theorem to realistic quantum key distribution

2014 ◽  
Vol 33 ◽  
pp. 1460370 ◽  
Author(s):  
Yi-Bo Zhao ◽  
Zhen-Qiang Yin
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Small Error ◽  
Heterodyne Detection ◽  
Finite Dimensional Subspace ◽  
Dimensional System ◽  
Finite Dimensional ◽  
Security Proof ◽  
De Finetti Theorem ◽  
De Finetti

In the realistic quantum key distribution (QKD), Alice and Bob respectively get a quantum state from an unknown channel, whose dimension may be unknown. However, while discussing the security, sometime we need to know exact dimension, since current exponential de Finetti theorem, crucial to the information-theoretical security proof, is deeply related with the dimension and can only be applied to finite dimensional case. Here we address this problem in detail. We show that if POVM elements corresponding to Alice and Bob's measured results can be well described in a finite dimensional subspace with sufficiently small error, then dimensions of Alice and Bob's states can be almost regarded as finite. Since the security is well defined by the smooth entropy, which is continuous with the density matrix, the small error of state actually means small change of security. Then the security of unknown-dimensional system can be solved. Finally we prove that for heterodyne detection continuous variable QKD and differential phase shift QKD, the collective attack is optimal under the infinite key size case.

scholarly journals Finite-key analysis for twin-field quantum key distribution with composable security

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Hua-Lei Yin ◽  
Zeng-Bing Chen
Keyword(s):  
Coherent State ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Practical Implementation ◽  
Fluctuation Analysis ◽  
Statistical Fluctuation ◽  
Secret Key ◽  
Quantum Repeater ◽  
Long Distance ◽  
Security Proof

AbstractLong-distance quantum key distribution (QKD) has long time seriously relied on trusted relay or quantum repeater, which either has security threat or is far from practical implementation. Recently, a solution called twin-field (TF) QKD and its variants have been proposed to overcome this challenge. However, most security proofs are complicated, a majority of which could only ensure security against collective attacks. Until now, the full and simple security proof can only be provided with asymptotic resource assumption. Here, we provide a composable finite-key analysis for coherent-state-based TF-QKD with rigorous security proof against general attacks. Furthermore, we develop the optimal statistical fluctuation analysis method to significantly improve secret key rate in high-loss regime. The results show that coherent-state-based TF-QKD is practical and feasible, with the potential to apply over nearly one thousand kilometers.

Sign in / Sign up

Export Citation Format

Share Document