Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Smart technologies Industrial and Civil Engineering

Research into the current state of quantum secret key distribution technologies

Serhiy Lenkov, Володимир Миколайович Джулій, Ihor Muliar, Yevhen Lenkov

Published May 14, 2025• 0 citations
Publisher

Abstract

The work is devoted to the study of the problems of using the technology of quantum distribution of secret keys, namely the problems of using and forming new secret keys, based on the generation of quantum keys and the distribution of new keys in networks of complex topologies. In secure communication systems, information is transmitted over public networks, and thus is available to a potential attacker for carrying out various types of attacks. A potential attacker is able to store encrypted data transmitted over network channels, and attempt to decrypt it later, when technical means and attacks on information protection algorithms will allow, in an acceptable time, to carry out decryption. This is the basic principle of "Store now, decrypt later", which is one of the problems of information protection systems. For block ciphers, there is a parameter - the key load, which limits the amount of information that one key can process using the data protection algorithm. NIST recommends a time frame for using secret keys, calculated in years. In the field of information security, there are more significant restrictions on the key load, related to the number of blocks that can be processed by one key, caused by attacks on block ciphers. With these restrictions, there is a need to regularly change the secret key used, and search for options for generating and delivering keys between two network nodes that organize a secure information transmission channel. Changing the secret key to a new key, independent of the previous one, allows you to protect the transfer of confidential information when the key used is compromised. The technology of creating a quantum computer allows you to effectively attack known algorithms for generating secret keys based on the factorization of large numbers or the complexity of calculating a discrete logarithm. The quantum Shor algorithm [5, 6] allows you to solve these problems in polynomial time, so it is necessary to look for alternative solutions to the problem of regular changes in the network channel of the secret key in a pair of nodes. It is important to take into account the need to ensure the quality of Perfect forward secrecy, when the master key is compromised, all subsequent secret keys must not be compromised. To achieve this property of modern encryption algorithms, there is a periodic update of master keys. To prevent the accumulation of information, to successfully carry out attacks by the attacker and to comply with the load requirement on the secret key, it is necessary to solve the problem of regular changes of the secret, and regular generation/delivery of keys to network nodes. Given the urgent needs that are intensively developing today in the secure and high-speed transmission of information, and no less, the rapid growth of technical capabilities, there is a need to develop options in advance that will ensure the security of information during transmission. Regular change, in geographically dispersed data protection systems, of common secret keys, in the case of ensuring the independence of secret keys, allows successfully solving the task.

DOI
10.32347/st.2025.3.1201

Related papers

Transfer of Secret Keys in a Quantum Network with Trusted Intermediate Nodes and with Block Cipher Encryption

S. N. Molotkov

The quantum cryptography technology allows key distribution in individual segments of a network in a point–point configuration; then, keys in individual segments are used to protect traffic between any nodes of the network, which are not connected directly by a quantum channel. Correspondingly, the problem of negotiation (distribution) of keys between separate segments of the network appears. In this work, the problem of the transmission of an independent key through trusted nodes of the quantum network, between which keys are provided as a result of quantum key distribution, is considered. Quantum keys are used to encrypt the transmitted key. The transmitted key can be encrypted by both the block cipher and the one-time pad. It has been shown that the complexity of search for the key transmitted through the network depends on the imperfection of the external key and quantum keys as well as on the imperfection of the block cipher, i.e., on the average probability of collisions in the block cipher. The complexity in the case of the encryption of the transmitted key by the one-time pad depends only on the imperfection of the transmitted key and encryption keys. Perfect keys keep the perfectness of the transmitted key. In the block cipher, the transmitted key is no longer perfect even with the perfect keys in the measure of difference of the block cipher from the one-time pad. It has also been shown that the larger the number of collisions of the block cipher, i.e., the smaller the number of ciphertexts covered by the block cipher, the smaller the number of search steps required to find the key.

Journal of Experimental and Theoretical Physics Letters•Mar 1, 2023•4 citations

Transfer of Secret Keys in a Quantum Network with Trusted Intermediate Nodes and with Block Cipher Encryption

S. N. Molotkov

The quantum cryptography technology allows key distribution in individual segments of a network in a point–point configuration; then, keys in individual segments are used to protect traffic between any nodes of the network, which are not connected directly by a quantum channel. Correspondingly, the problem of negotiation (distribution) of keys between separate segments of the network appears. In this work, the problem of the transmission of an independent key through trusted nodes of the quantum network, between which keys are provided as a result of quantum key distribution, is considered. Quantum keys are used to encrypt the transmitted key. The transmitted key can be encrypted by both the block cipher and the one-time pad. It has been shown that the complexity of search for the key transmitted through the network depends on the imperfection of the external key and quantum keys as well as on the imperfection of the block cipher, i.e., on the average probability of collisions in the block cipher. The complexity in the case of the encryption of the transmitted key by the one-time pad depends only on the imperfection of the transmitted key and encryption keys. Perfect keys keep the perfectness of the transmitted key. In the block cipher, the transmitted key is no longer perfect even with the perfect keys in the measure of difference of the block cipher from the one-time pad. It has also been shown that the larger the number of collisions of the block cipher, i.e., the smaller the number of ciphertexts covered by the block cipher, the smaller the number of search steps required to find the key.

Письма в Журнал экспериментальной и теоретической физики•Mar 15, 2023•2 citations

Quantum key distribution

Rupert Ursin, Nathan K. Langford, Andreas Poppe

Motivation The ability to guarantee security and privacy in communication are critical factors in encouraging people to accept and trust new tools and methods for today's information-based society (e.g. in eCommerce or eHealth) and for future services (e.g. eGovernment, eVoting). Cybercrime already hinders these new possibilities by creating widespread mistrust in these new services. Another problem is that a (perhaps unpublicized) break-through in mathematics or computer science could completely compromise current state-of-the-art encryption methods overnight, even those which are the basis of all existing internet banking transactions. This is because the security of cutting-edge public-key cryptography (conventional cryptography) relies on the computational difficulty of certain mathematical tasks, meaning that conventional cryptography alone can neither provide any evidence of eavesdropping nor guarantee strong security. The trend towards faster electronics provides the ability to handle longer keys, thus providing better security, but also increases the possibility to break keys. This also has another worrying effect: even using today's most advanced available security technology to protect data during communication with best practice and without making any mistakes, the ongoing improvements in technology (which hence require longer key lengths to ensure security) mean that today's transmitted data will not be secure for more than a few years. Thus, while encrypted data might be safe today, it can still be stored by the adversary now and then broken later on once the future technology has caught up with today's encryption. Alternatively, modern quantum cryptography has created a new paradigm for cryptographic communication, which provides strong, long-term security and incontrovertible evidence of any attempted eavesdropping which is based on theoretically and experimentally proven laws of nature.

Cambridge University Press eBooks•May 24, 2012•0 citations

An Application of Quantum Networks for Secure Video Surveillance

Alan Mink, Lijun Ma, Barry Hershman +1 more

IntroductionSecurity is an increasingly growing concern for network communications and video is an emerging segment of network traffic that uses large amounts of bandwidth.Streaming video, vs. downloading a video for later viewing, requires a continuous, high data rate.The data rate will vary depending on the quality of the video.Video surveillance is a streaming video application that in addition may require securing the data stream to prevent others from viewing it as well as prevent any tampering of that video stream.There are two parts to secure communication, key distribution and ciphers.A cipher requires a secret key that is used to encrypt data (plaintext), transforming it into an unreadable form (ciphertext) and then to decrypt it back into its original form.Key distribution is the method used to exchange the secret key between the desired end users and no one else.Current block ciphers are relatively slow compared to existing bandwidth because they require a substantial amount of processing that must compete for CPU cycles with the video encoding and compression processing.Frequently changing keys is thought to increase security, but the public key exchange method requires even more processing than the cipher.Cipher and key exchange processing can be off-loaded from the CPU, when the communication end point is the other end of the link, by using dedicated hardware called a link encryptor.Current classical security algorithms are based on the perceived computational complexity of certain mathematical functions and have not been proved secure.The public key algorithm is at risk from future quantum computers, whereas block ciphers are only weakened and an easy fix is to double the length of the key.Both are constantly at risk from a potential break through algorithm.Communications channels that exploit properties unique to quantum systems have been shown to enable functionality that cannot be achieved by classical means.If a high level of security is deemed necessary for the video stream, one might consider the use of a One-Time-Pad cipher [Wikipedia 2010], the only provably secure cipher, along with Quantum Key Distribution (QKD), also a provably secure method of exchanging the secret keys used by a cipher.QKD is a protocol based on the quantum laws of physics and is provably information theoretically secure to accomplish key distribution [Gisin, et al., 2002].QKD keys, when used with a One-Time-Pad cipher, can provide secure communications.A One-Time-Pad cipher algorithm performs an Exclusive OR (XOR) on a random secret key and the message.This is a simple operation that incurs little overhead compared to the more common www.intechopen.comVideo Surveillance 74 computationally intensive ciphers, but it requires the key to be the same length as the message and discarded once used.For video, that requires a continuous stream of random secret keys, which is one of the features of QKD.Because of that feature, QKD is considered to have a long-term security perspective because of its "perfect forward security" attribute.The term perfect forward security means that any compromised keys cannot be used to determine other keys, either past or future.Since QKD keys are random strings and are not produced by a mathematical function, any compromised keys cannot be used to determine other keys.QKD is still a technology under development even though a few commercial systems are available [Ouellette, 2004].Some of the limitations of QKD are speed, distance and cost.Distance is a major concern, since without a break-through in developing a quantum repeater the quantum signal is limited to a few 100 km at best.Amplification is not possible since the quantum "no cloning law" specifies that a quantum state cannot be copied.If trusted, intermediate nodes are acceptable, then longer distances are possible via a multihop propagation of the key over multiple QKD links.This is not always acceptable and for these situations a quantum repeater would be required.It is currently under development, but none have yet been demonstrated.Speed, the ability to produce secure keys at a high rate is important to cope with the large amount of communication traffic over high-speed connections and hardware implementations that off-load the CPU have been demonstrated.Cost is an ever-present constraint and designs that use lower cost components and share rather than replicate components reduce the cost.In some cases, designs that share rather than duplicate components help to reduce concerns of side channel attacks upon engineered components (vs theoretical ones), but usually at the detriment of speed.This chapter includes a short summary of the BB84 QKD protocol and its various stages.We then present a section on the configuration of a QKD system targeted for short distances and how a number of innovations lowered the cost and evolved that core design for longer distance communication and current infrastructure use.Another section will discuss hardware support for the data handling necessary to implement high-speed QKD.Extending QKD point-to-point systems to form QKD networks makes it even more attractive for applications such as video surveillance and we will discuss early networking demonstrations.In closing, we will discuss initial QKD standards efforts currently being conducted How to referenceIn order to correctly reference this scholarly work, feel free to copy and paste the following:

InTech eBooks•Feb 3, 2011•2 citations

Approaches to Developing Key Distribution Protocols Based on Quantum Key Distribution

Yenlik Begimbayeva

Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements

Journal of Electrical Systems•May 4, 2024•0 citations

Topology-Abstraction-Based Protection Scheme in Quantum Key Distribution Networks with Partially Trusted Relays

Qin Zhang, Yikai Liu, Xiaosong Yu +2 more

Quantum key distribution (QKD) can protect the exchange process of confidential information between communicating parties. By using the basic principles of quantum mechanics and combined with “one-time pad” cipher encryption, information can be unconditionally secure. The BB84 protocol first describes the method of transmitting information by photon polarization state, and it expounds the transmission process of services between trusted relays. However, due to the defects of real experimental devices, there are security vulnerabilities in QKD in a real system. The birth of measurement-device-independent quantum key distribution (MDI-QKD) protocol solves the problem, providing immunity to hacker attacks at the end of the detector. It can enable both sides of the transmission service to establish a connection and generate secret keys through an untrusted relay node to ensure information security. However, the types and properties of link nodes in quantum key distribution network (QKDN) based on partially trusted relay are more complex, which can easily result in network fault. Therefore, how to prevent the impact of failure on QKDN has become an urgent problem. In this paper, we propose a protection scheme for QKDN with partially trusted relays. The method deals with trusted and untrusted relays differently and constructs the working and protection paths of the secret key for each service. It reduces resource conflict between the protection and working paths by establishing a key protection threshold, which realizes the resource trade-off between the two factors. Simulation results show that the scheme provides effective protection to the services, and it improves the stability and reliability of QKDN based on partially trusted relay.

Photonics•Apr 3, 2022•5 citations
The work is devoted to the study of the problems of using the technology of quantum distribution of secret keys, namely the problems of using and forming new secret keys, based on the generation of quantum keys and the distribution of new keys in networks of complex topologies. In secure communication systems, information is transmitted over public networks, and thus is available to a potential attacker for carrying out various types of attacks. A potential attacker is able to store encrypted data transmitted over network channels, and attempt to decrypt it later, when technical means and attacks on information protection algorithms will allow, in an acceptable time, to carry out decryption. This is the basic principle of "Store now, decrypt later", which is one of the problems of information protection systems. For block ciphers, there is a parameter - the key load, which limits the amount of information that one key can process using the data protection algorithm. NIST recommends a time frame for using secret keys, calculated in years. In the field of information security, there are more significant restrictions on the key load, related to the number of blocks that can be processed by one key, caused by attacks on block ciphers. With these restrictions, there is a need to regularly change the secret key used, and search for options for generating and delivering keys between two network nodes that organize a secure information transmission channel. Changing the secret key to a new key, independent of the previous one, allows you to protect the transfer of confidential information when the key used is compromised. The technology of creating a quantum computer allows you to effectively attack known algorithms for generating secret keys based on the factorization of large numbers or the complexity of calculating a discrete logarithm. The quantum Shor algorithm [5, 6] allows you to solve these problems in polynomial time, so it is necessary to look for alternative solutions to the problem of regular changes in the network channel of the secret key in a pair of nodes. It is important to take into account the need to ensure the quality of Perfect forward secrecy, when the master key is compromised, all subsequent secret keys must not be compromised. To achieve this property of modern encryption algorithms, there is a periodic update of master keys. To prevent the accumulation of information, to successfully carry out attacks by the attacker and to comply with the load requirement on the secret key, it is necessary to solve the problem of regular changes of the secret, and regular generation/delivery of keys to network nodes. Given the urgent needs that are intensively developing today in the secure and high-speed transmission of information, and no less, the rapid growth of technical capabilities, there is a need to develop options in advance that will ensure the security of information during transmission. Regular change, in geographically dispersed data protection systems, of common secret keys, in the case of ensuring the independence of secret keys, allows successfully solving the task.
The quantum cryptography technology allows key distribution in individual segments of a network in a point–point configuration; then, keys in individual segments are used to protect traffic between any nodes of the network, which are not connected directly by a quantum channel. Correspondingly, the problem of negotiation (distribution) of keys between separate segments of the network appears. In this work, the problem of the transmission of an independent key through trusted nodes of the quantum network, between which keys are provided as a result of quantum key distribution, is considered. Quantum keys are used to encrypt the transmitted key. The transmitted key can be encrypted by both the block cipher and the one-time pad. It has been shown that the complexity of search for the key transmitted through the network depends on the imperfection of the external key and quantum keys as well as on the imperfection of the block cipher, i.e., on the average probability of collisions in the block cipher. The complexity in the case of the encryption of the transmitted key by the one-time pad depends only on the imperfection of the transmitted key and encryption keys. Perfect keys keep the perfectness of the transmitted key. In the block cipher, the transmitted key is no longer perfect even with the perfect keys in the measure of difference of the block cipher from the one-time pad. It has also been shown that the larger the number of collisions of the block cipher, i.e., the smaller the number of ciphertexts covered by the block cipher, the smaller the number of search steps required to find the key.
The quantum cryptography technology allows key distribution in individual segments of a network in a point–point configuration; then, keys in individual segments are used to protect traffic between any nodes of the network, which are not connected directly by a quantum channel. Correspondingly, the problem of negotiation (distribution) of keys between separate segments of the network appears. In this work, the problem of the transmission of an independent key through trusted nodes of the quantum network, between which keys are provided as a result of quantum key distribution, is considered. Quantum keys are used to encrypt the transmitted key. The transmitted key can be encrypted by both the block cipher and the one-time pad. It has been shown that the complexity of search for the key transmitted through the network depends on the imperfection of the external key and quantum keys as well as on the imperfection of the block cipher, i.e., on the average probability of collisions in the block cipher. The complexity in the case of the encryption of the transmitted key by the one-time pad depends only on the imperfection of the transmitted key and encryption keys. Perfect keys keep the perfectness of the transmitted key. In the block cipher, the transmitted key is no longer perfect even with the perfect keys in the measure of difference of the block cipher from the one-time pad. It has also been shown that the larger the number of collisions of the block cipher, i.e., the smaller the number of ciphertexts covered by the block cipher, the smaller the number of search steps required to find the key.
Motivation The ability to guarantee security and privacy in communication are critical factors in encouraging people to accept and trust new tools and methods for today's information-based society (e.g. in eCommerce or eHealth) and for future services (e.g. eGovernment, eVoting). Cybercrime already hinders these new possibilities by creating widespread mistrust in these new services. Another problem is that a (perhaps unpublicized) break-through in mathematics or computer science could completely compromise current state-of-the-art encryption methods overnight, even those which are the basis of all existing internet banking transactions. This is because the security of cutting-edge public-key cryptography (conventional cryptography) relies on the computational difficulty of certain mathematical tasks, meaning that conventional cryptography alone can neither provide any evidence of eavesdropping nor guarantee strong security. The trend towards faster electronics provides the ability to handle longer keys, thus providing better security, but also increases the possibility to break keys. This also has another worrying effect: even using today's most advanced available security technology to protect data during communication with best practice and without making any mistakes, the ongoing improvements in technology (which hence require longer key lengths to ensure security) mean that today's transmitted data will not be secure for more than a few years. Thus, while encrypted data might be safe today, it can still be stored by the adversary now and then broken later on once the future technology has caught up with today's encryption. Alternatively, modern quantum cryptography has created a new paradigm for cryptographic communication, which provides strong, long-term security and incontrovertible evidence of any attempted eavesdropping which is based on theoretically and experimentally proven laws of nature.
IntroductionSecurity is an increasingly growing concern for network communications and video is an emerging segment of network traffic that uses large amounts of bandwidth.Streaming video, vs. downloading a video for later viewing, requires a continuous, high data rate.The data rate will vary depending on the quality of the video.Video surveillance is a streaming video application that in addition may require securing the data stream to prevent others from viewing it as well as prevent any tampering of that video stream.There are two parts to secure communication, key distribution and ciphers.A cipher requires a secret key that is used to encrypt data (plaintext), transforming it into an unreadable form (ciphertext) and then to decrypt it back into its original form.Key distribution is the method used to exchange the secret key between the desired end users and no one else.Current block ciphers are relatively slow compared to existing bandwidth because they require a substantial amount of processing that must compete for CPU cycles with the video encoding and compression processing.Frequently changing keys is thought to increase security, but the public key exchange method requires even more processing than the cipher.Cipher and key exchange processing can be off-loaded from the CPU, when the communication end point is the other end of the link, by using dedicated hardware called a link encryptor.Current classical security algorithms are based on the perceived computational complexity of certain mathematical functions and have not been proved secure.The public key algorithm is at risk from future quantum computers, whereas block ciphers are only weakened and an easy fix is to double the length of the key.Both are constantly at risk from a potential break through algorithm.Communications channels that exploit properties unique to quantum systems have been shown to enable functionality that cannot be achieved by classical means.If a high level of security is deemed necessary for the video stream, one might consider the use of a One-Time-Pad cipher [Wikipedia 2010], the only provably secure cipher, along with Quantum Key Distribution (QKD), also a provably secure method of exchanging the secret keys used by a cipher.QKD is a protocol based on the quantum laws of physics and is provably information theoretically secure to accomplish key distribution [Gisin, et al., 2002].QKD keys, when used with a One-Time-Pad cipher, can provide secure communications.A One-Time-Pad cipher algorithm performs an Exclusive OR (XOR) on a random secret key and the message.This is a simple operation that incurs little overhead compared to the more common www.intechopen.comVideo Surveillance 74 computationally intensive ciphers, but it requires the key to be the same length as the message and discarded once used.For video, that requires a continuous stream of random secret keys, which is one of the features of QKD.Because of that feature, QKD is considered to have a long-term security perspective because of its "perfect forward security" attribute.The term perfect forward security means that any compromised keys cannot be used to determine other keys, either past or future.Since QKD keys are random strings and are not produced by a mathematical function, any compromised keys cannot be used to determine other keys.QKD is still a technology under development even though a few commercial systems are available [Ouellette, 2004].Some of the limitations of QKD are speed, distance and cost.Distance is a major concern, since without a break-through in developing a quantum repeater the quantum signal is limited to a few 100 km at best.Amplification is not possible since the quantum "no cloning law" specifies that a quantum state cannot be copied.If trusted, intermediate nodes are acceptable, then longer distances are possible via a multihop propagation of the key over multiple QKD links.This is not always acceptable and for these situations a quantum repeater would be required.It is currently under development, but none have yet been demonstrated.Speed, the ability to produce secure keys at a high rate is important to cope with the large amount of communication traffic over high-speed connections and hardware implementations that off-load the CPU have been demonstrated.Cost is an ever-present constraint and designs that use lower cost components and share rather than replicate components reduce the cost.In some cases, designs that share rather than duplicate components help to reduce concerns of side channel attacks upon engineered components (vs theoretical ones), but usually at the detriment of speed.This chapter includes a short summary of the BB84 QKD protocol and its various stages.We then present a section on the configuration of a QKD system targeted for short distances and how a number of innovations lowered the cost and evolved that core design for longer distance communication and current infrastructure use.Another section will discuss hardware support for the data handling necessary to implement high-speed QKD.Extending QKD point-to-point systems to form QKD networks makes it even more attractive for applications such as video surveillance and we will discuss early networking demonstrations.In closing, we will discuss initial QKD standards efforts currently being conducted How to referenceIn order to correctly reference this scholarly work, feel free to copy and paste the following:
Quantum protocols for generating shared secret keys represent an effective method of ensuring secure information transmission using quantum communication channels. However, they are limited in scalability due to the physical constraints of quantum channels, which necessitates the use of classical communication channels for exchanging information between participants. This leads to the necessity of developing security threat models and network protection, especially in the case of hybrid networks, where quantum channels are used alongside classical ones. The peculiarity of constructing quantum key distribution protocols is associated with the costliness of implementation and implies the inevitable use of classical communication channels for key distribution. This paper addresses the task of ensuring the security of communication between subscribers not directly connected by quantum channels, through intermediary nodes, and analyzes threats from internal and external adversaries. Special attention is paid to situations where both types of adversaries have information about the processes and protocols in the network. The paper examines widely used key distribution protocols employed in practice. It describes the main security requirements applied to key distribution protocols, and presents the results of an analysis of the compliance of the discussed protocols with these requirements
Quantum key distribution (QKD) can protect the exchange process of confidential information between communicating parties. By using the basic principles of quantum mechanics and combined with “one-time pad” cipher encryption, information can be unconditionally secure. The BB84 protocol first describes the method of transmitting information by photon polarization state, and it expounds the transmission process of services between trusted relays. However, due to the defects of real experimental devices, there are security vulnerabilities in QKD in a real system. The birth of measurement-device-independent quantum key distribution (MDI-QKD) protocol solves the problem, providing immunity to hacker attacks at the end of the detector. It can enable both sides of the transmission service to establish a connection and generate secret keys through an untrusted relay node to ensure information security. However, the types and properties of link nodes in quantum key distribution network (QKDN) based on partially trusted relay are more complex, which can easily result in network fault. Therefore, how to prevent the impact of failure on QKDN has become an urgent problem. In this paper, we propose a protection scheme for QKDN with partially trusted relays. The method deals with trusted and untrusted relays differently and constructs the working and protection paths of the secret key for each service. It reduces resource conflict between the protection and working paths by establishing a key protection threshold, which realizes the resource trade-off between the two factors. Simulation results show that the scheme provides effective protection to the services, and it improves the stability and reliability of QKDN based on partially trusted relay.