arXiv:2404.17420 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Finite Key Security of Simplified Trusted Node Networks

Walter O. Krawec, Bing Wang, Ryan Brown

Published Sep 15, 2024• 2 citations

Abstract

Simplified trusted nodes (STNs) are a form of trusted node for quantum key distribution (QKD) networks which do not require running a full QKD stack every instance (i.e., they do not need to run error correction and privacy amplification each session). Such systems hold the advantage that they may be implemented with weaker computational abilities, than regular TNs, while still keeping up with key generation rate demands. The downside is that noise tolerance is lower. However, to get a better understanding of their suitability in various scenarios, one requires practical, finite-key security bounds for STN networks. So far, only theoretical asymptotic bounds are known. In this work we derive a new proof of security for STN chains in the finite key setting. We also derive a novel cost function allowing us to evaluate when STNs would be beneficial from a computational cost perspective, compared with regular TN networks.

DOI: 10.1109/qce60285.2024.00207

Related papers

The Security of Simplified Trusted Relays

William Stacey

This thesis examines the security of performing quantum key distribution (QKD) with a simplified trusted relay (STR). The protocol carries out the quantum phase of a conventional trusted relay, however, reduces the required complexity of the nodes by carrying out an altered classical phase. Rather than announcing the parity of the final keys, the simplified trusted relay announces the parity of the keys before error correction and privacy amplification. As a result, the majority of the post-processing is left to the end users. \n \nSpecifically, we examine the security of an STR protocol which carries out the quantum phase of the BB84 protocol. Through two different methods, we derive qubit key rates. For the first method, we require that the basis choice is equally weighted. Furthermore, we limit the relay to a single node. This proof has the benefit that it easily generalizes to an alternate protocol where a node may generate error correcting information. In the second security proof, we derive a key rate for an arbitrary number of nodes with an arbitrary basis weighting. \n \nWe further extend our analysis to realistic scenarios in which the legitimate parties use weak coherent pulses to transmit signal states over a lossy channel. We provide a framework for generalizing decoy state methods to STR protocols.

Aug 27, 20140 citations

Post-Quantum Cryptographically-Secured Trusted Node for Quantum Key Distribution in a Deployed Network

Heming Huang, Yves Jaouën, Nicolas Fabre +13 more

Objective:Reduce the security risks associated with the usage of trusted nodes in a QKD network.Conclusion:The transported QKD key is secure agains honest-curious nodes at a lower key-rate cost than state-of-the-art.

Sep 2, 20240 citations

Security of quantum key distribution using a simplified trusted relay

William Stacey, Razieh Annabestani, Xiongfeng Ma +1 more

We propose a QKD protocol for trusted node relays. Our protocol shifts the communication and computational weight of classical postprocessing to the end users by reassigning the roles of error correction and privacy amplification, while leaving the exchange of quantum signals untouched. We perform a security analysis for this protocol based on the Bennett-Brassard 1984 protocol on the level of infinite key formulas, taking into account weak coherent implementations involving decoy analysis.

arXiv:1408.4426Physical Review AJan 28, 201526 citations

Distance-Security Tradeoffs for Repeaterless End-to-End Quantum Key Distribution Networks

Sumit Chaudhary, Davide Li Calsi, JinHyeock Choi +2 more

Quantum Key Distribution (QKD) offers provably secure, information-theoretic key exchange, but in long-distance scenarios without quantum repeaters, Trusted Nodes (TNs) are commonly employed despite introducing critical security risks. We propose a redundant key management method for QKD network that combines Twin Field QKD (TF-QKD) (or Measurement-Device Independent (MDI)-QKD) with a novel key-routing scheme to eliminate the need for truly trusted TNs. Quantum measurements are handled entirely within the network, minimizing end-user hardware requirements. Multiple QKD links connect intermediate nodes such that a successful attack requires the collusion of multiple adversarial nodes, greatly enhancing security over the traditional TN model. In this contribution, we discuss the tradeoff between security, key rates, and distances supported by the new method. Our analysis reveals that the improved redundant key management system may enable true end-to-end connectivity over several thousand kilometers while maintaining high security standards.

IEEE Internet ComputingMar 1, 20260 citations

Routing With Minimum Activated Trusted Nodes in Quantum Key Distribution Networks for Secure Communications

Peng‐Yong Kong

Cyber–physical systems rely heavily on communication networks for remote monitoring and control. It is crucial to protect the communication networks from cyberattacks because an attack on the physical subsystem can be indirectly launched from a compromised cyber subsystem. Since remote control devices have limited computational power, we ensure communication confidentiality and integrity using one-time-pad (OTP) symmetric cryptography, which despite simple is unconditionally secure. To provide OTP with secret keys, we use quantum key distribution (QKD) across multiple hops, where each intermediate relay is a trusted node. These nodes can be weak points in cyberattacks. Hence, this article focuses on routing in multihop QKD networks that reduces the required number of trusted nodes. We formulate and solve an optimization problem to find the set of QKD routes that minimizes the number of activated trusted nodes while satisfying the secret key rate requirements of multiple communicating pairs. Extensive evaluation results confirm that the proposed scheme can indeed has fewer activated trusted nodes as compared to a benchmark scheme that finds only the shortest paths for communicating pairs.

IEEE Internet of Things JournalJan 3, 202410 citations

Quantum Key Distribution with Efficient Post-Quantum Cryptography-Secured Trusted Node on a Quantum Network

Yoann Piétri, Pierre-Enguerrand Verdier, Baptiste Lacour +13 more

Quantum Key Distribution (QKD) enables two distant users to exchange a secret key with information-theoretic security, based on the fundamental laws of quantum physics. While it is arguably the most mature application of quantum cryptography, it has inherent limitations in the achievable distance and the scalability to large-scale infrastructures. While the applicability of QKD can be readily increased with the use of intermediary trusted nodes, this adds additional privacy requirements on third parties. In this work, we present an efficient scheme leveraging a trusted node with lower privacy requirements thanks to the use of post-quantum cryptographic techniques, and implement it on a deployed fiber optic quantum communication network in the Paris area.

arXiv:2504.01454Apr 2, 20250 citations