IEEE International Symposium on Information Theory (ISIT)

Fundamental finite key limits for information reconciliation in quantum key distribution

Marco Tomamichel, Jesús Martínez-Mateo, Christoph Pacher, David Elkouss

Published Jun 1, 2014• 12 citations

Abstract

The security of quantum key distribution protocols is guaranteed by the laws of quantum mechanics. However, a precise analysis of the security properties requires tools from both classical cryptography and information theory. Here, we employ recent results in non-asymptotic classical information theory to show that information reconciliation imposes fundamental limitations on the amount of secret key that can be extracted in the finite key regime. In particular, we find that an often used approximation for the information leakage during one-way information reconciliation is flawed and we propose an improved estimate.

DOI: 10.1109/isit.2014.6875077

Related papers

Analysis of a rate-adaptive reconciliation protocol and the effect of leakage on the secret key rate

David Elkouss, Jesús Martínez-Mateo, Vicente Martín

Quantum key distribution performs the trick of growing a secret key in two distant places connected by a quantum channel. The main reason is so that the legitimate users can bound the information gathered by the eavesdropper. In practical systems, whether because of finite resources or external conditions, the quantum channel is subject to fluctuations. A rate-adaptive information reconciliation protocol, which adapts to the changes in the communication channel, is then required to minimize the leakage of information in the classical postprocessing. We consider here the leakage of a rate-adaptive information reconciliation protocol. The length of the exchanged messages is larger than that of an optimal protocol; however, we prove that the min-entropy reduction is limited. The simulation results, both in the asymptotic and in the finite-length regime, show that this protocol allows to increase the amount of a distillable secret key.

arXiv:1304.3367Physical Review AApr 26, 201317 citations

A novel approach to estimating reconciliation leakage for quantum key distribution

Haokun Mao, Qiang Zhao, Yucheng Qiao +4 more

Quantum key distribution (QKD) is an important branch of quantum information science as it provides unconditional security to classical communications. For QKD research, a central issue is to improve the secure key rate (SKR) and transmission distance of a practical QKD system. To address this issue, we focus on reducing the reconciliation leakage without compromising security. Through eliminating the part of leaked information that has already been considered before reconciliation, this paper presents a novel approach for estimating reconciliation leakage more accurately to break through the limits of conventional approaches. The general SKR formulas of two typical QKD protocols are then derived based on our approach. Simulation results showed that our proposed approach efficiently improves the SKR at any distance as well as the maximum transmission distance under practical experimental parameters.

Apr 28, 20210 citations

On one asymptotic property of time-shift quantum cryptography

S. N. Molotkov

One of the basic results of classical information theory is that error-free information transmission is possible even through an imperfect binary communication channel with noise up to an error of Q c = 1/2. There is a fundamental and applied question of whether quantum-mechanical constraints can ensure error-free classical-information transmission with quantum states and, moreover, guarantee the security of distributed keys up to the theoretical limit in the error Q c. It has been shown that the secure key distribution is possible up to the error Q c in the asymptotic limit of a large number of bases.

Journal of Experimental and Theoretical Physics LettersDec 1, 20090 citations

High-efficiency quantum key distribution without key sifting

Ping Liu, Shaobo Gao, Chunyan Li +1 more

In traditional quantum key distribution protocol, both communication parties need to reconciliate their encoding basis to realize sharing secret keys. However, the process of basis reconciliation decreases the generation efficiency of the secret key and classical information is needed to be transmitted for every raw key. Based on quantum interference, we propose a high-efficiency quantum key distribution protocol without basis reconciliation. The presented protocol can greatly improve the generating efficiency of secret keys, reaching 100% in the ideal case, and no classical information is needed. We also analyze the security of the protocol in detail, which shows that the protocol is robust against common attack strategies. Furthermore, the protocol can be implemented with current technologies and open promising possibilities for quantum cryptography.

Journal of the Optical Society of America BSep 24, 20180 citations

Key Reconciliation for High Performance Quantum Key Distribution

Jesús Martínez-Mateo, David Elkouss, Vicente Martín

Quantum Key Distribution is carving its place among the tools used to secure communications. While a difficult technology, it enjoys benefits that set it apart from the rest, the most prominent is its provable security based on the laws of physics. QKD requires not only the mastering of signals at the quantum level, but also a classical processing to extract a secret-key from them. This postprocessing has been customarily studied in terms of the efficiency, a figure of merit that offers a biased view of the performance of real devices. Here we argue that it is the throughput the significant magnitude in practical QKD, specially in the case of high speed devices, where the differences are more marked, and give some examples contrasting the usual postprocessing schemes with new ones from modern coding theory. A good understanding of its implications is very important for the design of modern QKD devices.

Scientific ReportsApr 2, 201369 citations

Security Analysis of Quantum Key Distribution: Methods and Applications

Jie Lin

Quantum key distribution (QKD) can be proved to be secure by laws of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools that extend the applicability of these numerical methods. We then present the asymptotic security proof against collective attacks for a variant of the twin-field QKD protocol, which can overcome the repeaterless secret-key capacity bound. Our variant reduces the sifting cost and uses non-phase-randomized coherent states as both signals and test states. We confirm the loss scaling of this protocol. Another important family of protocols that we investigate here are discrete-modulated continuous-variable QKD protocols. They are interesting due to their experimental simplicity and their great potential for massive deployment in the quantum-secured networks. Our security proof method can provide tight asymptotic key rates. We demonstrate that the postselection of data in combination with reverse reconciliation can improve the key rates. We analyze both untrusted and trusted detector noise scenarios. Our results in the trusted detector noise scenario show that we can thus cut out most of the effect of detector noise and obtain asymptotic key rates similar to those had we access to ideal detectors. Finally, we present several simple examples to illustrate our newly developed method for the numerical finite-key analysis against the most general attacks via the entropy accumulation theorem.

Sep 27, 20212 citations