CN-122001572-A - Group quantum key distribution method and system

CN122001572ACN 122001572 ACN122001572 ACN 122001572ACN-122001572-A

Abstract

The invention discloses a group quantum key distribution method and system, and relates to the field of quantum communication. The method comprises the steps of enabling a management and control center to respond to a multi-party group key distribution request, determining distribution nodes and receiving nodes, determining a group key distribution relay path based on the topological relation among the distribution nodes, the relay nodes and the receiving nodes, the relay link resource state and the total consumption of the relay keys, wherein the path is a branching directed tree constructed after repeating relay links and reserving unique effective links are removed along the quantum key relay transmission direction, the distribution nodes and all the receiving nodes can be connected in one way, the distribution nodes generate group keys and initiate a distribution flow based on the path, the relay nodes execute key distribution relay based on the path, and the receiving nodes acquire the group keys through the path. According to the scheme, the node load is reduced by reducing the relay times, so that resource waste is avoided, the code rate is improved, the system performance is optimized, and the method is suitable for a large-scale multiparty group allocation scene.

Inventors

Li Wulu
MA HUILAI

Assignees

长春吉大正元信息技术股份有限公司

Dates

Publication Date: 20260508
Application Date: 20260201

Claims (10)

1. A group quantum key distribution method is characterized in that, The management and control center responds to the multi-party group key distribution request to determine a group key distribution node and a group key distribution node The number of receiving nodes in the network is, ; The management and control center determines a group key distribution relay path based on the topology relation of the distribution node, the relay node and each receiving node, the relay link resource state and the total consumption of the relay key, wherein the group key distribution relay path is a bifurcation directed tree structure constructed after repeating relay links are removed and unique effective links are reserved along the quantum key relay transmission direction, and the structure is communicated with the distribution node and all receiving nodes in one direction; the distribution node generates a group key and initiates a group key distribution flow based on the group key distribution relay path; the relay node performs key distribution relay based on the group key distribution relay path; the receiving node obtains the group key based on the group key distribution relay path.
2. The method of claim 1, wherein the management center determines a group key distribution node and a group key distribution node in response to a multi-party group key distribution request The receiving nodes specifically comprise: the control center designates preset user nodes in the group as distribution nodes; Or selecting the user node with the lowest feasible path cost value to other user nodes as the distribution node.
3. The method for distributing group quantum keys according to claim 1, wherein the managing and controlling center determines the group key distribution relay path based on the distribution node, the topological relation between the relay node and each receiving node, the relay link resource status, and the total consumption of the relay key, comprising: enumerating feasible paths from the distribution node to each receiving node, calculating the cost value of each feasible path, and screening to obtain a candidate path set of each receiving node; Selecting a feasible path from the candidate path set of each receiving node, removing repeated relay links according to the relay transmission direction of the quantum key, and reserving unique effective links to form a directed tree from the distribution node to each receiving node; And calculating the overall transmission cost value of each directed tree, and selecting the directed tree with the minimum overall transmission cost value as the group key distribution relay path.
4. The method for distributing group quantum keys according to claim 3, wherein enumerating feasible paths from the distribution node to each receiving node, calculating cost values of each feasible path, and screening to obtain candidate path sets of each receiving node comprises: Calculating key supply generation time consumption and relay key consumption of each feasible path; the time consumption of key supply generation and the consumption of the relay key are weighted and summed according to preset weights, and cost values of all feasible paths are obtained; Sorting according to the order of the cost values of all feasible paths from small to large, and screening the materials before Bar(s) ) The path is taken as a candidate path set for each receiving node.
5. The group quantum key distribution method of claim 4, wherein the key supply generation time of the viable paths is calculated as follows: Calculating the difference value between the pre-generated key reserve of the relay node corresponding to each single-segment relay link in the feasible path and the current group key quantity to be distributed, wherein if the difference value is greater than or equal to 0, 0 is taken as a calculated value; Marking the quotient of the calculated value and the expected key generation rate of the single-segment relay link as the key supply generation time consumption of the single-segment relay link; In a hop-by-hop quantum key distribution mode, the key supply generation time of the feasible path is the sum of the key supply generation time of all single-segment relay links under the feasible path; in the centralized quantum key distribution mode, the key supply generation time of the feasible path is the maximum value of the time consumption generated for each single-segment relay link key supply in the feasible path.
6. The group quantum key distribution method of claim 4, wherein the feasible path relay key consumption is a product of the amount of the group key to be distributed and the feasible path relay hop count.
7. The method for distributing group quantum key according to claim 3, wherein each of the candidate paths of each receiving node selects a feasible path, eliminates all repeated relay links and retains unique valid links according to the transmission direction of the quantum key relay, and forms a directed tree from the distributing node to each receiving node, comprising: Respectively selecting one feasible path from candidate path sets corresponding to all receiving nodes to obtain quantum key relay transmission paths of a plurality of groups of single receiving nodes; Combining and deduplicating repeated continuous relay links in the multiple groups of transmission paths by taking the quantum key relay transmission direction as a directional reference, and reserving a unique effective relay link; Based on all the combined unique effective relay links, the unique effective relay links are sequentially connected according to the relay transmission direction of the quantum key to form a directed tree taking the distribution node as a root node and each receiving node as a leaf node.
8. A group quantum key distribution method as claimed in claim 3, wherein the calculating the overall transmission cost value of each directed tree comprises: In a hop-by-hop type quantum key distribution mode, the overall transmission cost value of the directed tree is a weighted sum of a maximum time consumption value generated by supplying a path key to each receiving node and the overall relay key consumption of the directed tree according to a preset weight; in the centralized quantum key distribution mode, the whole transmission cost value of the directed tree is a weighted sum of the maximum time consumption generated by key supply of a single-segment relay link in a path to each receiving node and the whole consumption of the directed tree key according to a preset weight.
9. The method for distributing group quantum keys according to claim 8, wherein the overall key consumption of the directed tree is a product of the group key quantity to be distributed and the number of relay hops contained in the directed tree, wherein the number of relay hops corresponding to a common relay link in the directed tree is counted only once.
10. The group quantum key distribution system comprises a management and control center, a distribution node, a relay node and a receiving node, and is characterized in that: the management and control center is used for responding to the multi-party group key distribution request and determining a group key distribution node and a group key distribution node The number of receiving nodes in the network is, Determining a group key distribution relay path based on the topological relation between the distribution node, the relay node and each receiving node, the relay link resource state and the total consumption of the relay key, wherein the group key distribution relay path is in a relay transmission direction along a quantum key, all repeated relay links are removed, and only effective links are reserved, and the constructed bifurcation directional tree structure can be used for unidirectionally communicating the distribution node and all receiving nodes; the distribution node is used for generating a group key and initiating a key distribution flow based on the group key distribution relay path; The relay node is used for executing key distribution relay based on the group key distribution relay path; the receiving node is configured to obtain the group key based on the group key distribution relay path.

Description

Group quantum key distribution method and system Technical Field The application relates to the technical field of quantum communication, in particular to a group quantum key distribution method and system. Background With the development of quantum computing technology, the quantum algorithm can crack traditional public key encryption algorithms such as RSA, ECC and the like in polynomial time, and the traditional encryption system faces serious security challenges. Quantum Key Distribution (QKD) relies on quantum mechanics principles, has unconditional security and adversary detection slump, and becomes a core solution for high-security communication. However, the QKD has the problem of reduced code rate index in long-distance transmission, the prior art is mostly broken through by a relay technology, and mainly comprises two modes, namely hop-by-hop relay disassembles long-distance transmission into short-distance QKD for many times, relay nodes forward keys hop by hop through exclusive or operation, and centralized relay uniformly processes key negotiation and forwarding by a management and control node, wherein both modes can effectively improve long-distance transmission efficiency. In business scenes such as multi-party communication, group collaboration and the like, a plurality of participants often need to rely on a shared key to develop applications such as communication, data transmission, file sharing, multiparty video conference and the like. However, conventional QKD techniques only support two-party point-to-point trusted key distribution, and it is difficult to meet the core appeal of multiparty group key distribution. Even depending on the relay technology, the existing group key distribution scheme still needs to respectively execute independent point-to-point QKD by an initiator and a plurality of receivers in the group, and the group distribution is disassembled into multiple two-party communication. The mode causes the relay node to repeatedly execute the key negotiation, so that the relay node has a plurality of relay hops and serious key resource waste, the load of the relay node is too high, and as the group scale is enlarged, the system performance short boards are more prominent, and the high-efficiency and safe key distribution requirements under the multiparty cooperation scene cannot be adapted. Therefore, there is a need to develop a quantum key distribution scheme supporting multiparty key distribution, so as to achieve multiparty efficient and safe acquisition of group quantum keys. Disclosure of Invention The invention provides a group quantum key distribution path selection method, a device and a storage medium, and aims to solve the technical problems that in service scenes such as group cooperation, the existing group quantum key distribution scheme is realized through multiple independent two-party communication, and further the number of relay hops is large, the load of relay nodes is too high, the key resource waste is serious and the distribution efficiency is low. In order to achieve the above purpose, the application adopts the following technical scheme: In a first aspect, a group quantum key distribution method is provided, the method comprising: the management and control center responds to the multi-party group key distribution request to determine a group key distribution node and a group key distribution node The number of receiving nodes in the network is,; The management and control center determines a group key distribution relay path based on the topology relation of the distribution node, the relay node and each receiving node, the relay link resource state and the total consumption of the relay key, wherein the group key distribution relay path is a bifurcation directed tree structure constructed after repeating relay links are removed and unique effective links are reserved along the quantum key relay transmission direction, and the structure is communicated with the distribution node and all receiving nodes in one direction; the distribution node generates a group key and initiates a group key distribution flow based on the group key distribution relay path; the receiving node obtains the group key based on the group key distribution relay path. In a second aspect, a group quantum key distribution system is provided, the system comprising a management and control center, a distribution node, a relay node and a receiving node, wherein: the management and control center is used for responding to the multi-party group key distribution request and determining the group key distribution node and the group key distribution node The number of receiving nodes in the network is,; Determining a group key distribution relay path based on the topological relation between a distribution node, a relay node and each receiving node, the relay link resource state and the total consumption of a relay key, wherein the group key distribution relay path is a bifurcation d