Chinese Physics B

Efficient error estimation in quantum key distribution

Mo Li, Patcharapong Treeviriyanupab, Chunmei Zhang, Zhen−Qiang Yin, Wei Ren Chen, Zheng‐Fu Han

Published Jan 1, 2015• 14 citations

Abstract

In a quantum key distribution (QKD) system, the error rate needs to be estimated for determining the joint probability distribution between legitimate parties, and for improving the performance of key reconciliation. We propose an efficient error estimation scheme for QKD, which is called parity comparison method (PCM). In the proposed method, the parity of a group of sifted keys is practically analysed to estimate the quantum bit error rate instead of using the traditional key sampling. From the simulation results, the proposed method evidently improves the accuracy and decreases revealed information in most realistic application situations.

DOI: 10.1088/1674-1056/24/1/010302

Related papers

Improved Parameter Estimation Methods in the Post-Processing Phase of Quantum Key Distribution

Chuyang Zhong, Yucheng Qiao, Weigang Li +1 more

In the post-processing phase of Quantum Key Distribution (QKD), a crucial step involves the parameter estimation of the initial key. Among various techniques, the group parity check method stands out as a prevalent approach for parameter estimation. This method operates by segmenting the received key into groups and applying parity checks within each group to estimate the bit error rate. Theoretically, this method can achieve high precision estimation with minimal information leakage compared to traditional random sampling methods. However, the practical efficiency and estimation accuracy of this method are contingent upon the group size and the statistical properties of the errors, which sometimes may not yield superior results relative to conventional methods. This paper introduces an enhanced group parity check method, which incorporates an additional parity code comparison and employs a dynamic group strategy, effectively reducing information leakage in subsequent error correction steps caused by erroneous estimations. Experimental results demonstrate that the proposed parameter estimation method can more accurately estimate and correct errors occurring during the QKD physical process and dynamically optimize the key generation process according to actual communication conditions.

International Symposium on Computer Applications and Information Systems (ISCAIS)Mar 21, 20250 citations

Multi-matrix error estimation and reconciliation for quantum key distribution

Chaohui Gao, Dong Jiang, Yu Guo +1 more

Post-processing is a significant step in quantum key distribution (QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. By testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows for a more accurate estimation of the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.

arXiv:1902.05263Optics ExpressMay 6, 201923 citations

Rate-adaptive reconciliation and its estimator for quantum bit error rate

Patcharapong Treeviriyanupab, Tharathorn Phromsa‐ard, Chun-Mei Zhang +10 more

The purpose of reconciliation, one of classical aspects of quantum key distribution (QKD) protocol, is to mitigate errors after the distribution of quantum information over a quantum channel. In this paper, a rate-adaptive method is proposed by means of a channel coding scheme where specific low-density parity-check (LDPC) codes are adapted in the Slepian-Wolf coding system. Puncturing and shortening techniques are adopted to optimize their coding rates with all possible cases of error in QKD. This successful method utilizes the knowledge of the quantum bit error rate (QBER) based on the maximum-likelihood estimator with respect to the syndrome information. Its benefit is that avoids wasting sample keys in the traditional channel estimation and thus increases the size of the final secret key. Evidently, simulation results confirm an improvement in the reconciliation efficiency with minimal interaction that suitable for high QKD throughput applications.

International Symposium on Communications and Information TechnologiesSep 1, 201412 citations

The Effect of QBER Estimation on the Efficiency and Security of Quantum Key Distribution

Sufyan T. F. Al-Janabi

Quantum Key Distribution (QKD) is a prominent solution to achieve proven secure data transmission between legitimate users despite any assumptions about the eavesdropper's computational power (given that the laws of quantum mechanics are correct). This remains true even under attacks by quantum computers. In recent years, there has been a great research interest in developing enhanced security constructions based on QKD. This is mainly driven by the envisioned threats of quantum computers to the traditional information security infrastructure based on public key cryptography. This research lies under the wide umbrella of the so-called post-quantum cryptography. However, for any QKD protocol, an accurate estimation of the Quantum Bit Error Rate (QBER) before the information reconciliation phase is crucial for both the efficiency and security perspectives. In spite of the importance of the QBER estimation step, the state-of-the-art literature still lacks a detailed investigation of the practical aspects of this issue. Therefore, this work aims to fill this research gap. An extension of the EnQuad simulator has been used to study the effect of QBER estimation on the efficiency and security of the BB84 QKD protocol for depolarizing quantum channels and individual Intercept/Resend Eve attacks. Various parameters affecting the QBER estimation process have been carefully investigated. Our evaluation has shown the significant importance of the QBER estimation step. Indeed, an empirical formula has been derived for calculating the required size of the sifted key subset (the so-called sharing rate) needed for the QBER estimation. This is a major contribution of the presented work.

Baghdad Science JournalJul 25, 20255 citations

One-way information reconciliation schemes of quantum key distribution

Li Yang, Hua Dong, Li Zhao

With the rapid improvement of quantum computing technology, quantum key distribution(QKD) is a hot technology. Information reconciliation is a key step of QKD which is useful for correcting key error. Classical message interaction is necessary in a practical information reconciliation scheme, which makes the efficiency of these protocols decreased. Therefore, some one-way information reconciliation schemes based on low-density parity-check(LDPC) codes and polar codes are proposed. Here we propose a concatenated method of IR schemes which can achieve any given error rate level without the need of interactions. Compared with the one-way IR schems based on LDPC codes and polar codes, the IR schemes based on the proposed concatenated method can get lower bit error rates after error correction, which can also reduce the communication delay and system complexity of QKD, improve the final key generation rate and enhance the practicability of QKD system.

CybersecurityMay 22, 201910 citations

Improvement of reconciliation for quantum key distribution

Keath Chen

Quantum Key Distribution is meant to be an ultimate computer security system that will not need upgrade/overhaul from time to time. QKD allows the generation of long key length on demand. QKD, coupled with the unconditional secure "one-time pad" encryption system, will be unbreakable for eavesdropper with infinite resources. Numerous experimental QKD prototypes have demonstrated that QKD is likely to be a reality before quantum computer. One of the steps in a Quantum Key Distribution protocol is to remove the transmission errors from quantum communication, which typically has a high error rate (one percent or higher). An interactive error control method is utilized in the reconciliation of QKD. This procedure divides transmitted bits into blocks. The size of the block is chosen so that the chance of having multiple error bits in one block is small. By checking parity and doing interactive BINARY search when a parity error is found, error bits can be located and removed. Some error bits escape the detection from the first pass. By repeating this procedure several times, each time randomly dividing bits into blocks, most error bits can be detected and removed. Each parity check means loss of one bit. The goal is to minimize the number of parity checks to locate all (or most) errors and to have a high reliability that the remaining bits have very small residue error rate. Brassard and Salvail devised a better error control procedure in 1993. By keeping track of block parity information from pass to pass, which they called CASCADE, the number of parity checks per error bit is reduced. They observed no errors left after four passes from 10 simulation runs. However, they offered upper bound of residue error rate that was much higher than observed from simulation. Therefore, there is a need to find the optimal block size and to improve the residue error rate analysis of this procedure. In this work, improvement in reconciliation procedure is obtained in throughput (i.e. the number of input bits minus the number of parity checks) and in lower residue error rate. Throughput is doubled at high input error rate and less throughput gain at low input error rate. Three most important factors that enhance the system throughput are: 1) Using larger block size to fully utilize the power of CASCADE method. 2) Avoiding any pair of bits to stay in the same block of any later pass, which allows the use of three passes only (instead of four passes in the BS procedure). 3) Some bits are already known to be lost from the current pass, so I avoid carrying these bits to the later pass. The residue error rate at the end of the second pass (and the third pass) for small initial block size is derived. The residue error rate at the end of the third pass is found much lower than the upper bound given by the previous workers. This residue error rate is found to be a function of input size and the block size. This error control method has many similar features and difficulties to the recent development of "turbo-code" in the error control-coding field.

Jan 1, 20009 citations