Security proof of practical quantum key distribution with detection-efficiency mismatch

• URL: http://arxiv.org/abs/2004.04383v2
• Date: Mon, 1 Feb 2021 15:19:40 GMT
• Title: Security proof of practical quantum key distribution with detection-efficiency mismatch
• Authors: Yanbao Zhang, Patrick J. Coles, Adam Winick, Jie Lin, and Norbert Lutkenhaus
• Abstract summary: We develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control.
• Score: 3.1988884923120313
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cut-off of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cut-off assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

Related papers

• Resultant: Incremental Effectiveness on Likelihood for Unsupervised Out-of-Distribution Detection [63.93728560200819]
  Unsupervised out-of-distribution (U-OOD) detection is to identify data samples with a detector trained solely on unlabeled in-distribution (ID) data. Recent studies have developed various detectors based on DGMs to move beyond likelihood. We apply two techniques for each direction, specifically post-hoc prior and dataset entropy-mutual calibration. Experimental results demonstrate that the Resultant could be a new state-of-the-art U-OOD detector.
  arXiv  Detail & Related papers  (2024-09-05T02:58:13Z)
• Phase error rate estimation in QKD with imperfect detectors [0.0]
  We present a finite-size security proof of the decoy-state BB84 QKD protocol against coherent attacks. We apply this result to the case of detectors with imperfectly characterized basis-efficiency mismatch.
  arXiv  Detail & Related papers  (2024-08-30T15:23:21Z)
• Differential-phase-shift QKD with practical Mach-Zehnder interferometer [0.0]
  We enhance the implementation security of the DPS protocol by incorporating a major imperfection in the measurement unit. Our numerical simulations demonstrate that even with fluctuations of $pm0.5%$ in the transmittance from the ideal value, the key rate degrades only by a factor of 0.57.
  arXiv  Detail & Related papers  (2024-05-20T03:38:02Z)
• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• Automated verification of countermeasure against detector-control attack in quantum key distribution [0.0]
  Attacks that control single-photon detectors in quantum key distribution are capable of eavesdropping the secret key. We report an automated testbench that checks the detector's vulnerabilities against these attacks.
  arXiv  Detail & Related papers  (2023-05-29T21:08:08Z)
• Countering detector manipulation attacks in quantum communication through detector self-testing [0.0]
  A vulnerability in single-photon detectors to blinding attacks has been one of the biggest concerns. We present a countermeasure based on self-testing of detectors to confirm their intended operation.
  arXiv  Detail & Related papers  (2022-04-13T03:36:54Z)
• Tracking the risk of a deployed model and detecting harmful distribution shifts [105.27463615756733]
  In practice, it may make sense to ignore benign shifts, under which the performance of a deployed model does not degrade substantially. We argue that a sensible method for firing off a warning has to both (a) detect harmful shifts while ignoring benign ones, and (b) allow continuous monitoring of model performance without increasing the false alarm rate.
  arXiv  Detail & Related papers  (2021-10-12T17:21:41Z)
• Adversarially Robust One-class Novelty Detection [83.1570537254877]
  We show that existing novelty detectors are susceptible to adversarial examples. We propose a defense strategy that manipulates the latent space of novelty detectors to improve the robustness against adversarial examples.
  arXiv  Detail & Related papers  (2021-08-25T10:41:29Z)
• Bandit Quickest Changepoint Detection [55.855465482260165]
  Continuous monitoring of every sensor can be expensive due to resource constraints. We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions. We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
  arXiv  Detail & Related papers  (2021-07-22T07:25:35Z)
• Probabilistic Ranking-Aware Ensembles for Enhanced Object Detections [50.096540945099704]
  We propose a novel ensemble called the Probabilistic Ranking Aware Ensemble (PRAE) that refines the confidence of bounding boxes from detectors. We also introduce a bandit approach to address the confidence imbalance problem caused by the need to deal with different numbers of boxes.
  arXiv  Detail & Related papers  (2021-05-07T09:37:06Z)
• Security of quantum key distribution with detection-efficiency mismatch in the multiphoton case [0.0]
  Current security of QKD with detection-efficiency mismatch rely on the assumption of the single-photon light source on the sender side or on the assumption of the single-photon input of the receiver side. Here we present a rigorous security proof without these assumptions and, thus, solve this important problem and prove the security of QKD with detection-efficiency mismatch against general attacks.
  arXiv  Detail & Related papers  (2020-04-16T17:55:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.