Deep-learning-based continuous attacks on quantum key distribution protocols

• URL: http://arxiv.org/abs/2408.12571v3
• Date: Tue, 01 Jul 2025 15:02:55 GMT
• Title: Deep-learning-based continuous attacks on quantum key distribution protocols
• Authors: Théo Lejeune, François Damanet,
• Abstract summary: In this paper, we design a new individual attack scheme that exploits continuous measurement together with the powerful pattern recognition capacities of deep recurrent neural networks.<n>Our attack increases only slightly the Quantum Bit Error Rate (QBER) of a noisy channel and allows the spy to infer a significant part of the sifted key.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The most important characteristic of a Quantum Key Distribution (QKD) protocol is its security against third-party attacks, and the potential countermeasures available. While new types of attacks are regularly developed in the literature, they rarely involve the use of weak continuous measurement and more specifically machine learning to infer the qubit states. In this paper, we design a new individual attack scheme called \textit{Deep-learning-based continuous attack} (DLCA) that exploits continuous measurement together with the powerful pattern recognition capacities of deep recurrent neural networks. We show that, when applied to the BB84 protocol, our attack increases only slightly the Quantum Bit Error Rate (QBER) of a noisy channel and allows the spy to infer a significant part of the sifted key. In addition, we show it yields similar performances in terms of information gain when compared to an optimal individual attack, namely the phase-covariant quantum cloner. Our individual attack scheme demonstrates deep-learning-enhanced quantum state tomography applied to QKD and could be generalized in many different ways,

Related papers

• Cybersecurity of Quantum Key Distribution Implementations [3.1498833540989413]
  We present new analysis tools and methodologies for quantum cybersecurity.<n>We adapt the concepts of vulnerabilities, attack surfaces, and exploits from classical cybersecurity to QKD implementation attacks.<n>This work begins to bridge the gap between current analysis methods for experimental attacks on QKD implementations and the decades-long research in the field of classical cybersecurity.
  arXiv  Detail & Related papers  (2025-08-06T17:37:04Z)
• Breaking Quantum Key Distributions under Quantum Switch-Based Attack [0.0]
  We introduce a new attack scenario where an eavesdropper, Eve, exploits a quantum switch using the indefinite causal order to intercept and manipulate quantum communication channel. Our results highlight a previously overlooked vulnerability, emphasizing the need for countermeasures against quantum-controlled adversarial strategies.
  arXiv  Detail & Related papers  (2025-02-10T18:56:47Z)
• Composable free-space continuous-variable quantum key distribution using discrete modulation [3.864405940022529]
  Continuous-variable (CV) quantum key distribution (QKD) allows for quantum secure communication. We present a CV QKD system using discrete modulation that is especially designed for urban atmospheric channels. This will allow to expand CV QKD networks beyond the existing fiber backbone.
  arXiv  Detail & Related papers  (2024-10-16T18:02:53Z)
• Increasing Interference Detection in Quantum Cryptography using the Quantum Fourier Transform [0.0]
  We present two quantum cryptographic protocols leveraging the quantum Fourier transform (QFT) The foremost of these protocols is a novel QKD method that leverages this effectiveness of the QFT. We additionally show how existing quantum encryption methods can be augmented with a QFT-based approach to improve eavesdropping detection.
  arXiv  Detail & Related papers  (2024-04-18T21:04:03Z)
• A Secure Quantum Key Distribution Protocol Using Two-Particle Transmission [0.0]
  Unextendible Product Bases (UPBs) hold promise in quantum cryptography due to their inherent indistinguishability. This work introduces a protocol utilizing UPBs to establish quantum keys between distant parties.
  arXiv  Detail & Related papers  (2024-03-20T14:33:17Z)
• FreqFed: A Frequency Analysis-Based Approach for Mitigating Poisoning Attacks in Federated Learning [98.43475653490219]
  Federated learning (FL) is susceptible to poisoning attacks. FreqFed is a novel aggregation mechanism that transforms the model updates into the frequency domain. We demonstrate that FreqFed can mitigate poisoning attacks effectively with a negligible impact on the utility of the aggregated model.
  arXiv  Detail & Related papers  (2023-12-07T16:56:24Z)
• 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)
• Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks [0.0]
  We implement simulations of our attacks for symmetric-key protocols such as S-DES, S-AES and Blowfish. We show how our attack allows a classical simulation of a small 8-qubit quantum computer to find the secret key of one 32-bit Blowfish instance with 24 times fewer number of iterations than a brute-force attack. Further applications beyond symmetric-key cryptography are also discussed, including asymmetric-key protocols and hash functions.
  arXiv  Detail & Related papers  (2023-11-06T09:46:16Z)
• Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks [58.195261590442406]
  We study the problem of training and certifying adversarially robust quantized neural networks (QNNs) Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization. We present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs.
  arXiv  Detail & Related papers  (2022-11-29T13:32:38Z)
• Versatile Weight Attack via Flipping Limited Bits [68.45224286690932]
  We study a novel attack paradigm, which modifies model parameters in the deployment stage. Considering the effectiveness and stealthiness goals, we provide a general formulation to perform the bit-flip based weight attack. We present two cases of the general formulation with different malicious purposes, i.e., single sample attack (SSA) and triggered samples attack (TSA)
  arXiv  Detail & Related papers  (2022-07-25T03:24:58Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Improved Semi-Quantum Key Distribution with Two Almost-Classical Users [1.827510863075184]
  We revisit a mediated semi-quantum key distribution protocol introduced by Massa et al. We show how this protocol may be extended to improve its efficiency and also its noise tolerance. We evaluate the protocol's performance in a variety of lossy and noisy channels.
  arXiv  Detail & Related papers  (2022-03-20T14:41:14Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Learning and Certification under Instance-targeted Poisoning [49.55596073963654]
  We study PAC learnability and certification under instance-targeted poisoning attacks. We show that when the budget of the adversary scales sublinearly with the sample complexity, PAC learnability and certification are achievable. We empirically study the robustness of K nearest neighbour, logistic regression, multi-layer perceptron, and convolutional neural network on real data sets.
  arXiv  Detail & Related papers  (2021-05-18T17:48:15Z)
• Quantum hacking perceiving for quantum key distribution using temporal ghost imaging [7.7270491671042425]
  Quantum key distribution (QKD) can generate secure key bits between remote users with quantum mechanics. The most insidious attacks, known as quantum hacking, are the ones with no significant discrepancy of the measurement results. We propose the method exploring temporal ghost imaging (TGI) scheme to perceive quantum hacking with temporal fingerprints.
  arXiv  Detail & Related papers  (2020-12-28T02:21:09Z)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28:14Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)
• Block Switching: A Stochastic Approach for Deep Learning Security [75.92824098268471]
  Recent study of adversarial attacks has revealed the vulnerability of modern deep learning models. In this paper, we introduce Block Switching (BS), a defense strategy against adversarial attacks based on onity.
  arXiv  Detail & Related papers  (2020-02-18T23:14:25Z)

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.