Providing attestation of quantum key distribution key delivery sources and transmissions
By generating polynomials and establishing the main path and auxiliary path, ensuring that the quantum key is transmitted on a specific path, the problem that intermediate nodes cannot verify the source of the key is solved, and the efficiency and security of key management are achieved.
Patent Information
- Application Number
- CN202310853049.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2023-05-09
- Filing Date
- 2023-07-12
- Publication Date
- 2024-11-12
AI Technical Summary
The existing quantum key distribution technology cannot effectively verify the source and path of the key at the intermediate node, resulting in an increase in the risk of key attacks, wasted computing resources and network resources, and it is impossible to easily revoke damaged keys.
By generating polynomials with specific degrees and points, establishing the primary and auxiliary paths, using the points of the polynomial as secret sharing to allocate to intermediate network devices, ensuring that the key is transmitted on a specific path, and verifying the source and path of the key through the accumulated values , provide proof of key transmission.
Effectively verify the source of keys, ensure that keys do not intersect, reduce the risk of attack, save computing and network resources, easily revoke damaged keys, and improve the reliability and security of key management.
Smart Images

Figure CN118944861A_ABST
Abstract
Description
Background Art
[0001] Quantum key distribution (QKD) is a method of determining the same random number (e.g., security key) at both ends of a quantum link. Since the security key is never transmitted over the quantum link, quantum key distribution is considered information secure. Summary of the invention
[0002] Some implementations described herein relate to a method. The method may include generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points, and generating a main path from a first network device to a second network device via a first set of intermediate network devices based on the first polynomial. The method may include generating an auxiliary path from a first network device to a second network device via a second set of intermediate network devices based on the second polynomial, and assigning the points of the first polynomial as a secret share to the device and to each of the first set of intermediate network devices. The method may include assigning the points of the second polynomial as a secret share to the device and to each of the second set of intermediate network devices, and based on assigning the points of the first polynomial, providing the main path from the first network device to the second network device via the first set of intermediate network devices. The method may include providing the auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on assigning the points of the second polynomial.
[0003] Some implementations described herein relate to a device. The device may include one or more memories and one or more processors. One or more processors may be configured to: generate a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points, and generate a main path from the first network device to the second network device via a first set of intermediate network devices based on the first polynomial. One or more processors may be configured to: generate an auxiliary path from the first network device to the second network device via a second set of intermediate network devices based on the second polynomial, wherein the first network device is configured to provide packets to the second network device via the main path and via the auxiliary path. One or more processors may be configured to: assign the points of the first polynomial as a secret share to the device and to each of the first set of intermediate network devices, and assign the points of the second polynomial as a secret share to the device and to each of the second set of intermediate network devices. One or more processors may be configured to: based on the distribution of the points of the first polynomial, the main path is provided from the first network device to the second network device via the first set of intermediate network devices, and based on the distribution of the points of the second polynomial, the auxiliary path is provided from the first network device to the second network device via the second set of intermediate network devices.
[0004] Some implementations described herein relate to a non-transitory computer-readable medium storing a set of instructions. When the set of instructions is executed by one or more processors of a device, the device may be caused to: generate a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points, and generate a main path from the first network device to the second network device via a first set of intermediate network devices based on the first polynomial. When the set of instructions is executed by one or more processors of the device, the device may be caused to: generate an auxiliary path from the first network device to the second network device via a second set of intermediate network devices based on the second polynomial, wherein the main path is associated with a first quantum link and the auxiliary path is associated with a second quantum link. When the set of instructions is executed by one or more processors of the device, the device may be caused to: assign the points of the first polynomial as a secret share to the device and to each of the first set of intermediate network devices, and assign the points of the second polynomial as a secret share to the device and to each of the second set of intermediate network devices. When the set of instructions is executed by one or more processors of the device, the device may be caused to: based on assigning the points of the first polynomial, provide the main path from the first network device to the second network device via the first set of intermediate network devices. When the instruction set is executed by one or more processors of the device, the device may be caused to: provide an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on allocating points of the second polynomial. BRIEF DESCRIPTION OF THE DRAWINGS
[0005] Figures 1A to 1H is an example diagram associated with providing proof of QKD key delivery origin and transmission.
[0006] Figure 2 is an illustration of an example environment in which the systems and / or methods described herein may be implemented.
[0007] Figure 3 and Figure 4 yes Figure 2 An illustration of example components of one or more devices.
[0008] Figure 5 is an example process flow diagram for providing proof of QKD key delivery origin and transmission. DETAILED DESCRIPTION
[0009] The following detailed description of example implementations refers to the accompanying drawings.The same reference numbers in different drawings may identify the same or similar elements.
[0010] Once determined, the security key can be made available at the key management entity (KME) at each endpoint of the quantum link (e.g., A and B). In order to identify the key pair (e.g., two independent instances of the same security key created by different entities), a unique identifier will be assigned to the security key and shared between the KMEs. The current standard defines an application programming interface (API) used by a security application entity, such as a network device with a secure tunnel terminal (e.g., secure Internet Protocol (IPsec), secure media access control (MACsec), etc.) using the API to retrieve the security key and implement an encryption engine using the security key to establish a secure tunnel.
[0011] The distance covered by quantum links is limited by the attenuation of the link fiber and cannot be extended using optical amplifiers. One way to extend the distance of quantum links is to provide trusted nodes that extract key information from one end and forward the key information to the other end via a secure key relay mode. Trusted nodes can have access to security keys and need to protect them from manipulation and deception. According to current standards, each of the two security application entities that consume keys (for example, performing IPsec or MACsec symmetric encryption) can accept any key from the associated KME. Each security application entity can authenticate the key using the associated KME, but has no visibility into the intermediate nodes involved in the key distribution (for example, trusted nodes), and cannot verify that two security keys were created by different KMEs.
[0012] Misconfiguration of the key delivery scheme between KMEs may result in two security application entities receiving instances of exactly the same security key, rather than two different instances of the security key, thereby increasing the chances of a successful attack on the quantum link. In addition, when an intrusion is detected on one of the trusted nodes, the security key associated with the affected trusted node cannot be easily identified and revoked because the security key has already been delivered. Therefore, current techniques for performing quantum key distribution consume computing resources (e.g., processing resources, memory resources, communication resources, etc.), network resources, etc., which are associated with the inability to verify two security keys created by different KMEs, handling network interruptions caused by a successful attack on the quantum link, handling business losses caused by a successful attack on the quantum link, and the inability to identify and revoke security keys associated with compromised trusted nodes.
[0013] Some implementations described herein relate to a controller device (e.g., a key management network) that provides proof of the source and transmission of QKD key delivery. For example, the controller device may generate a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points, and may generate a main path from the first network device to the second network device via a first set of intermediate network devices based on the first polynomial. The controller device may generate an auxiliary path from the first network device to the second network device via a second set of intermediate network devices based on the second polynomial, and may assign the points of the first polynomial to the controller device as a secret share, to each of the first set of intermediate network devices. The controller device may assign the points of the second polynomial to the device as a secret share and to each of the second set of intermediate network devices, and may provide the main path from the first network device to the second network device via the first set of intermediate network devices based on the assignment of the points of the first polynomial. The controller device may provide the auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on the assignment of the points of the second polynomial.
[0014] In this way, the controller device provides proof of the source and transmission of the QKD key delivery. For example, the controller device can make the properties and sources of the quantum link (including trusted nodes) valid or prove the properties and sources of the quantum link. The controller device can assign a trusted chain of nodes (e.g., a sequence of trusted nodes and KMEs) to each instance of the security key through the key management network. The paths of each instance of the security key may not intersect, and each original KME of the security key pair may be different. For example, the first KME may forward the security key according to the first chain, and the second KME may forward the security key according to the second chain. The first consumer network device may be located at the same location as the first KME, or it may be away from the first KME via a trusted node. The second consumer network device may be located at the same location as the second KME, or it may be away from the second KME via a trusted node. The controller device can extend the protocol for retrieving the security key so as to also retrieve the cumulative value of the security key. Each of the first network device and the second network device can perform a cumulative value calculation, and can report the cumulative value to the controller device for verification after retrieval but before applying the security key. The controller device can report the verification result to the first network device and the second network device. Successful verification of two security keys may indicate that the security keys originated from two different KMEs and traversed different paths in the key management network. The controller device may provide unsuccessful verification for root cause analysis and remediation and may cause the security keys to be discarded.
[0015] Therefore, the controller device saves computing resources, network resources, etc., which would otherwise be consumed due to the inability to validate two security keys created by different KMEs, handling network interruptions caused by a successful attack on the quantum link, handling business losses caused by a successful attack on the quantum link, and the inability to identify and revoke security keys associated with compromised trusted nodes.
[0016] Figures 1A to 1H is a diagram of an example 100 associated with providing proof of QKD key delivery origin and transmission. Figures 1A to 1H As shown, example 100 includes a controller device, a first physically secure location (e.g., physically secure location A), a second physically secure location (e.g., physically secure location B), a first intermediate location (e.g., physically secure location Z), a second intermediate location (e.g., physically secure location Z1), and a third intermediate location (e.g., physically secure location Z2). Figure 1A As further shown, a first physical security location (e.g., physical security location A) may include a first network device (e.g., security application entity (SAE)-A), a first KME (e.g., KME-A), a first QKD device (e.g., QKD-A), and a second QKD device (e.g., QKD-A1). The first network device may be connected to the first KME (e.g., via a QKD-API), and the first KME may be connected to the first QKD device (e.g., QKD-A) and the second QKD device (e.g., QKD-A1).
[0017] The second physical security location (e.g., physical security location B) may include a second network device (e.g., SAE-B), a second KME (e.g., KME-B), a third QKD device (e.g., QKD-B), and a fourth QKD device (e.g., QKD-B1). The second network device may be connected to the second KME (e.g., via QKD-API), and the second KME may be connected to the third QKD device (e.g., QKD-B) and the fourth QKD device (e.g., QKD-B1). The second network device may be connected to the first network device via an IPsec or MACsec tunnel. The first intermediate location (e.g., physical security location Z) may include a fifth KME (e.g., KME-X), which is interconnected with a sixth KME (e.g., KME-Y). The fifth KME may form a quantum channel with the first QKD device (e.g., QKD-A), and the sixth KME may form another quantum channel with the third QKD device (e.g., QKD-B). The second intermediate location (e.g., physical security location Z1) may include a seventh KME (e.g., KME-X1) interconnected with an eighth KME (e.g., KME-Y1). The seventh KME may be connected to a second QKD device (e.g., QKD-A1). The third intermediate location (e.g., physical security location Z2) may include a ninth KME (e.g., KME-X2) interconnected with a tenth KME (e.g., KME-Y2). The ninth KME may be connected to a fourth QKD device (e.g., QKD-B1), and the tenth KME may be connected to an eighth KME (e.g., KME-Y1). The controller device may be connected to all devices of the key management network. In some implementations, each QKD device and / or each KME may be a network device. Further details of the controller device, KME, QKD device, and network device are provided elsewhere herein.
[0018] In some implementations, the controller device can enable a consumer of the key (e.g., the second network device SAE-B) to prove the properties and origin of a transmission including a node (e.g., a KME at an intermediate location). The controller device can provide transmission proof to protect key data in a quantum network, such as Figure 1AA key management network. The controller device may assign a chain of trusted nodes (e.g., KMEs and QKD devices) to each instance of a security key (e.g., SKa and SKb) that defines a path through the key management network. The paths may not intersect, and each original KME for a security key pair may be different. For example, a first KME (e.g., KME-A) may forward a first path as defined by a first chain of trusted nodes (e.g., chain-A), and a second KME (e.g., KME-B) may forward a second path as defined by a second chain of trusted nodes (e.g., chain-B). In some implementations, a consuming SAE node (e.g., a first network device SAE-A and a second network device SAE-B) may be co-located with a KME (e.g., KME-A and KME-B) or co-located with a remote KME via a trusted node.
[0019] The standard protocol for retrieving security keys can be extended to also retrieve the cumulative value of the security keys. Each SAE can perform a cumulative value calculation. After retrieval, but before applying the security key, each SAE can report the cumulative value to the controller device for verification. The controller device can perform verification on the security key based on the cumulative value and can report the verification result back to the SAE. Successful verification of two security keys indicates that the security keys originated from two different KMEs and traversed different paths in the key management network. The controller device can handle unsuccessful verifications through root cause analysis and remediation, and can discard the security key.
[0020] In some implementations, if the controller device determines that the trusted node has been compromised, the controller device may perform revalidation on all active security keys to eliminate compromised key information. Alternatively, SAE-A may provide a key identifier and a cumulative value to SAE-B. The controller device may determine whether the cumulative value provided by SAE-A to SAE-B is different from the cumulative value received from KME-B. When the controller device determines that the cumulative value provided by SAE-A to SAE-B is different from the cumulative value received from KME-B, the controller device may determine that the two security keys propagated over different paths.
[0021] In some implementations, instead of the SAE requesting verification, neighboring KMEs (e.g., a first KME and a second KME) may request verification from a controller device. Such an implementation may shift protocol overhead to the KMEs and may avoid modifying the API between the SAEs and the KMEs. In certain implementations, the API may be extended to allow SAE-A and SAE-B to request verification operations for security keys in use. This may enable a controller device to revoke compromised security keys (e.g., upon detection of a compromise in a trusted node, all active security keys transmitted on a trusted node may be revoked). In such an implementation, SAE-A may communicate the key identifier and accumulated value (e.g., but not the security key) to SAE-B in a separate manner. This may enable SAE-B to report proof of transmission of the security key to the controller device, which simplifies the verification process because the path information for each path is available in one data set and only requires one message exchange instead of two.
[0022] In some implementations, remote entities may use mechanisms to verify that SAE-A and SAE-B possess security keys derived from QKD, rather than keys created by themselves (e.g., in a cloud computing environment). In some implementations, the controller device may utilize nesting to verify the origin of the security key and trace the origin back to the point of handover of the security key.
[0023] In some implementations, the controller device may perform verification without exposing the exact path through the key management network to the SAE. Unlike current implementations, consumers of security keys may receive traceable information where quantum entities participated in security key generation and security key delivery. Due to this tracking and verification function, the controller device can ensure that the security key instances used by SAE-A and SAE-B are disjoint and originate from different KMEs. The controller device can also prevent the SAE from being deceived by user-created security keys because the origin of each security key instance is verified.
[0024] The cloud computing environment provider and the user can agree on a specific way to share the security keys generated by the QKD system in the cloud computing environment. By adding a traceable (non-QKD) gateway under the control of the client to the key delivery mechanism, the trust in the provided security keys can be improved. To combine QKD with transmission proof, the security key consumer (e.g., SAE) or KME can trigger the transmission verification of the security key. The controller device can determine whether two security key instances come from different entry nodes and pass through non-overlapping intermediate nodes.
[0025] like Figure 1BAs shown, by reference numeral 105, the controller device can generate a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points. For example, if the data passes through a predefined sequence of trusted nodes, the transmission proof can work well. However, for protection and resilience, the data can pass through two or more paths. Therefore, the controller device can enable the transmission proof to be applied at the separation or merging point. For primary protection and secondary protection, the controller device can generate a first polynomial having a degree k and a certain number of points (for example, corresponding to k nodes along the primary path) and a second polynomial having a degree k+1 and a certain number of points (for example, corresponding to k+1 nodes along the secondary path).
[0026] like Figure 1C As shown, by reference numeral 110, the controller device can generate a main path from the first network device to the second network device via the first set of intermediate network devices based on the first polynomial. For example, the controller device can generate a main path from the first network device (e.g., SAE-A) to the second network device (e.g., SAE-B) via the first set of intermediate network devices using a first polynomial having a degree and a certain number of points. In one example, the main path can be defined as passing through the following nodes (e.g., network devices): a first KME (e.g., KME-A) → a first QKD device (e.g., QKD-A) → a fifth KME (e.g., KME-X) → a sixth KME (e.g., KME-Y) → a third QKD device (e.g., QKD-B) → a second KME (e.g., KME-B). Thus, the first set of intermediate network devices may include a first KME (e.g., KME-A), a first QKD device (e.g., QKD-A), a fifth KME (e.g., KME-X), a sixth KME (e.g., KME-Y), a third QKD device (e.g., QKD-B) and a second KME (e.g., KME-B).
[0027] like Figure 1CAs shown, by reference numeral 115, the controller device can generate an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on the second polynomial. For example, the controller device can generate an auxiliary path from the first network device (e.g., SAE-A) to the second network device (e.g., SAE-B) via the second set of intermediate network devices using a second polynomial with a degree and a certain number of points. In one example, the auxiliary path can be defined as passing through the following nodes (e.g., network devices): the first KME (e.g., KME-A) → the second QKD device (e.g., QKD-A1) → the seventh KME (e.g., KME-X1) → the eighth KME (e.g., KME-Y1) → the tenth KME (e.g., KME-Y2) → the ninth KME (e.g., KME-X2) → the fourth QKD device (e.g., QKD-B1) → the second KME (e.g., KME-B). Thus, the second set of intermediate network devices may include a first KME (e.g., KME-A), a second QKD device (e.g., QKD-A1), a seventh KME (e.g., KME-X1), an eighth KME (e.g., KME-Y1), a tenth KME (e.g., KME-Y2), a ninth KME (e.g., KME-X2), a fourth QKD device (e.g., QKD-B1) and a second KME (e.g., KME-B).
[0028] like Figure 1D As shown, by reference numeral 120, the controller device may assign points of the first polynomial as a share of the secret to the controller device and to each of the first set of intermediate network devices, and may assign points of the second polynomial as a share of the secret to the controller device and to each of the second set of intermediate network devices. For example, the controller device may configure a secret shared with network devices along a primary path and an auxiliary path. In some implementations, the controller device may assign points of the first polynomial as a share of the secret to the controller device and to each of the first set of intermediate network devices. In one example, the controller device may assign points of the first polynomial to a first KME (e.g., KME-A), a first QKD device (e.g., QKD-A), a fifth KME (e.g., KME-X), a sixth KME (e.g., KME-Y), a third QKD device (e.g., QKD-B), and a second KME (e.g., KME-B).
[0029] In some implementations, the controller device may assign points of the second polynomial to the controller device and to each of the second set of intermediate network devices as a share of the secret. In one example, the controller device may assign points of the second polynomial to the first KME (e.g., KME-A), the second QKD device (e.g., QKD-A1), the seventh KME (e.g., KME-X1), the eighth KME (e.g., KME-Y1), the tenth KME (e.g., KME-Y2), the ninth KME (e.g., KME-X2), the fourth QKD device (e.g., QKD-B1), and the second KME (e.g., KME-B). After assigning points of the first polynomial and the second polynomial, the first KME (e.g., KME-A) and the second KME (e.g., KME-B) may be endpoints of two different polynomials (e.g., the first polynomial and the second polynomial).
[0030] like Figure 1E As shown, the controller device can enable the main path to be provided from the first network device to the second network device via the first intermediate network device set, and enable the auxiliary path to be provided from the first network device to the second network device via the second intermediate network device set. For example, the controller device can enable the main path (e.g., represented by a solid line) to be provided from the first network device (e.g., SAE-A) to the first KME device (e.g., KME-A), to the first QKD device (e.g., QKD-A), to the fifth KME device (e.g., KME-X), to the sixth KME device (e.g., KME-Y), to the third QKD device (e.g., QKD-B), to the second KME device (e.g., KME-B), and to the second network device (e.g., SAE-B). In another example, the controller device can enable auxiliary paths (e.g., represented by dashed lines) from a first network device (e.g., SAE-A) to a first KME device (e.g., KME-A), to a second QKD device (e.g., QKD-A1), to a seventh KME device (e.g., KME-X1), to an eighth KME device (e.g., KME-Y1), to a tenth KME device (e.g., KME-Y2), to a ninth KME device (e.g., KME-X2), to a fourth QKD device (e.g., QKD-B1), to a second KME device (e.g., KME-B), and to a second network device (e.g., SAE-B).
[0031] like Figure 1FAs shown, by reference numeral 125, the first network device may generate a random number based on a third polynomial, and a cumulative value for a packet destined for the second network device. For example, the first network device (e.g., SAE-A) may generate a random number based on a third polynomial (e.g., a constant coefficient of the third polynomial), and may initialize the cumulative value to zero. The first network device may generate a packet destined for the second network device (e.g., SAE-B), and may include the random number and the cumulative value in the packet. In some implementations, the first instance of the packet may include a first security key, and the second instance of the packet may include a second security key.
[0032] like Figure 1F As further shown in the figure by reference numeral 130, the first network device can provide a packet via a first KME and a path (e.g., a primary path and a secondary path). For example, the first network device can provide a first instance of a packet to a second network device via a first KME (e.g., KME-A) and a trusted node of the primary path (e.g., a first QKD device (e.g., QKD-A), a fifth KME (e.g., KME-X), a sixth KME (e.g., KME-Y), a third QKD device (e.g., QKD-B), and a second KME (e.g., KME-B)). The first network device can provide a second instance of the packet to the second network device via the first KME (e.g., KME-A) and trusted nodes of the auxiliary path (e.g., the second QKD device (e.g., QKD-A1), the seventh KME (e.g., KME-X1), the eighth KME (e.g., KME-Y1), the tenth KME (e.g., KME-Y2), the ninth KME (e.g., KME-X2), the fourth QKD device (e.g., QKD-B1), and the second KME (e.g., KME-B)).
[0033] like Figure 1F As further shown in the figure by reference numeral 135, a first KME (e.g., KME-A) can retrieve a random number from the grouping, can calculate the sum of the shares of the first polynomial and the third polynomial, and can use the sum to update the cumulative value. For example, when the first instance grouping visits each trusted node of the main path, the trusted node can retrieve a random number from the first instance of the grouping, and can calculate the sum of the shares of the first polynomial and the third polynomial. The trusted node can use the sum to update the cumulative value of the first instance of the grouping. Therefore, the first KME can retrieve a random number from the first instance of the grouping, and can calculate the sum of the shares of the first polynomial and the third polynomial. The first KME can use the sum to update the cumulative value of the first instance of the grouping.
[0034] like Figure 1FAs shown, by reference numeral 140, the first KME can provide a packet with an updated cumulative value to the next hop of the main path. For example, the first KME can provide a first instance of a packet with an updated cumulative value to the next hop of the main path (e.g., to a first QKD device (e.g., QKD-A)). The first QKD device can retrieve a random number from the first instance of the packet, and can calculate the sum of the shares of the first polynomial and the third polynomial. The first QKD device can use the sum to update the cumulative value of the first instance of the packet. The first QKD device can provide the first instance of the packet with an updated cumulative value to the next hop of the main path. Each hop of the main path can receive the first instance of the packet, and can retrieve the random number from the first instance of the packet. Each hop of the main path can calculate the sum of the shares of the first polynomial and the third polynomial, and can use the sum to update the cumulative value. Each hop of the main path can provide the first instance of the packet with an updated cumulative value to the next hop of the main path until the first instance of the packet reaches the second network device.
[0035] like Figure 1G As shown, and by reference numeral 145, the first KME can retrieve a random number from the grouping, can calculate the sum of the shares of the second polynomial and the third polynomial, and can use the sum to update the cumulative value. For example, when the second instance grouping accesses each trusted node of the auxiliary path, the trusted node can retrieve a random number from the second instance of the grouping, and can calculate the sum of the shares of the second polynomial and the third polynomial. The trusted node can use the sum to update the cumulative value of the first instance of the grouping. Therefore, the first KME can retrieve a random number from the second instance of the grouping, and can calculate the sum of the shares of the second polynomial and the third polynomial. The first KME can use the sum to update the cumulative value of the first instance of the grouping.
[0036] like Figure 1GAs shown, and by reference numeral 150, the first KME may provide a packet with an updated cumulative value to a next hop of the auxiliary path. For example, the first KME may provide a second instance of the packet with an updated cumulative value to a next hop of the auxiliary path (e.g., a second QKD device (e.g., QKD-A1)). The second QKD device may retrieve a random number from the second instance of the packet, and may calculate the sum of the shares of the second polynomial and the third polynomial. The second QKD device may use the sum to update the cumulative value of the second instance of the packet. The second QKD device may provide a second instance of the packet with an updated cumulative value to the next hop of the auxiliary path. Each hop of the auxiliary path may receive a second instance of the packet, and may retrieve a random number from the second instance of the packet. Each hop of the auxiliary path may calculate the sum of the shares of the second polynomial and the third polynomial, and may use the sum to update the cumulative value. Each hop of the auxiliary path may provide a second instance of the packet with an updated cumulative value to the next hop of the auxiliary path until the second instance of the packet reaches the second network device.
[0037] like Figure 1H As shown, and by reference numeral 155, the first network device can request and receive a first key, a key identifier, and a first cumulative value from a first KME. For example, the first network device can generate a request for a first key (e.g., a first instance of a group), a key identifier, and a first cumulative value. The first network device can provide the request to a first KME (e.g., KME-A) via a QKD-API. The first KME can provide the first key, a key identifier, and a first cumulative value (e.g., calculated by the first KME) to the first network device based on the request. The first network device can receive the first key, the key identifier, and the first cumulative value from the first KME.
[0038] like Figure 1H As further shown in FIG. 1 and by reference numeral 160, the first network device may provide the key identifier and the first cumulative value to the second network device. For example, when the first network device receives the first key, the key identifier, and the first cumulative value from the first KME, the first network device may provide the key identifier and the first cumulative value to the second network device. The first network device may not provide the first key to the second network device.
[0039] like Figure 1HAs further shown in the figure, by reference numeral 165, the second network device can request and receive a second key and a second cumulative value based on the key identifier from the second KME. For example, the second network device can generate a request for a second key (e.g., a second instance of the group) and a second cumulative value. The second network device can provide the request to a second KME (e.g., KME-B) via the QKD-API. The second KME can provide the second key and the second cumulative value (e.g., calculated by the second KME) to the second network device based on the request. The second network device can receive the second key and the second cumulative value from the second KME.
[0040] like Figure 1H As further shown in the figure, by reference numeral 170, the controller device may receive the first cumulative value and the second cumulative value. For example, the second network device may provide the first cumulative value to the second KME (e.g., KME-B). After providing the second key and the second cumulative value to the second network device, the second KME may provide the first cumulative value and the second cumulative value to the controller device. The controller device may receive the first cumulative value and the second cumulative value from the second KME.
[0041] like Figure 1H As further shown in and by reference numeral 175, the controller device may verify the first cumulative value and the second cumulative value, and may validate the first key and the second key based on verifying the first cumulative value and the second cumulative value. For example, the controller device may determine whether each of the first cumulative value and the second cumulative value is equal to the sum of the secret and the random number, and whether the first cumulative value and the second cumulative value are associated with different paths (e.g., a primary path and an auxiliary path). In some embodiments, the controller device may verify that each of the first cumulative value and the second cumulative value is equal to the sum of the secret and the random number, and the first cumulative value and the second cumulative value are associated with different paths. Alternatively, the controller may not be able to verify that each of the first cumulative value and the second cumulative value is equal to the sum of the secret and the random number, or the first cumulative value and the second cumulative value are associated with different paths. When the controller device verifies that each of the first cumulative value and the second cumulative value is equal to the sum of the secret and the random number, and the first cumulative value and the second cumulative value are associated with different paths, the controller device may validate the first key and the second key. Alternatively, the controller device may invalidate the first key and / or the second key when the controller device cannot verify that each of the first accumulated value and the second accumulated value is equal to the sum of the secret and the random number, or the first accumulated value and the second accumulated value are associated with different paths.
[0042] In some implementations, the controller device may revoke the first key and / or the second key based on invalidating the first key and / or the second key. In some implementations, the controller device may verify that the first network device retrieved the first key from a different source than the source of the second key retrieved by the second network device based on the first cumulative value and the second cumulative value.
[0043] In some implementations, if the second KME (e.g., KME-B) is able to distinguish between the main path and the auxiliary path based on the receiving port, the main port of the second KME can receive the first key via a third QKD device (e.g., QKD-B). The second KME can calculate the sum of the shares of the first polynomial and the third polynomial, and can use the sum to update the first cumulative value. The auxiliary port of the second KME can receive the second key via a fourth QKD device (e.g., QKD-B1). The second KME can calculate the sum of the shares of the second polynomial and the third polynomial, and can use the sum to update the second cumulative value.
[0044] In some implementations, if the second KME cannot distinguish between the primary path and the secondary path, the second KME may calculate the first cumulative value based on the first polynomial and the third polynomial, and may calculate the second cumulative value based on the second polynomial and the third polynomial. The second KME may provide the first cumulative value and the second cumulative value to the controller device.
[0045] In this way, the controller device provides proof of the source and transmission of QKD key delivery. For example, the controller device can verify or prove the properties and provenance of the quantum link (including trusted nodes). The controller device can assign a trusted chain of nodes (e.g., a sequence of trusted nodes and KMEs) to each security key instance through a key management network. The paths of each instance of the security key may not intersect, and each original KME of the security key pair may be different. For example, the first KME may forward the security key according to the first chain, and the second KME may forward the security key according to the second chain. The first consumer network device may be co-located with the first KME, or the first KME may be remotely connected via a trusted node. The second consumer network device may be co-located with the second KME, or the second KME may be remotely connected via a trusted node. The controller device may extend the protocol for retrieving the security key so as to also retrieve the cumulative value of the security key. Each of the first network device and the second network device may perform a cumulative value calculation, and may report the cumulative value to the controller device for verification after retrieval but before applying the security key. The controller device may report the verification result to the first network device and the second network device. Successful verification of two security keys may indicate that the security keys originated from two different KMEs and traversed different paths in the key management network. The controller device may provide unsuccessful verification for root cause analysis and remediation and may cause the security keys to be discarded.
[0046] Therefore, the controller device saves computing resources, network resources, etc., which would otherwise be consumed due to the inability to verify two security keys created by different KMEs, handling network interruptions caused by successful attacks on quantum links, handling business losses caused by successful attacks on quantum links, and the inability to identify and revoke security keys associated with compromised trusted nodes.
[0047] As indicated above, provided as an example Figures 1A to 1H Other examples can be found with Figures 1A to 1H Different from what is described. Provided as an example Figures 1A to 1H The number and arrangement of devices shown. In actual operation, Figures 1A to 1H There may be additional devices, fewer devices, different devices, or different arrangements of devices than those shown. Figures 1A to 1H Two or more of the devices shown in may be implemented in a single device, or Figures 1A to 1H The single device shown in may be implemented as multiple, distributed devices. Additionally or alternatively, Figures 1A to 1H The device collection (e.g., one or more devices) shown in FIG. 1 may perform the operations described as being performed by Figures 1A to 1H One or more functions performed by another set of devices shown in .
[0048] Figure 2 2 is a schematic diagram of an example environment 200 in which the systems and / or methods described herein may be implemented. Figure 2 As shown, environment 200 may include KME 210, a set of network devices 220 (shown as network devices 220-1 through 220-n), controller device 230, and network 240. The devices of environment 200 may be interconnected via wired connections, wireless connections, or a combination of wired and wireless connections.
[0049] KME 210 may include one or more devices capable of receiving, generating, storing, processing, providing and / or routing information, as described elsewhere herein. KME 210 may include communication devices and / or computing devices. For example, KME 210 may include a server, such as an application server, a client server, a web server, a database server, a host server, a proxy server, a virtual server (e.g., executed on computing hardware) or a server in a cloud computing system. In some implementations, KME 210 may include computing hardware used in a cloud computing environment. In some implementations, KME 210 may be a network device 220 or may be incorporated into a network device 220.
[0050] The network device 220 includes one or more devices capable of receiving, processing, storing, routing and / or providing services (e.g., packets or other information or metadata) in the manner described herein. For example, the network device 220 may include a router, such as a label switching router (LSR), a label edge router (LER), an ingress router, an egress router, a provider router (e.g., a provider edge router or a provider core router), a virtual router, a route reflector, a regional border router, or another type of router. Additionally or alternatively, the network device 220 may include a gateway, a switch, a firewall, a hub, a bridge, a reverse proxy, a server (e.g., a proxy server, a cloud server, or a data center server), a load balancer, and / or the like. In some implementations, the network device 220 may be a physical device implemented in a housing (such as a chassis). In some implementations, the network device 220 may be a virtual device implemented by one or more computer devices in a cloud computing environment or a data center. In some implementations, a group of network devices 220 may be a group of data center nodes for routing communication flows through the network 240.
[0051] The controller device 230 may include one or more devices capable of receiving, generating, storing, processing, providing, and / or routing information, as described elsewhere herein. The controller device 230 may include a communication device and / or a computing device. For example, the controller device 230 may include a server, such as an application server, a client server, a web server, a database server, a host server, a proxy server, a virtual server (e.g., executed on computing hardware), or a server in a cloud computing system. In some implementations, the controller device 230 may include computing hardware used in a cloud computing environment.
[0052] The network 240 includes one or more wired and / or wireless networks. For example, the network 240 may include a packet-switched network, a cellular network (e.g., a fifth generation (5G) network, a fourth generation (4G) network such as a long term evolution (LTE) network and / or a third generation (3G) network), a code division multiple access (CDMA) network, a public land mobile network (PLMN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), a telephone network (e.g., a public switched telephone network (PSTN)), a private network, an ad hoc network, an intranet, the Internet, a fiber-optic-based network, a cloud computing network, etc., and / or a combination of these or other types of networks.
[0053] Figure 2 The number and arrangement of devices and networks shown in are provided as examples. In practice, Figure 2There may be additional devices and / or networks, fewer devices and / or networks, different devices and / or networks, or a different arrangement of devices and / or networks than those shown. Figure 2 Two or more of the devices shown in may be implemented in a single device, or Figure 2 A single device shown in FIG. 200 may be implemented as multiple, distributed devices. Additionally or alternatively, a set of devices (eg, one or more devices) of environment 200 may perform one or more functions described as being performed by another set of devices of environment 200.
[0054] Figure 3 yes Figure 2 20. The example components may be included in device 300, which may correspond to KME 210, network device 220, and / or controller device 230. In some implementations, KME 210, network device 220, and / or controller device 230 may include one or more devices 300 and / or one or more components of device 300. Figure 3 As shown, device 300 may include a bus 310 , a processor 320 , a memory 330 , an input component 340 , an output component 350 , and a communication interface 360 .
[0055] Bus 310 includes one or more components that enable wired and / or wireless communications between components of device 300. Bus 310 may Figure 3 Two or more components in are coupled together, such as via operational coupling, communication coupling, electronic coupling, and / or electrical coupling. Processor 320 includes a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor, a controller, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), and / or another type of processing component. Processor 320 is implemented in hardware, firmware, or a combination of hardware and software. In some implementations, processor 320 includes one or more processors that can be programmed to perform one or more operations or processes described elsewhere herein.
[0056] Memory 330 includes volatile and / or non-volatile memory. For example, memory 330 may include random access memory (RAM), read-only memory (ROM), a hard drive, and / or another type of memory (e.g., flash memory, magnetic memory, and / or optical memory). Memory 330 may include internal memory (e.g., RAM, ROM, or hard drive) and / or removable memory (e.g., removable via a universal serial bus connection). Memory 330 may be a non-transitory computer-readable medium. Memory 330 stores information, instructions, and / or software (e.g., one or more software applications) related to the operation of device 300. In some implementations, memory 330 includes one or more memories such as coupled to one or more processors (e.g., processor 320) via bus 310.
[0057] Input component 340 enables device 300 to receive input, such as user input and / or sensory input. For example, input component 340 may include a touch screen, a keyboard, a keypad, a mouse, a button, a microphone, a switch, a sensor, a global positioning system sensor, an accelerometer, a gyroscope, and / or an actuator. Output component 350 enables device 300 to provide output, such as via a display, a speaker, and / or a light emitting diode. Communication interface 360 enables device 300 to communicate with other devices via wired connection and / or wireless connection. For example, communication interface 360 may include a receiver, a transmitter, a transceiver, a modem, a network interface card, and / or an antenna.
[0058] Device 300 may perform one or more operations or processes described herein. For example, a non-transitory computer-readable medium (e.g., memory 330) may store an instruction set (e.g., one or more instructions or codes) for execution by processor 320. Processor 320 may execute the instruction set to perform one or more operations or processes described herein. In some implementations, the instruction set is executed by one or more processors 320, so that one or more processors 320 and / or device 300 perform one or more operations or processes described herein. In some implementations, hard-wired circuits may be used instead of instructions or in combination with instructions to perform one or more operations or processes described herein. Additionally or alternatively, processor 320 may be configured to perform one or more operations or processes described herein. Therefore, the implementation described herein is not limited to any particular combination of hardware circuits and software.
[0059] Figure 3 The number and arrangement of components shown in are provided as examples. Figure 3The device 300 may include additional components, fewer components, different components, or components in a different arrangement than the components shown. Additionally or alternatively, a set of components (e.g., one or more components) of the device 300 may perform one or more functions described as being performed by another set of components of the device 300.
[0060] Figure 4 yes Figure 2 400. The example components may be included in device 400. Device 400 may correspond to KME 210 and / or network device 220. In some implementations, KME 210 and / or network device 220 may include one or more devices 400 and / or one or more components of device 400. Figure 4 As shown, the device 400 may include one or more input components 410-1 to 410-B (B≥1) (hereinafter collectively referred to as input component 410, and individually referred to as input component 410), a switch component 420, one or more output components 430-1 to 430-C (C≥1) (hereinafter collectively referred to as output component 430, and individually referred to as output component 430) and a controller 440.
[0061] The input component 410 may be one or more attachment points for a physical link and may be one or more entry points for incoming traffic such as packets. The input component 410 may process incoming traffic, such as by performing data link layer encapsulation or decapsulation. In some implementations, the input component 410 may send and / or receive packets. In some implementations, the input component 410 may include an input line card that includes one or more packet processing components (e.g., in the form of an integrated circuit), such as one or more interface cards (IFCs), a packet forwarding component, a line card controller component, an input port, a processor, a memory, and / or an input queue. In some implementations, the device 400 may include one or more input components 410.
[0062] The switch component 420 can interconnect the input component 410 with the output component 430. In some implementations, the switch component 420 can be implemented via one or more latches, via a bus, and / or through a shared memory. The shared memory can serve as a temporary buffer to store packets from the input component 410 before the packets are ultimately destined for delivery to the output component 430. In some implementations, the switch component 420 can enable the input component 410, the output component 430, and / or the controller 440 to communicate with each other.
[0063] The output component 430 can store packets and can schedule packets for transmission on an output physical link. The output component 430 can support data link layer encapsulation or decapsulation, and / or various higher-level protocols. In some implementations, the output component 430 can send packets and / or receive packets. In some implementations, the output component 430 may include an output line card, which includes one or more packet processing components (e.g., in the form of an integrated circuit), such as one or more IFCs, packet forwarding components, line card controller components, output ports, processors, memories, and / or output queues. In some implementations, the device 400 may include one or more output components 430. In some implementations, the input component 410 and the output component 430 can be implemented by the same set of components (e.g., the input / output component can be a combination of the input component 410 and the output component 430).
[0064] Controller 440 includes a processor in the form of, for example, a CPU, a GPU, an accelerated processing unit (APU), a microprocessor, a microcontroller, a DSP, an FPGA, an ASIC, and / or another type of processor. The processor is implemented in hardware, firmware, or a combination of hardware and software. In some implementations, controller 440 may include one or more processors that can be programmed to perform functions.
[0065] In some implementations, the controller 440 may include RAM, ROM, and / or another type of dynamic or static storage device (eg, flash memory, magnetic storage, optical storage, etc.) that stores information and / or instructions for use by the controller 440 .
[0066] In some implementations, the controller 440 can communicate with other devices, networks, and / or systems connected to the device 400 to exchange information about the network topology. The controller 440 can create a routing table based on the network topology information, can create a forwarding table based on the routing table, and can forward the forwarding table to the input component 410 and / or the output component 430. The input component 410 and / or the output component 430 can use the forwarding table to perform a routing lookup on the incoming and / or outgoing packets.
[0067] The controller 440 may perform one or more of the processes described herein. The controller 440 may perform these processes in response to executing software instructions stored by a non-transitory computer-readable medium. The computer-readable medium is defined herein as a non-transitory storage device. The storage device includes storage space within a single physical storage device or storage space distributed across multiple physical storage devices.
[0068] The software instructions may be read into a memory and / or storage component associated with the controller 440 from another computer-readable medium or from another device via a communication interface. When executed, the software instructions stored in the memory and / or storage component associated with the controller 440 may cause the controller 440 to perform one or more processes described herein. Additionally or alternatively, hardwired circuitry may be used in place of or in combination with software instructions to perform one or more processes described herein. Thus, the implementations described herein are not limited to any specific combination of hardware circuitry and software.
[0069] Figure 4 The number and arrangement of components shown in the figure are provided as examples. In actual operation, Figure 4 The device 400 may include additional components, fewer components, different components, or components in a different arrangement than those shown. Additionally or alternatively, a component set (e.g., one or more components) of the device 400 may perform one or more functions described as being performed by another component set of the device 400.
[0070] Figure 5 is a flow chart of an example process 500 for providing proof of QKD key delivery origin and transmission. In some implementations, Figure 5 One or more process blocks in may be performed by a network device (e.g., network device 220). In some implementations, Figure 5 One or more process blocks in may be performed by another device or group of devices separate from or including the network device, such as a KME (e.g., KME 210) and / or a controller device (e.g., controller device 230). Additionally or alternatively, Figure 5 One or more process blocks of may be performed by one or more components of device 300, such as processor 320, memory 330, input component 340, output component 350, and / or communication interface 360. Additionally or alternatively, Figure 5 One or more process blocks of may be performed by one or more components of device 400 , such as input component 410 , switch component 420 , output component 430 , and / or controller 440 .
[0071] like Figure 5 As shown, process 500 may include generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points (block 510). For example, as described above, the device may generate a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points.
[0072] like Figure 5As shown, process 500 may include generating a main path from the first network device to the second network device via the first set of intermediate network devices based on the first polynomial (block 520). For example, as described above, the device may generate a main path from the first network device to the second network device via the first set of intermediate network devices based on the first polynomial. In some implementations, the first network device is a first key management entity at a first endpoint of the quantum link, and the second network device is a second key management entity at a second endpoint of the quantum link.
[0073] like Figure 5 As further shown, process 500 may include generating an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on the second polynomial (block 530). For example, as described above, the device may generate an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on the second polynomial. In some implementations, the first network device is configured to provide packets to the second network device via the primary path and via the auxiliary path. In some implementations, the first set of intermediate network devices is configured to calculate a first cumulative value associated with the first key, and the second set of intermediate network devices is configured to calculate a second cumulative value associated with the second key.
[0074] In some implementations, the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key, the second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key, and the first cumulative value is independent of the first key, and the second cumulative value is independent of the second key. In some implementations, the primary path is associated with the first quantum link, and the auxiliary path is associated with the second quantum link.
[0075] like Figure 5 As further shown, process 500 may include distributing points of the first polynomial as a share of the secret to the device and to each of the first set of intermediate network devices (block 540). For example, as described above, the device may distribute points of the first polynomial as a share of the secret to the device and to each of the first set of intermediate network devices. In some implementations, the points of the first polynomial distributed to each of the first set of intermediate network devices correspond to intermediate network devices of the first set of intermediate network devices provided along the primary path.
[0076] like Figure 5As further shown, process 500 may include distributing points of the second polynomial as a share of the secret to the controller device and to each of the second set of intermediate network devices (block 550). For example, as described above, the device may distribute points of the second polynomial to the device and to each of the second set of intermediate network devices. In some implementations, the points of the second polynomial distributed to each of the second set of intermediate network devices correspond to intermediate network devices of the second set of intermediate network devices provided along the auxiliary path.
[0077] like Figure 5 As further shown, process 500 may include providing a primary path from the first network device to the second network device via the first set of intermediate network devices based on allocating points of the first polynomial (block 560). For example, as described above, the device may provide a primary path from the first network device to the second network device via the first set of intermediate network devices based on allocating points of the first polynomial.
[0078] like Figure 5 As further shown, process 500 may include providing an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on allocating points of the second polynomial (block 570). For example, as described above, the device may provide an auxiliary path from the first network device to the second network device via the second set of intermediate network devices based on allocating points of the second polynomial.
[0079] In some implementations, process 500 includes receiving a first cumulative value and a second cumulative value from a second network device. In some implementations, process 500 includes determining whether the first cumulative value and the second cumulative value are verified, and based on the first cumulative value and the verified second cumulative value, selectively: validating the first key and the second key, or invalidating the first key or the second key based on the first cumulative value and the second cumulative value not being verified. In some implementations, process 500 includes revoking the first key or the second key based on invalidating the first key or the second key. In some implementations, process 500 includes verifying that the first cumulative value and the second cumulative value are associated with different paths, and validating the first key and the second key based on verifying that the first cumulative value and the second cumulative value are associated with different paths.
[0080] In some implementations, process 500 includes verifying, based on the first cumulative value and the second cumulative value, that the first network device retrieved the first key from a different source than a source of the second key retrieved by the second network device.
[0081] although Figure 5 An example block diagram of process 500 is shown, but in some implementations, Figure 5Process 500 may include additional blocks, fewer blocks, different blocks, or blocks in a different arrangement than those depicted in . Additionally or alternatively, two or more blocks of process 500 may be performed in parallel.
[0082] Some example implementations of the present disclosure are listed below.
[0083] Example 1. A method comprising:
[0084] generating, by a device, a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points;
[0085] generating, by the device and based on the first polynomial, a primary path from a first network device to a second network device via a first set of intermediate network devices;
[0086] generating, by the device and based on the second polynomial, an auxiliary path from the first network device to the second network device via a second set of intermediate network devices;
[0087] Distributing, by the device, points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices;
[0088] Distributing, by the device, points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices;
[0089] providing, by the device based on allocating the points of the first polynomial, the primary path from the first network device to the second network device via the first set of intermediate network devices; and
[0090] The auxiliary path is provided by the device from the first network device to the second network device via the second set of intermediate network devices based on assigning the points of the second polynomial.
[0091] Example 2. The method of Example 1, wherein the first network device is configured to provide packets to the second network device via the primary path and via the auxiliary path.
[0092] Example 3. The method of Examples 1-2, wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key, and
[0093] The second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key.
[0094] Example 4. The method according to examples 1-3 further includes:
[0095] The first accumulated value and the second accumulated value are received from the second network device.
[0096] Example 5. The method according to examples 1-4 further includes:
[0097] determining whether the first cumulative value and the second cumulative value are verified; and
[0098] Optionally:
[0099] validating the first key and the second key based on the first cumulative value and the second cumulative value being verified, or
[0100] Based on the first cumulative value and the second cumulative value not being verified, the first key or the second key is invalidated.
[0101] Example 6. The method according to examples 1-5 further includes:
[0102] Based on invalidating the first key or the second key, revoking the first key or the second key.
[0103] Example 7. The method according to examples 1-6 further includes:
[0104] verifying that the first accumulated value and the second accumulated value are associated with different paths; and
[0105] The first key and the second key are validated based on verifying that the first accumulated value and the second accumulated value are associated with different paths.
[0106] Example 8. A device comprising:
[0107] one or more memories; and
[0108] One or more processors to:
[0109] generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points;
[0110] Based on the first polynomial, generating a main path from the first network device to the second network device via the first set of intermediate network devices;
[0111] Based on the second polynomial, generating an auxiliary path from the first network device to the second network device via a second set of intermediate network devices;
[0112] wherein the first network device is configured to provide packets to the second network device via the primary path and via the auxiliary path;
[0113] distributing points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices;
[0114] distributing points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices;
[0115] Based on assigning the points of the first polynomial, causing the primary path to be provided from the first network device to the second network device via the first set of intermediate network devices; and
[0116] Based on assigning the points of the second polynomial, the auxiliary path is provided from the first network device to the second network device via the second set of intermediate network devices.
[0117] Example 9. The device of Example 8, wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key;
[0118] wherein the second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key, and
[0119] The first accumulated value is independent of the first key, and the second accumulated value is independent of the second key.
[0120] Example 10. The apparatus of Examples 8-9, wherein the one or more processors are further configured to:
[0121] Based on the first cumulative value and the second cumulative value, verifying that the first network device retrieved the first key from a different source than a source of the second key, which was retrieved by the second network device.
[0122] Example 11. The device of Examples 8-10, wherein the points of the first polynomial assigned to each intermediate network device in the first set of intermediate network devices correspond to intermediate network devices of the first set of intermediate network devices provided along the primary path.
[0123] Example 12. The device of Examples 8-11, wherein the point of the second polynomial assigned to each intermediate network device in the second set of intermediate network devices corresponds to an intermediate network device of the second set of intermediate network devices provided along the auxiliary path.
[0124] Example 13. The apparatus of Examples 8-12, wherein the first network device is a first key management entity at a first endpoint of a quantum link, and
[0125] The second network device is a second key management entity at a second endpoint of the quantum link.
[0126] Example 14. The apparatus of Examples 8-13, wherein the primary path is associated with a first quantum link and the auxiliary path is associated with a second quantum link.
[0127] Example 15. A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising:
[0128] One or more instructions that, when executed by one or more processors of a device, cause the device to:
[0129] generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points;
[0130] Based on the first polynomial, generating a main path from the first network device to the second network device via the first set of intermediate network devices;
[0131] Based on the second polynomial, generating an auxiliary path from the first network device to the second network device via a second set of intermediate network devices;
[0132] wherein the primary path is associated with a first quantum link, and the auxiliary path is associated with a second quantum link;
[0133] distributing points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices;
[0134] distributing points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices;
[0135] Based on assigning the points of the first polynomial, causing the primary path to be provided from the first network device to the second network device via the first set of intermediate network devices; and
[0136] Based on assigning the points of the second polynomial, the auxiliary path is provided from the first network device to the second network device via the second set of intermediate network devices.
[0137] Example 16. The non-transitory computer-readable medium of Example 15, wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key, and
[0138] The second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key.
[0139] Example 17. The non-transitory computer-readable medium of Examples 15-16, wherein the one or more instructions further cause the device to:
[0140] The first accumulated value and the second accumulated value are received from the second network device.
[0141] Example 18. The non-transitory computer-readable medium of Examples 15-17, wherein the one or more instructions further cause the device to:
[0142] determining whether the first cumulative value and the second cumulative value are verified; and
[0143] Optionally:
[0144] validating the first key and the second key based on the first cumulative value and the second cumulative value being verified, or
[0145] Based on the first cumulative value and the second cumulative value not being verified, the first key or the second key is invalidated.
[0146] Example 19. The non-transitory computer-readable medium of Examples 15-18, wherein the one or more instructions further cause the device to:
[0147] Based on invalidating the first key or the second key, revoking the first key or the second key.
[0148] Example 20. The non-transitory computer-readable medium of Examples 15-19, wherein the one or more instructions further cause the device to:
[0149] verifying that the first accumulated value and the second accumulated value are associated with different paths; and
[0150] The first key and the second key are validated based on verifying that the first accumulated value and the second accumulated value are associated with different paths.
[0151] The above disclosure provides illustration and description, but is not intended to be exhaustive or to limit the implementations to the precise form disclosed. Modifications may be made in light of the above disclosure or may be acquired from actual operation of the implementations.
[0152] As used herein, the term "component" is intended to be broadly interpreted as hardware, firmware, or a combination of hardware and software. It is apparent that the systems and / or methods described herein may be implemented in various forms of hardware, firmware, and / or a combination of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods does not limit the implementation. Therefore, the operation and behavior of the systems and / or methods are described herein without reference to specific software code - it should be understood that software and hardware may be used to implement the systems and / or methods based on the description herein.
[0153] Although particular combinations of features are recited in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of various implementations. In fact, many of these features may be combined in ways not specifically recited in the claims and / or disclosed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of various implementations includes the combination of each dependent claim with every other claim in the claim set.
[0154] Unless explicitly described in this way, any element, behavior or instruction used herein should not be interpreted as key or necessary. In addition, as used herein, the articles "one" and "an" are intended to include one or more projects, and can be used interchangeably with "one or more". In addition, as used herein, the article "the" is intended to include one or more reference items related to the article "the", and can be used interchangeably with "one or more". In addition, as used herein, the term "set" is intended to include one or more projects (e.g., related projects, unrelated projects, combinations of related and unrelated projects, etc.), and can be used interchangeably with "one or more". In the case of only intending to include one project, the phrase "only one" or similar language is used. In addition, as used herein, the terms "have", "have", "have" etc. are intended to be open terms. In addition, unless otherwise clearly stated, the term "based on" is intended to mean "at least partially based on". In addition, as used herein, the term "or" is intended to be included when used for a series, and unless otherwise clearly stated (e.g., if used in combination with "one of them" or "only one of them"), it can be used interchangeably with "and / or".
[0155] In the foregoing description, various example embodiments have been described with reference to the accompanying drawings. However, it will be apparent that various modifications and changes may be made thereto, and that additional embodiments may be implemented, without departing from the broader scope of the invention as set forth in the following claims. Accordingly, the description and drawings should be regarded as illustrative rather than restrictive.
Claims
1. A method comprising: generating, by a device, a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points; generating, by the device and based on the first polynomial, a primary path from a first network device to a second network device via a first set of intermediate network devices; generating, by the device and based on the second polynomial, an auxiliary path from the first network device to the second network device via a second set of intermediate network devices; Distributing, by the device, points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices; Distributing, by the device, points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices; providing, by the device based on allocating the points of the first polynomial, the primary path from the first network device to the second network device via the first set of intermediate network devices; as well as The auxiliary path is provided by the device from the first network device to the second network device via the second set of intermediate network devices based on assigning the points of the second polynomial. 2 . The method of claim 1 , wherein the first network device is configured to provide packets to the second network device via the primary path and via the auxiliary path.
3. The method of claim 1 , wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key, and The second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key.
4. The method according to claim 3, further comprising: The first accumulated value and the second accumulated value are received from the second network device.
5. The method according to claim 4, further comprising: determining whether the first cumulative value and the second cumulative value are verified; as well as Optionally: validating the first key and the second key based on the first cumulative value and the second cumulative value being verified, or Based on the first cumulative value and the second cumulative value not being verified, the first key or the second key is invalidated.
6. The method according to claim 5, further comprising: Based on invalidating the first key or the second key, revoking the first key or the second key.
7. The method according to claim 4, further comprising: verifying that the first accumulated value and the second accumulated value are associated with different paths; as well as The first key and the second key are validated based on verifying that the first accumulated value and the second accumulated value are associated with different paths.
8. A device comprising: one or more memories; as well as One or more processors to: generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points; Based on the first polynomial, generating a main path from the first network device to the second network device via the first set of intermediate network devices; Based on the second polynomial, generating an auxiliary path from the first network device to the second network device via a second set of intermediate network devices; wherein the first network device is configured to provide packets to the second network device via the primary path and via the auxiliary path; distributing points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices; distributing points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices; Based on assigning the points of the first polynomial, causing the primary path to be provided from the first network device to the second network device via the first set of intermediate network devices; as well as Based on assigning the points of the second polynomial, the auxiliary path is provided from the first network device to the second network device via the second set of intermediate network devices.
9. The device of claim 8, wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key; wherein the second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key, and The first accumulated value is independent of the first key, and the second accumulated value is independent of the second key.
10. The device of claim 8, wherein the one or more processors are further configured to: Based on the first cumulative value and the second cumulative value, verifying that the first network device retrieved the first key from a different source than a source of the second key, which was retrieved by the second network device.
11. The device of claim 8, wherein the points of the first polynomial assigned to each intermediate network device in the first set of intermediate network devices correspond to intermediate network devices of the first set of intermediate network devices provided along the primary path.
12. The device according to claim 8, wherein the point of the second polynomial assigned to each intermediate network device in the second set of intermediate network devices corresponds to an intermediate network device of the second set of intermediate network devices provided along the auxiliary path.
13. The apparatus of claim 8, wherein the first network device is a first key management entity at a first endpoint of a quantum link, and The second network device is a second key management entity at a second endpoint of the quantum link.
14. The apparatus of claim 8, wherein the primary path is associated with a first quantum link and the auxiliary path is associated with a second quantum link.
15. A non-transitory computer readable medium storing a set of instructions, the set of instructions comprising: One or more instructions that, when executed by one or more processors of a device, cause the device to: generating a first polynomial having a degree and a certain number of points and a second polynomial having the degree and the certain number of points; Based on the first polynomial, generating a main path from the first network device to the second network device via the first set of intermediate network devices; Based on the second polynomial, generating an auxiliary path from the first network device to the second network device via a second set of intermediate network devices; wherein the primary path is associated with a first quantum link, and the auxiliary path is associated with a second quantum link; distributing points of the first polynomial as secret shares to the device and to each intermediate network device in the first set of intermediate network devices; distributing points of the second polynomial as shares of the secret to the device and to each intermediate network device in the second set of intermediate network devices; Based on assigning the points of the first polynomial, causing the primary path to be provided from the first network device to the second network device via the first set of intermediate network devices; as well as Based on assigning the points of the second polynomial, the auxiliary path is provided from the first network device to the second network device via the second set of intermediate network devices.
16. The non-transitory computer-readable medium of claim 15, wherein the first set of intermediate network devices is configured to calculate a first cumulative value associated with a first key, and The second set of intermediate network devices is configured to calculate a second cumulative value associated with a second key.
17. The non-transitory computer readable medium of claim 16, wherein the one or more instructions further cause the device to: The first accumulated value and the second accumulated value are received from the second network device.
18. The non-transitory computer readable medium of claim 17, wherein the one or more instructions further cause the device to: determining whether the first cumulative value and the second cumulative value are verified; and Optionally: validating the first key and the second key based on the first cumulative value and the second cumulative value being verified, or Based on the first cumulative value and the second cumulative value not being verified, the first key or the second key is invalidated.
19. The non-transitory computer readable medium of claim 18, wherein the one or more instructions further cause the device to: Based on invalidating the first key or the second key, revoking the first key or the second key.
20. The non-transitory computer readable medium of claim 17, wherein the one or more instructions further cause the device to: verifying that the first accumulated value and the second accumulated value are associated with different paths; and The first key and the second key are validated based on verifying that the first accumulated value and the second accumulated value are associated with different paths.
