Secret-Key Provisioning With Collaborative Routing in Partially-Trusted-Relay-based Quantum-Key-Distribution-Secured Optical Networks

Abstract

Quantum Key Distribution (QKD) is a promising technology that provides proven unconditional security based on fundamentals of quantum physics, especially for point-to-point communications. It could be applied in large-scale optical networks for long-distance key provisioning mainly by three relaying methods: quantum-repeater-based QKD, trusted-relay-based QKD, and measurement-device-independent QKD (MDI-QKD). However, quantum-repeater-based QKD is still under study because of the immature technologies such as the preliminary quantum memory. The trusted-relay-based QKD is vulnerable since insecurity of non-ideal single-photon sources and detectors cannot be ignored in practical applications. On the other hand, for MDI-QKD, there exists a limitation on its key rate under long-distance communications. According to these limitations, embedding protocols like MDI-QKD into the existing trusted-relay-based QKD secured optical networks (QKD-ON) with usage of untrusted relays is a promising key-provisioning scheme. In this paper, we study such partially-trusted relay scenarios and focus on its routing of keys in different kinds of typical network topologies. A partially-trusted-relay-based QKD method is described, which can allow a pair of optical nodes sharing secret keys under the coexistence of trusted relays and untrusted relays. The secret-key provisioning with collaborative routing ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SKP-CR</i> ) algorithm is proposed to search for the optimal key-relay routing path. We perform the simulations with different proportion of trusted relays versus untrusted relays, initial secret keys in the quantum key pools (QKPs), and traffic load. The simulations verify that the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">SKP-CR</i> algorithm can significantly outperform the conventional trusted-relay-based scheme in terms of key-distribution success rate with an improvement of up to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">62%</i> with a mesh topology.