We propose a family of sifting-less quantum-key-distribution protocols which use reverse reconciliation, and are based on weak coherent pulses (WCPs) polarized along
m different directions. When
m=4, the physical part of the protocol is identical to most experimental implementations of BB84 [Bennett and Brassard, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (IEEE, New York, 1984)] and SARG04 [Scarani, Ac\'{\i}n, Ribordy, and Gisin, Phys. Rev. Lett. 92, 057901 (2004); Ac\'{\i}n, Gisin, and Scarani, Phys. Rev. A 69, 012309 (2004)] protocols and they differ only in classical communications and data processing. We compute their total key rate as a function of the channel transmission
T, using general information theoretical arguments, and we show that they have a higher key rate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) [Hwang, Phys. Rev. Lett. 91, 057901 (2003); Lo, Ma, and Chen, Phys. Rev. Lett. 94, 230504 (2005); Wang, Phys. Rev. A 72, 012322 (2005)] are applied, the scaling of the key rate with transmission is improved from
T2 for BB84 to ${T}^{1+\frac{1}{m\ensuremath{-}2}}$. If a DSP is applied, we show how the key rates scale linearly with
T, with an improvement of the prefactor by 75.96% for
m=4. High values of
m allow one to asymptotically approach the key rate obtained with ideal single-photon pulses. The fact that the key rates of these sifting-less protocols are higher compared to those of the aforementioned more standard protocols show that the latter are not optimal, since they do not extract all the available secret keys from the experimental correlations.
We show that replacing the usual sifting step of the standard quantum-key-distribution protocol BB84 by a one-way reverse reconciliation procedure increases its robustness against photon-number-splitting (PNS) attacks to the level of the SARG04 protocol while keeping the raw key-rate of BB84. This protocol, which uses the same state and detection than BB84, is the m=4 member of a protocol-family using m polarization states which we introduce here. We show that the robustness of these protocols against PNS attacks increases exponentially with m, and that the effective keyrate of optimized weak coherent pulses decreases with the transmission T like T^{1+1/(m-2)}.
We propose a modified version of the Bennett–Brassard 1984 quantum key distribution protocol intended to tolerate losses, certain forms of noise, and the so-called photon-number splitting attack. These are the issues facing the realization of practical quantum key distribution. The modified protocol is based on quantum non-demolition measurements for systems using weak coherent pulses. Our scheme ensures that emissions corresponding to zero photon pulses, multi-photon pulses, and detector double-clicks are discarded before sifting to improve sifting efficiency and increase the secret key rate. Moreover, we perform the finite key analysis to obtain the maximal achievable secret-key fraction and the corresponding optimal number of signals. Also, we compare our proposed protocol to the decoy-state quantum key distribution protocol. We observe that our proposed quantum key distribution scheme enables a more extended transmission distance than the decoy-state quantum key distribution protocol. Thus, this an advance in quantum communication because current limitations on quantum key distribution involve transmitting secret keys over more considerable distances in the presence of noise or losses in optical fibres.
For a start, Quantum Key Distribution offers security not depending on any fundamental assumption. However, actual realizations choose to use weak coherent pulses as photon sources, rather than the ideal single-photon state, which bears security weaknesses due to the emission of sporadic multi-photon states. These states can be used in Photon-Number Splitting (PNS) attacks, where the attacker intercepts and buffers photons of multi-photon pulses and forwards the rest, enabling partial recovery of the key without inducing detectable perturbations. This article presents a simulation-based approach to analyze PNS attacks with realistic channel conditions like losses, detector imperfections, and finite key lengths. The research also examines the performance of decoy-state countermeasures, that use variable-intensity pulses to statistically reveal eavesdropping and Simulation results confirm the dominant character of PNS on raw key rates for the no-countermeasure scenario and ensure optimal decoy-state schemes restore security by cutting single-photon contributions. Results establish that although WCP QKD is vulnerable to PNS attacks in theory, strict adoption of decoy-state protocols aided with monitoring and finite-key analysis can provide immunity against an adversary. The paper emphasizes the need for simulation-based, implementation-dependent security analysis in direction towards well-designed practical quantum cryptographic systems. [1] [2] [3] [4] [10] [8]
In phase-randomized weak coherent pulse (WCP) implementations of Quantum Key Distribution (QKD) BB84 protocol, the decoy method is often used to compensate BB84's vulnerability against photon number splitting (PNS) attacks. However, this typically introduces extra complexities and requirements on experimental devices. In this paper, we are therefore interested in phase-randomized WCP implementations without the decoy method. We examine the performance of three QKD protocols with different classical announcement structures, namely BB84, SARG04, and No Public Announcement of Basis (NPAB) BB84, using numerical security proof techniques. We compare secure key rates of the three protocols in asymptotic and finite-size regimes for lossy and noisy channels. The three protocols show different relative advantages depending on the channel behaviour. Canonical BB84 shows robustness against errors and depolarization, SARG04 demonstrates resilience against high loss channels, and NPAB BB84 shows potential advantages against physical misalignment between QKD devices.
For a start, Quantum Key Distribution offers security not depending on any fundamental assumption. However, actual realizations choose to use weak coherent pulses as photon sources, rather than the ideal single-photon state, which bears security weaknesses due to the emission of sporadic multi-photon states. These states can be used in Photon-Number Splitting (PNS) attacks, where the attacker intercepts and buffers photons of multi-photon pulses and forwards the rest, enabling partial recovery of the key without inducing detectable perturbations. This article presents a simulation-based approach to analyze PNS attacks with realistic channel conditions like losses, detector imperfections, and finite key lengths. The research also examines the performance of decoy-state countermeasures, that use variable-intensity pulses to statistically reveal eavesdropping and Simulation results confirm the dominant character of PNS on raw key rates for the no-countermeasure scenario and ensure optimal decoy-state schemes restore security by cutting single-photon contributions. Results establish that although WCP QKD is vulnerable to PNS attacks in theory, strict adoption of decoy-state protocols aided with monitoring and finite-key analysis can provide immunity against an adversary. The paper emphasizes the need for simulation-based, implementation-dependent security analysis in direction towards well-designed practical quantum cryptographic systems. [1] [2] [3] [4] [10] [8]