Empirical Risk-aware Machine Learning on Trojan-Horse Detection for Trusted Quantum Key Distribution Networks

• URL: http://arxiv.org/abs/2401.14622v1
• Date: Fri, 26 Jan 2024 03:36:13 GMT
• Title: Empirical Risk-aware Machine Learning on Trojan-Horse Detection for Trusted Quantum Key Distribution Networks
• Authors: Hong-fu Chou, Thang X. Vu, Ilora Maity
• Abstract summary: Quantum key distribution (QKD) is a cryptographic technique that offers high levels of data security during transmission. The existence of a gap between theoretical concepts and practical implementation has raised concerns about the trustworthiness of QKD networks. We propose the implementation of risk-aware machine learning techniques that present risk analysis for Trojan-horse attacks over the time-variant quantum channel.
• Score: 10.045278273598598
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum key distribution (QKD) is a cryptographic technique that leverages principles of quantum mechanics to offer extremely high levels of data security during transmission. It is well acknowledged for its capacity to accomplish provable security. However, the existence of a gap between theoretical concepts and practical implementation has raised concerns about the trustworthiness of QKD networks. In order to mitigate this disparity, we propose the implementation of risk-aware machine learning techniques that present risk analysis for Trojan-horse attacks over the time-variant quantum channel. The trust condition presented in this study aims to evaluate the offline assessment of safety assurance by comparing the risk levels between the recommended safety borderline. This assessment is based on the risk analysis conducted. Furthermore, the proposed trustworthy QKD scenario demonstrates its numerical findings with the assistance of a state-of-the-art point-to-point QKD device, which operates over optical quantum channels spanning distances of 1m, 1km, and 30km. Based on the results from the experimental evaluation of a 30km optical connection, it can be concluded that the QKD device provided prior information to the proposed learner during the non-existence of Eve's attack. According to the optimal classifier, the defensive gate offered by our learner possesses the capability to identify any latent Eve attacks, hence effectively mitigating the risk of potential vulnerabilities. The Eve detection probability is provably bound for our trustworthy QKD scenario.

Related papers

• One-sided DI-QKD secure against coherent attacks over long distances [0.0]
  Device-Independent (DI) QKD protocols overcome this issue by making minimal device assumptions. We show that a one-sided DI QKD scheme with two measurements per party is secure against coherent attacks up to detection efficiencies greater than 50.1% specifically on the untrusted side. We also show that, by placing the source of states close to the untrusted side, our protocol is secure over distances comparable to standard QKD protocols.
  arXiv  Detail & Related papers  (2024-03-18T15:01:17Z)
• A Zero Trust Framework for Realization and Defense Against Generative AI Attacks in Power Grid [62.91192307098067]
  This paper proposes a novel zero trust framework for a power grid supply chain (PGSC) It facilitates early detection of potential GenAI-driven attack vectors, assessment of tail risk-based stability measures, and mitigation of such threats. Experimental results show that the proposed zero trust framework achieves an accuracy of 95.7% on attack vector generation, a risk measure of 9.61% for a 95% stable PGSC, and a 99% confidence in defense against GenAI-driven attack.
  arXiv  Detail & Related papers  (2024-03-11T02:47:21Z)
• Improved security bounds against the Trojan-Horse attack in decoy-state quantum key distribution [9.817648279997027]
  In a quantum Trojan-horse attack (THA), eavesdroppers learn encoded information by injecting bright light into encoded or decoded devices of quantum key distribution (QKD) systems. Here, we present a numerical method for achieving improved security bound for a decoy-state QKD system under THAs.
  arXiv  Detail & Related papers  (2023-12-24T04:07:34Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Finite-Key Analysis for Coherent One-Way Quantum Key Distribution [18.15943439545963]
  Coherent-one-way (COW) quantum key distribution (QKD) is a significant communication protocol that has been implemented experimentally and deployed in practical products. Existing security analyses of COW-QKD either provide a short transmission distance or lack immunity against coherent attacks in the finite-key regime. We present a tight finite-key framework for a variant of COW-QKD, which has been proven to extend the secure transmission distance in the case.
  arXiv  Detail & Related papers  (2023-09-28T03:32:06Z)
• Eavesdropper localization for quantum and classical channels via nonlinear scattering [58.720142291102135]
  Quantum key distribution (QKD) offers theoretical security based on the laws of physics. We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels. We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
  arXiv  Detail & Related papers  (2023-06-25T21:06:27Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• Experimental study of secure quantum key distribution with source and detection imperfections [4.193177700786187]
  The quantum key distribution (QKD) is a promising solution for future secure information and communication technology. This study reports a decoy-state BB84 QKD experiment that considers both source and detection imperfections.
  arXiv  Detail & Related papers  (2022-08-08T03:31:20Z)
• Experimental measurement-device-independent type quantum key distribution with flawed and correlated sources [14.143874849657317]
  Security of quantum key distribution (QKD) is threatened by discrepancies between realistic devices and theoretical assumptions. Here, we adopt the reference technique to prove security of an efficient four-phase measurement-device-independent QKD using laser pulses against potential source imperfections. In addition, we demonstrate the feasibility of our protocol through a proof-of-principle experimental implementation and achieve a secure key rate of 253 bps with a 20 dB channel loss.
  arXiv  Detail & Related papers  (2022-04-18T13:44:51Z)
• Certifiably Adversarially Robust Detection of Out-of-Distribution Data [111.67388500330273]
  We aim for certifiable worst case guarantees for OOD detection by enforcing low confidence at the OOD point. We show that non-trivial bounds on the confidence for OOD data generalizing beyond the OOD dataset seen at training time are possible.
  arXiv  Detail & Related papers  (2020-07-16T17:16:47Z)

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.