Quantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using a composite score, which is a weighted combination of betweenness centrality and eigenvector centrality to enable a secure and scalable TRN deployment. Simulation results on a reference topology show that our method covers 10.77% more shortest paths compared to traditional metrics like degree centrality, using the same number (around eight) of TRNs, making it suitable for TRN selection to maximize secure connectivity.
Quantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using a composite score, which is a weighted combination of betweenness centrality and eigenvector centrality to enable a secure and scalable TRN deployment. Simulation results on a reference topology show that our method covers 10.77% more shortest paths compared to traditional metrics like degree centrality, using the same number (around eight) of TRNs, making it suitable for TRN selection to maximize secure connectivity.
Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.
Quantum key distribution (QKD) enables information-theoretically secure communication but is limited by transmission distance and vulnerable to network disruptions. Trusted repeater nodes (TRNs) extend QKD transmission over large-scale optical networks, although their deployment introduces significant cost and planning complexity under heterogeneous traffic and disaster conditions. This paper proposes a traffic-aware and disaster-resilient mixed-integer linear programming (MILP) framework for TRN placement in QKD optical networks considering physical-layer feasibility (SKR/QBER), security-dependent transmission limits, and link-disjoint protection under multiple disaster scenarios. Evaluations on the NSFNET topology show that, compared with a protection-aware shortest-path greedy (SP-Greedy) baseline, the proposed framework achieves up to 70-80% reduction in TRN deployment and more than 50% cost savings while maintaining survivability under severe multi-link failures. Results further demonstrate efficient traffic-aware scalability through adaptive resource allocation, providing a practical and physically-grounded solution for resilient QKD-enabled optical networks.
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.
In this paper we explore how recent technologies can improve the security of optical networks. In particular, we study how to use quantum key distribution (QKD) in common optical network infrastructures and propose a method to overcome its distance limitations. QKD is the first technology offering information theoretic secret-key distribution that relies only on the fundamental principles of quantum physics. Point-to-point QKD devices have reached a mature industrial state; however, these devices are severely limited in distance, since signals at the quantum level (e.g., single photons) are highly affected by the losses in the communication channel and intermediate devices. To overcome this limitation, intermediate nodes (i.e., repeaters) are used. Both quantum-regime and trusted, classical repeaters have been proposed in the QKD literature, but only the latter can be implemented in practice. As a novelty, we propose here a new QKD network model based on the use of not fully trusted intermediate nodes, referred to as weakly trusted repeaters. This approach forces the attacker to simultaneously break several paths to get access to the exchanged key, thus improving significantly the security of the network. We formalize the model using network codes and provide real scenarios that allow users to exchange secure keys over metropolitan optical networks using only passive components. Moreover, the theoretical framework allows one to extend these scenarios not only to accommodate more complex trust constraints, but also to consider robustness and resiliency constraints on the network.
Quantum communication infrastructure (QCI) is gradually becoming a favorable choice for transmitting secure data across the globe. Network operators often prefer to utilize the existing network infrastructure to reduce network setup costs to build a QCI. This implies transforming traditional network nodes to quantum nodes (QNs) by equipping them with quantum processors. Trusted repeater nodes (TRNs) are used to connect distant QNs. However, the network infrastructure cost increases with the number of TRNs due to the usage of dark fibers. Therefore, it is challenging for the network planning to build a QCI that connects all QNs with a minimum number of TRNs to reduce the infrastructure cost. In this work, we construct a minimum cost spanning tree for the QCI to connect all QNs with a minimum number of links and TRNs. The proposed approach considers node distance and attenuation cost of the physical connections. Compared to the traditional spanning tree approach, our proposed approach reduces the cost of QCI deployment by 10.90%.
Quantum key distribution (QKD) revolutionizes secure communication, offering unbreakable cryptography against quantum computers’ rising computational power. This paper explores the placement of trusted nodes to enhance the efficiency of quantum communication networks. Two practical scenarios are investigated: the multi-band (MB) setting, utilizing different wavelength bands for QKD and classical systems, and the multifiber (MF) solution, employing separate fibers for QKD and classical communication. The study optimizes secret key rate (SKR) per quantum transmitter and receiver (Q-TRx) in metro quantum-optical networks. A heuristic algorithm, considering noise sources and fiber attenuation, is proposed for routing, modulation, spectrum, and time assignment. The simulations conducted on various network topologies reveal optimal QKD trusted node distances (QTND) and wavelengths place. The simulation results indicate that the optimal QTND value for the MB-scenario and MF-scenario is 20 and 25 km, respectively. Compared to scenarios without QKD trusted node placement along the 40 km link, both the MB-scenario and MF-scenario exhibit 40% and 15% improvements, respectively, in SKR/QTRx relative to their optimal QTND values.