Scalable authentication and optimal flooding in a quantum network
Abstract
The global interest in quantum networks stems from the security guaranteed by the laws of physics. Deploying quantum networks means facing the challenges of scaling up the physical hardware and, more importantly, of scaling up all other network layers and optimally utilising network resources. Here we consider two related protocols, their experimental demonstrations on an 8-user quantum network test-bed, and discuss their usefulness with the aid of example use cases. First, an authentication transfer protocol to manage a fundamental limitation of quantum communication -- the need for a pre-shared key between every pair of users linked together on the quantum network. By temporarily trusting some intermediary nodes for a short period of time (<35 min in our network), we can generate and distribute these initial authentication keys with a very high level of security. Second, when end users quantify their trust in intermediary nodes, our flooding protocol can be used to improve both end-to-end communication speeds and increase security against malicious nodes.
Cite
@article{arxiv.2101.12225,
title = {Scalable authentication and optimal flooding in a quantum network},
author = {Naomi R. Solomons and Alasdair I. Fletcher and Djeylan Aktas and Natarajan Venkatachalam and Sören Wengerowsky and Martin Lončarić and Sebastian P. Neumann and Bo Liu and Željko Samec and Mario Stipčević and Rupert Ursin and Stefano Pirandola and John G. Rarity and Siddarth Koduru Joshi},
journal= {arXiv preprint arXiv:2101.12225},
year = {2023}
}
Comments
New version includes changes suggested by referees, and a modification to an incorrect calculation. Fig. 6 has been updated correspondingly. With thanks to Rui Wang for spotting the mistake, and the referees for detailed feedback