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.
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.
Advancements in practical single-photon sources (SPS) exhibiting high brightness and low g(2)(0) have garnered significant interest for their application in quantum key distribution (QKD). To assess their QKD performance, it is essential to compare them with the widely employed weak coherent pulses (WCPs) in the decoy state method. In this work, we analyze the non-decoy efficient BB84 protocol for an SPS, partially characterising its photon statistics by its g(2)(0) and mean photon number. We compare it to the 2-decoy efficient BB84 with WCPs within the finite-key analysis framework while optimizing the parameters of both protocols. Our findings indicate that the non-decoy SPS with a mean photon number of ⟨n⟩=0.5 and g(2)(0)=3.6% can enhance the secure key generation over the 2-decoy WCP for block sizes under 4.66⋅109 sent signals (29 seconds of acquisition time) at a channel loss of 10 dB (52.5 km of optical fibre). Additionally, we demonstrate an increase in the maximum tolerable channel loss for SPSs with mean photon number ⟨n⟩≥0.0142 at block sizes below 108 sent signals (0.62 seconds of acquisition time). These results suggest that SPSs hold potential for key rate enhancement in short-range QKD networks, though further research is required to evaluate their key generation capabilities when integrated into the decoy method.
Quantum key distribution (QKD) allows two distant parties to share a secret key and realizes a communication with information-theoretic security by combining it with one-time-pad encryption.Since the Bennett-Brassard 1984 (BB84) protocol was proposed, a large number of researches on QKD have been conducted from both aspects of theory and implementations.For implementations of QKD, weak coherent pulses (WCP) are heavily used as optical signals because they are easily generated by typical lasers and attenuators.The security for QKD with WCP has been also studied along the development of the implementations.In this thesis, the security analysis of the QKD with WCP is considered and further developed from two aspects.First, the security of the differential-quadrature-phase-shift (DQPS) protocol is proved.The DQPS protocol has essentially the same set up as the phase-encoding BB84 (PE-BB84) protocol, which is one of the most frequently demonstrated protocols.Since the known proof techniques for the BB84 protocol is not directly applicable, a modified approach is developed which is suitable for the DQPS protocol.As a result, the advantage of the DQPS protocol in the key generation rate over the PE-BB84 protocol is shown in the asymptotic limit where the size of communication data is assumed to be infinite.Second, a new method for security analysis with finite-key size is proposed as a suitable method for QKD protocols using WCP.Differently from the current method based on simple random sampling, the proposed method relies on Bernoulli sampling, which is associated with binomial distribution.The security of the BB84 protocol is proved by using the Bernoulli-sampling method, enabling a simpler analysis with a smaller number of parameters to be estimated compared to the method with simple random sampling.The required number of detected signals to generate a secret key is shown to be smaller than 10 4 , which is drastic improvement from the number ∼ 10 7 obtained in the previous result.The proposed method is also applied to the DQPS protocol, and its advantage over the PE-BB84 protocol is certified even in the finite-key regime.i
We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
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 and SARG04 protocols and they differ only in classical communications and data processing. We compute their total keyrate as function of the channel transmission T, using general information theoretical arguments and we show that they have a higher keyrate than the more standard protocols, both for fixed and optimized average photon number of the WCPs. When no decoy-state protocols (DSPs) are applied, the scaling of the keyrate with transmission is improved from T2 for BB84 to T^(1+1/(m-2)). If a DSP is applied, we show how the keyrates scale linearly with T, with an improvement of the prefactor by 75.96 % for m=4. High values of $ m $ allow to asymptotically approach the keyrate obtained with ideal single photon pulses. The fact that the keyrates 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 key from the experimental correlations.
Abstract The SARG04 quantum key distribution protocol can offer greater robustness against photon number splitting attacks than the BB84 protocol that is implemented with weak pulses. In this paper, we propose a tight key analysis for the SARG04 protocol, by considering the one-decoy method and investigating its performance under the influence of a detector afterpulse. Our results demonstrate that an increase in block size leads to a slight increase in both the secure key rate and the maximum transmission distance. Importantly, the detector afterpulse plays a crucial role in practical applications and has a more pronounced effect on the SARG04 protocol compared to the BB84 protocol.
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]