Papers
Topics
Authors
Recent
Search
2000 character limit reached

Entanglement-assisted authenticated BB84 protocol

Published 3 Jul 2024 in quant-ph | (2407.03119v3)

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 second, 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 implementation 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 \mathrm{s}$ and a 1 $\mathrm{km}$ distance between parties.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.