Entanglement-assisted authenticated BB84 protocol

• URL: http://arxiv.org/abs/2407.03119v4
• Date: Thu, 31 Jul 2025 09:05:18 GMT
• Title: Entanglement-assisted authenticated BB84 protocol
• Authors: Pol Julià Farré, Vladlen Galetsky, Soham Ghosh, Janis Nötzel, Christian Deppe,
• Abstract summary: We present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs.<n>In the absence of noise, we securely authenticate the BB84 QKD scheme under two assumptions.
• Score: 11.78752485991754
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs. In the absence of noise, we securely authenticate the well-known BB84 QKD scheme under two assumptions: first, adversaries cannot simultaneously access pre- shared and non-pre-shared secret classical information, and sec- ond, adversaries cannot simultaneously access pre-shared secret classical information and quantum memories held by legitimate parties. The main strength of this noiseless result is that access to all secretly pre-shared classical information is insufficient for breaching our scheme. Additionally, our protocol desirably allows for pre-shared secrecy reusage, leading to secret key growing. In order to address noise, we simulate a photonic imple- mentation of our scheme, together with a storage model that aims to replicate the performance of cavity-enhanced Atomic- Frequency Comb (AFC) memories. Two methods are used to distinguish authentic entities from forgery attempts: on the one hand, a statistical approach is used after calibration of its defining parameter {\mu}. Alternatively, a Deep Neural Network (DNN) is designed and trained to learn the underlying different structure of that input data coming from adversaries in comparison to that one coming from legitimate parties. Both methods achieve a correct classification rate larger than 0.80 for memory storage time of 150 {\mu}s and a 1 km distance between parties.

Related papers

• How to Verify that a Small Device is Quantum, Unconditionally [12.663567847694427]
  A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine.<n>We propose a new approach for constructing PoQ protocols where soundness holds unconditionally assuming a bound on the memory of the prover.
  arXiv  Detail & Related papers  (2025-05-29T20:09:22Z)
• Constant Overhead Entanglement Distillation via Scrambling [0.6249768559720122]
  High-fidelity quantum entanglement enables key quantum networking capabilities such as secure communication and distributed quantum computing. We introduce protocols that use quantum scrambling - the spreading of quantum information under chaotic dynamics. We show this protocol remains effective even with noisy quantum gates, making it suitable for near-term devices.
  arXiv  Detail & Related papers  (2025-02-13T16:46:15Z)
• Noise-Resilient Quantum Random Access Codes [0.0]
  In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. This technique can be extended to other applications in the so-called prepare-and-measure scenario.
  arXiv  Detail & Related papers  (2024-11-12T16:56:41Z)
• A Simple Method for Secret-Key Generation Between Mobile Users Across Networks [7.331799534004013]
  Two or more mobiles users can continuously superimpose sequences of bits chosen from different packets or files already exchanged and authenticated between themselves to continuously renew a secret key for continuous strengthening of their privacy and authentication. This accumulative, adaptable and additive (AAA) method is discussed in this paper.
  arXiv  Detail & Related papers  (2024-10-03T20:09:30Z)
• Perfect Counterfactuals in Imperfect Worlds: Modelling Noisy Implementation of Actions in Sequential Algorithmic Recourse [26.57812122315108]
  Algorithmic recourse provides actions to individuals who have been adversely affected by automated decision-making. Knowing the recourse does not guarantee that users would implement it perfectly, either due to environmental variability or personal choices. We propose the RObust SEquential (ROSE) recourse generator to output a sequence of steps that will lead to the desired outcome even under imperfect implementation.
  arXiv  Detail & Related papers  (2024-10-03T07:47:42Z)
• One-step Noisy Label Mitigation [86.57572253460125]
  Mitigating the detrimental effects of noisy labels on the training process has become increasingly critical. We propose One-step Anti-Noise (OSA), a model-agnostic noisy label mitigation paradigm. We empirically demonstrate the superiority of OSA, highlighting its enhanced training robustness, improved task transferability, ease of deployment, and reduced computational costs.
  arXiv  Detail & Related papers  (2024-10-02T18:42:56Z)
• Can Quantum Computers Do Nothing? [44.99833362998488]
  In idling qubits, information can 'leak' into neighbouring qubits, become non-locally distributed, and ultimately inaccessible. No information-theoretic protocol exists to quantify this information loss due to internal dynamics. We implement this protocol in over 3500 experiments carried out across 4 months on IBM's entire Falcon 5.11 series of processors.
  arXiv  Detail & Related papers  (2024-06-24T17:59:45Z)
• Hacking coherent-one-way quantum key distribution with present-day technology [0.0]
  Recent results have shown that the secret-key rate of coherent-one-way (COW) quantum key distribution (QKD) scales quadratically with the system's transmittance. This was proven by using a so-called zero-error attack, which relies on an unambiguous state discrimination (USD) measurement. Here, we investigate the feasibility and effectiveness of zero-error attacks against COW QKD with present-day technology.
  arXiv  Detail & Related papers  (2024-06-19T18:16:29Z)
• An Efficient Rehearsal Scheme for Catastrophic Forgetting Mitigation during Multi-stage Fine-tuning [55.467047686093025]
  A common approach to alleviate such forgetting is to rehearse samples from prior tasks during fine-tuning. We propose a sampling scheme, textttbf mix-cd, that prioritizes rehearsal of collateral damage'' samples. Our approach is computationally efficient, easy to implement, and outperforms several leading continual learning methods in compute-constrained settings.
  arXiv  Detail & Related papers  (2024-02-12T22:32:12Z)
• Efficient entanglement purification based on noise guessing decoding [0.0]
  We propose a novel bipartite entanglement purification protocol built upon hashing and guessing random additive noise decoding (GRAND) Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs.
  arXiv  Detail & Related papers  (2023-10-30T18:28:09Z)
• 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)
• Upper bounds on key rates in device-independent quantum key distribution based on convex-combination attacks [1.118478900782898]
  We present the convex-combination attack as an efficient, easy-to-use technique for upper-bounding DIQKD key rates. It allows verifying the accuracy of lower bounds on key rates for state-of-the-art protocols.
  arXiv  Detail & Related papers  (2022-06-13T15:27:48Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• 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)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Transferable Sparse Adversarial Attack [62.134905824604104]
  We introduce a generator architecture to alleviate the overfitting issue and thus efficiently craft transferable sparse adversarial examples. Our method achieves superior inference speed, 700$times$ faster than other optimization-based methods.
  arXiv  Detail & Related papers  (2021-05-31T06:44:58Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)
• Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Framework [60.981406394238434]
  We propose a general framework of adversarial certification with non-Gaussian noise and for more general types of attacks. Our proposed methods achieve better certification results than previous works and provide a new perspective on randomized smoothing certification.
  arXiv  Detail & Related papers  (2020-02-21T07:52: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.