An Efficient Routing Protocol for Quantum Key Distribution Networks

The security of quantum cryptography relies on the foundations of quantum mechanics, in contrast to traditional public key cryptography which relies on the computational difficulty of certain mathematical functions, and cannot provide any indication of eavesdropping or guarantee of key security. The proposal present in this work develops a quantum key distribution model to safeguard security in large networks, in the directions of classical cryptography and quantum cryptography. Two three-party Quantum key distribution are used in this model, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination. The performance of Quantum Key Distribution (QKD) systems have notably progressed since the early experimental demonstrations. The current evolutions in QKD research indicate that the pace of this progression is very likely to be maintained, if not increased, in the future years. In parallel to these improvements of QKD techniques, commercial products are also being developed, making QKD deployment a feasible alternative for securing real data networks. Deployment of a real QKD network is however far from being straightforward. It requires development of a network architecture connecting multiple users that may possibly be very far away from each other. Considering the fact that the existing QKD links are only point-to-point, and intrinsically limited in distance, deployment of a practical QKD network structure is a nontrivial problem. The proposed work describes the proposed architecture for a QKD network specify the requirements relevant to the network design, protocols, and services. The objective of this specification is to define the major components and their main features The proposal provides security against such attacks as man-in-the-middle, eavesdropping and replay. It also improves the efficiency of the quantum key distribution which contains the fewest number of communication rounds among existing Quantum key distributions. In this model two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this proposed model provides a primitive called the Unbiased-Chosen Basis (UCB) assumption with the quantum key in angular positions.

As an important support for quantum communication, quantum key distribution (QKD) networks have achieved a relatively mature level of development, and they face higher requirements for multi-user end-to-end networking capabilities. Thus, QKD networks need an effective management plane to control and coordinate with the QKD resources. As a promising technology, software defined networking (SDN) can separate the control and management of QKD networks from the actual forwarding of the quantum keys. This paper systematically introduces QKD networks enabled by SDN, by elaborating on its overall architecture, related interfaces, and protocols. Then, three-use cases are provided as important paradigms with their corresponding schemes and simulation performances.

We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote nodes, i.e., not directly connected by a QKD link, through multiple non-overlapping paths. This approach focuses on the security of a QKD network by minimizing potential vulnerabilities associated with individual trusted nodes. The algorithm ensures a balanced allocation of the workload across the QKD network links, while aiming for the target key generation rate between directly connected and remote nodes. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes. The testing demonstrates the ability of the algorithm to distribute secure keys among the nodes of the network in an all-to-all manner, ensuring that the information-theoretic security of the keys between remote nodes is maintained even when one of the trusted nodes is compromised. These results highlight the potential of the algorithm to improve the performance of QKD networks.

Large-scale quantum networks with thousands of nodes require scalable network protocols and physical hardware to realize. In this paper, we introduce packet switching as a paradigm for quantum data transmission in both future and near-term quantum networks. We propose a classical-quantum data frame structure and explore methods of frame generation and processing. Further, we present conceptual designs for a quantum reconfigurable optical add-drop multiplexer to realize the proposed transmission scheme. Packet switching allows for a universal design for a next-generation Internet where classical and quantum data share the same network protocols and infrastructure. In this quantum networking paradigm, entanglement distribution, as with quantum key distribution, is an application built on top of the quantum network rather than as a network designed especially for those purposes. For analysis of the network model, we simulate the feasibility of quantum packet switching for some preliminary models of quantum key and entanglement distribution. Finally, we discuss how our model can be integrated with other network models toward a realization of the quantum Internet.

<sec>Quantum key distribution (QKD) is a pivotal technology in the field of secure communication by using the principles of quantum mechanics to implement theoretically unbreakable encryption. However, QKD faces significant challenges in achieving large-scale deployment. The primary hurdle lies in the scarcity of quantum resources, especially entangled photon pairs, which are fundamental to protocols such as Ekert91. In traditional QKD implementations, only a small potion of the generated entanglement pairs contribute to generating the original key, resulting in lower efficiency and resource waste. Resolving this limitation is crucial to the advancement and scalability of QKD networks.</sec><sec>This paper introduces an innovative approach to QKD by integrating the multiscale entanglement renormalization ansatz (MERA), a technique which is originally developed for many-body quantum systems. By utilizing MERA’s hierarchical structure, the proposed method not only improves the efficiency of entanglement distribution but also reduces the consumption of quantum resources. Specifically, MERA compresses many-body quantum states into lower-dimensional representations, allowing for the transmission and storage of entanglement in a more efficient manner. This compression significantly reduces the number of qubits required, optimizing both entanglement utilization and storage capacity in quantum networks.</sec><sec>To evaluate the performance of this method, we conduct simulations under standardized conditions. In the simulation, a 1024-bit encryption request, an 8% error rate, an average path length of 4 hops in the quantum network, and a 95% success rate for link entanglement generation and entanglement swapping operations are assumed. These parameters reflect the real physical conditions in contemporary QKD networks. The results demonstrate that compared with traditional QKD protocols, the MERA-based approach saves 124151 entangled pairs, which is impressive. This significant reduction in resource consumption indicates the potential application of MERA in improving the efficiency of QKD systems without sacrificing security. Importantly, the security of the key exchange process remains intact, for the method inherently adheres to the principles of quantum mechanics, particularly the no-cloning theorem and the use of randomness in the decompression layer.</sec><sec>Some conclusions can be drawn below. The MERA not only enhances the scalability of QKD by optimizing quantum resource allocation, but also maintains the necessary security guarantees for practical cryptographic applications. By integrating MERA into existing QKD frameworks, we can significantly reduce the resource overhead and make large-scale, secure quantum communication more feasible. These findings contribute a new dimension to the field of quantum cryptography, indicating that advanced quantum many-body techniques like MERA have the potential to unlock the full potential of quantum networks in real world.</sec>

The security of quantum cryptography protocols after a quantum key distribution (QKD) session is formulated in terms of proximity between two situations: quantum states corresponding to real and ideal situations after QKD. The measure of proximity is the trace distance. It is more reasonable to formulate security directly in terms of the smallness of probability of successive guessing of keys by an eavesdropper after an arbitrary number of QKD sessions. There is a fundamental question the answer to which is a priori very unobvious: Is the security criterion in terms of the proximity of the real and ideal situations for a single QKD session sufficient to guarantee the security of keys in terms of the smallness of probability of guessing of keys by the eavesdropper after an arbitrary number of QKD sessions? It has been shown that the answer to this question is positive.

Physical implementations of quantum key distribution (QKD) protocols, like the Bennett-Brassard (BB84), are forced to use attenuated coherent quantum states, because the sources of single photon states are not functional yet for QKD applications. However, when using attenuated coherent states, the relatively high rate of multi-photonic pulses introduces vulnerabilities that can be exploited by the photon number splitting (PNS) attack to brake the quantum key. Some QKD protocols have been developed to be resistant to the PNS attack, like the decoy method, but those define a single photonic gain in the quantum channel. To overcome this limitation, we have developed a new QKD protocol, called ack-QKD, which is resistant to the PNS attack. Even more, it uses attenuated quantum states, but defines two interleaved photonic quantum flows to detect the eavesdropper activity by means of the quantum photonic error gain (QPEG) or the quantum bit error rate (QBER). The physical implementation of the ack-QKD is similar to the well-known BB84 protocol.

The aim of this chapter is to emphasize the multidisciplinary nature of the research in the field of Quantum Key Distribution Networks (QKDNs). Such networks consist of a number of nodes that can perform security protocols protected by some basic laws of physics. The operation of QKDNs mainly requires the integration of Quantum Key Distribution (QKD) protocols with the already-existing network security infrastructures. The authors report on the current state-of-the-art in the field and give some recommendations for future research. As computer simulation can be very useful in dealing with advanced technology subjects like QKDNs, they outline a simple and efficient modeling and simulation approach for various QKDN configurations. Then, the issue of unconditionally secure authentication of the public channel in QKD is considered. This issue is of crucial importance from both theoretical and practical sides. In this context, the proposed hybrid authentication strategy is reviewed and an authenticated version of the Bennett-Brassard-84 (BB84) QKD protocol based on this strategy is described. Next, a novel extension of the SSL protocol for QKDN settings, which the authors call Quantum SSL (QSSL), is explained. Finally, the chapter is concluded.

There has been a dramatic increase in the number of Internet of Things (IoT) devices and their applications. Furthermore, there is a growing impetus to integrate IoT networks on a global scale, using satellites to expand the range of IoT connectivity into geographically remote areas. Ensuring the security of satellite backhaul for IoT networks is thus of paramount importance. The steady advance of quantum computing in recent years threatens to nullify classical cryptographic approaches based on assumptions of computational hardness, motivating the need for post-quantum cryptography. Quantum computing algorithms have been developed that, once a quantum computer of sufficient scale is realised, will be able to break classical cryptosystems efficiently (at polynomial-time complexity). A promising method of securing information against this threat at the physical layer has emerged in the form of quantum key distribution (QKD). QKD exploits the fundamental physical properties of light to guarantee information-theoretic security. Research into the application and standardisation of QKD to secure satellite backhaul, however, is still in its infancy. This paper presents a brief overview of the theoretical basis for QKD, whilst also providing a survey of contemporary QKD protocols. It evaluates the ability of these protocols to secure satellite backhaul in the context of a typical satellite-IoT network architecture. Furthermore, it highlights the vulnerabilities, as well as the technical challenges associated with this endeavour. Finally, it proposes directions for future research and development into protocols and standardisation for the satellite-integrated IoT domain. Several challenges must be overcome before QKD can evolve into a global-scale solution for securing satellite-IoT. Secret key generation rate remains very low in practical demonstrations of trusted-relay QKD satellite architectures. Further research is needed to overcome or mitigate the fundamental rate-distance trade-off before satellite QKD can be considered practicable in an IoT application. Alternatives that do not rely on trusted nodes are contingent on nascent technologies such as quantum repeaters and quantum memory. Whilst in theory QKD provides perfect information-theoretic security, it remains vulnerable to attacks that exploit imperfections in real-world equipment. Further effort is needed to develop QKD protocols that can safeguard against the aforementioned challenges.

Genetic Algorithm (GA) may be used to analyses the security of Quantum Key Distribution (QKD) protocols. It evaluates on multiple QKD protocol such as, comparing it to known bounds and also discovering new results. It also shows how it can be used to analyze the security of complicated QKD protocols requiring the adversary to interact with the users. It may also be used to detect security flaws in protocols. This algorithm can be a useful tool in QKD research and design. The genetic algorithm can be used to analyses the security of the quantum cryptographic protocols. This paper handles the different types of attacks like photon loss and multi-photon attacks. Analysis can be done on these protocols namely BB84, B92, SARGO4, Semi-Quantum protocol, Mediated Semi-Quantum protocols. The attacks can be handled by using genetic algorithm is the main intention of this work.

Quantum Key Distribution (QKD) networks guarantee information-theoretical security of exchanged keys, but key rates are still limited. This makes efficient and adaptive routing a critical challenge, especially in meshed topologies without quantum repeaters. Conventional shortest path routing approaches struggle to cope with dynamic key store filling levels and changes in network topologies, which leads to load imbalance and blocked connections. In this work, we propose an adaptive routing framework based on Deep Reinforcement Learning (DRL) for hop-wise end-to-end routing in unknown meshed QKD networks. The agent leverages Graph Attention Networks (GATs) to process the network states of varying topologies, enabling generalization across previously unseen meshed networks without topology-specific retraining. The agent is trained on random graphs with 10 to 20 nodes and learns a routing policy that explicitly balances key consumption across the network by utilizing a reward function that is based on the entropy of key store filling levels. We evaluate the proposed approach on the 14-node NSFNET topology under time-varying traffic demands. Simulation results demonstrate that the DRL-based routing significantly outperforms hop-based and weighted shortest path benchmarks, achieving up to a 18.7% increase in mean key store filling levels while completely avoiding key store depletion. These results highlight the potential of graph-based DRL methods for scalable, adaptive, and resource-efficient routing in future QKD networks.

Quantum cryptography and especially quantum key distribution (QKD) is a technique that allocates secure keys only for a short distance. QKD protocols establish secure key by consent of both the sender and receiver. However, communication has to take place via an authenticate channel. Without this channel, QKD is vulnerable to man-in-the-middle attack. While not completely secure, it offers huge advantages over traditional methods by the use of entanglement swapping and quantum teleportation. In our research, we adopt the principle of charge-coupled device (CCD) to transfer the qubit from the sender to the receiver via a quantum channel. This technology has an added advantage over polarizer as only the circuit for transmitting the qubit is sufficient. No extra circuitry to implement the polarizer is required.

In quantum key distribution (QKD), the bit error rate is used to estimate the information leakage and hence determines the amount of privacy amplification-making the final key private by shortening the key. In general, there exists a threshold of the error rate for each scheme, above which no secure key can be generated. This threshold puts a restriction on the environment noises. For example, a widely used QKD protocol, the Bennett-Brassard protocol, cannot tolerate error rates beyond 25%. A new protocol, round-robin differential phase-shifted (RRDPS) QKD, essentially removes this restriction and can in principle tolerate more environment disturbance. Here, we propose and experimentally demonstrate a passive RRDPS QKD scheme. In particular, our 500MHz passive RRDPS QKD system is able to generate a secure key over 50km with a bit error rate as high as 29%. This scheme should find its applications in noisy environment conditions.

Since the Quantum Key Distribution (QKD)technique makes it possible to construct an absolute secure cryptographic system by combing the One-time pad, QKD has drawn many attention these years. The insufficient implementation speed of the post-processing system of QKD is one of the greatest obstacle to wide application of QKD. The sifting module of QKD post-processing system needs to deal with the heaviest incoming load, it is of crucial importance to study how to design and implement an efficient sifting module to accelerate the QKD post-processing system. In this paper, an efficient FPGA based design scheme of the sifting module is presented. Our scheme can decrease the demands for storage resource and communication traffic obviously.

To increase dramatically the distance and the secure key generation rate of quantum key distribution (QKD), the idea of quantum decoys--signals of different intensities--has recently been proposed. Here, we present the first experimental implementation of decoy state QKD. By making simple modifications to a commercial quantum key distribution system, we show that a secure key generation rate of 165 bit/s, which is 1/4 of the theoretical limit, can be obtained over 15 km of a telecommunication fiber. We also show that with the same experimental parameters, not even a single bit of secure key can be extracted with a non-decoy-state protocol. Compared to building single photon sources, decoy state QKD is a much simpler method for increasing the distance and key generation rate of unconditionally secure QKD.