Related papers: A Polynomial Interpolation based Quantum Key Recon…
Reconciliation is a crucial procedure in post-processing of continuous variable quantum key distribution (CV-QKD) system, which is used to make two distant legitimate parties share identical corrected keys. The adaptive reconciliation is…
We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource -- a process matrix -- that does not correspond to any definite causal order between two parties. In our protocol,…
Quantum key distribution (QKD) is a cryptographic protocol to enable two parties to share a secure key string, which can be used in one-time pad cryptosystem. There has been an ongoing surge of interest in implementing long-haul…
Quantum key distribution (QKD) is a promising technique for secure communication based on quantum mechanical principles. To improve the secure key rate of a QKD system, most studies on reconciliation primarily focused on improving the…
Information reconciliation protocol has a significant effect on the secret key rate and maximal transmission distance of continuous-variable quantum key distribution (CV-QKD) systems. We propose an efficient rate-adaptive reconciliation…
We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. The crucial feature is an…
Information reconciliation(IR) is a basic step of quantum key distribution (QKD). Classical message interaction is necessary in a practical IR scheme, and the communication complexity has become a bottleneck of QKD's development. Here we…
Information reconciliation (IR) corrects the errors in sifted keys and ensures the correctness of quantum key distribution (QKD) systems. Polar codes-based IR schemes can achieve high reconciliation efficiency, however, the incidental high…
We consider error correction in quantum key distribution. To avoid that Alice and Bob unwittingly end up with different keys precautions must be taken. Before running the error correction protocol, Bob and Alice normally sacrifice some bits…
In this work, we present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs. In the absence of noise, we securely authenticate the well-known BB84 QKD scheme under two assumptions: first,…
Efficient information reconciliation is crucial in several scenarios, being quantum key distribution a remarkable example. However, efficiency is not the only requirement for determining the quality of the information reconciliation…
It is widely accepted in the quantum cryptography community that interactive information reconciliation protocols, such as cascade, are ineffcient due to the communication overhead. Instead, non-interactive information reconciliation…
The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the protocol. The problem of information reconciliation can be reduced to that of distributed source coding. Its solution by…
We present security proofs for a protocol for Quantum Key Distribution (QKD) based on encoding in finite high-dimensional Hilbert spaces. This protocol is an extension of Bennett's and Brassard's basic protocol from two bases, two state…
The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms…
We present two new schemes for quantum key distribution (QKD) that neither require entanglement nor an ideal single-photon source, making them implementable with commercially available single-photon sources. These protocols are shown to be…
In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e., one where…
Graph based codes such as low density parity check (LDPC) codes have been shown promising for the information reconciliation phase in quantum key distribution (QKD). However, existing graph coding schemes have not fully utilized the…
In continuous-variable quantum key distribution, information reconciliation is required to extract a shared secret key from correlated random variables obtained through the quantum channel. Reverse reconciliation (RR) is generally…
Quantum key distribution performs the trick of growing a secret key in two distant places connected by a quantum channel. The main reason is that the legitimate users can bound the information gathered by the eavesdropper. In practical…