Movatterモバイル変換


[0]ホーム

URL:


CN112260825B - Quantum key synchronization system and method based on hierarchical tree cluster unit - Google Patents

Quantum key synchronization system and method based on hierarchical tree cluster unit
Download PDF

Info

Publication number
CN112260825B
CN112260825BCN202010997517.8ACN202010997517ACN112260825BCN 112260825 BCN112260825 BCN 112260825BCN 202010997517 ACN202010997517 ACN 202010997517ACN 112260825 BCN112260825 BCN 112260825B
Authority
CN
China
Prior art keywords
node
tree cluster
key
level
unit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010997517.8A
Other languages
Chinese (zh)
Other versions
CN112260825A (en
Inventor
丁胜建
黄翔
封连重
陈斌
石建军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Quantum Technologies Co ltd
Original Assignee
Zhejiang Quantum Technologies Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Quantum Technologies Co ltdfiledCriticalZhejiang Quantum Technologies Co ltd
Priority to CN202010997517.8ApriorityCriticalpatent/CN112260825B/en
Publication of CN112260825ApublicationCriticalpatent/CN112260825A/en
Application grantedgrantedCritical
Publication of CN112260825BpublicationCriticalpatent/CN112260825B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Images

Classifications

Landscapes

Abstract

A quantum key synchronization system and method based on a hierarchical tree cluster unit comprises a quantum key synchronization system based on the hierarchical tree cluster unit and is composed of a plurality of tree cluster units, and a topology unit is divided into a top layer tree cluster unit, a two-layer tree cluster unit and an N-layer tree cluster unit according to network planning and logic levels. Compared with the prior art, the invention is based on the global tree cluster relation table for recording the node membership, and the two nodes can obtain the shared key from the top-level node with the closest membership, thereby reducing the complexity, communication and calculation pressure of each central node, and avoiding the defects that the complexity and communication calculation pressure of a single central node in a large-scale network structure are too high, and the system performance and stability are influenced; meanwhile, by adopting the topological structure of the multi-center multi-level tree cluster unit, the method can be applied to large-scale multi-party encryption communication scenes, removes the limitation for quantum communication practicality, can flexibly expand the network topology, and reduces the deployment cost of quantum channels to a certain extent.

Description

Quantum key synchronization system and method based on hierarchical tree cluster unit
Technical Field
The invention relates to the technical field of optical transmission safety communication, in particular to a quantum key synchronization system and method based on a hierarchical tree cluster unit.
Background
In recent years, Quantum communication technology has been rapidly developed, and in the process of practical application of Quantum communication, Quantum Key Distribution (QKD) technology applied to highly secure communication has attracted high attention and has been greatly developed, and a Quantum Key Distribution network has become a new research direction as a secure communication network.
In a current quantum key distribution network, a quantum key can be generated between two QKD terminals connected with each other through a quantum key distribution link, the QKD terminals are usually deployed at a network node, and when the network node needs quantum key encryption for data transmission, the node acquires a synchronized quantum key from the corresponding QKD terminal. Due to the limited performance of the quantum key generation rate, the available transmission distance and the like of the point-to-point QKD, the quantum key synchronization among multiple nodes is usually realized based on multi-stage relay in the existing method, and the topological structure is generally a simple tree. The disclosure of the invention is a patent document with a publication number of CN107094078A entitled "quantum key synchronization system and synchronization method based on multi-stage relay".
The problems existing in the prior art are as follows:
1. the network topology expansibility of the quantum key synchronization system is poor, the quantum key synchronization system is difficult to adapt to the diversified and complicated requirements of data transmission among multiple nodes in a common network, and the complex network topology is difficult to deploy and realize;
2. the central node needs to be responsible for quantum key synchronization of the non-direct-connected nodes, when the number of the nodes is increased, the calculation amount, the data transmission amount and the complexity of the central node are multiplied in an exponential relationship, and the system performance and the stability are seriously influenced; bottlenecks exist in the computing, bandwidth, storage and other capabilities of the central node, and unlimited capacity expansion of the central node is impractical;
3. compared with a structure taking a tree cluster unit as a network topology unit and a method of multi-center parallel quantum key synchronization service, quantum key synchronization of a single center node is long in time consumption and low in efficiency.
Disclosure of Invention
The invention aims to provide a quantum key synchronization system and method based on a hierarchical tree cluster unit, and aims to solve the technical defects that in the prior art, the quantum key synchronization system has poor topological structure expandability, has the defects that the complexity of a central node increases exponentially along with the increase of the number of nodes, has long synchronization time consumption and low efficiency, cannot be applied to the application occasions of multi-party communication of large-scale and complex network topological structures, and causes great limitation on quantum communication practicability. The technical scheme of the invention is realized as follows:
a hierarchical tree cluster unit based quantum key synchronization system, comprising:
the top-level node is a central node and comprises a top-level quantum key management server and QKD equipment;
a relay node comprising a quantum key relay server and a QKD device;
a last-level node, which is a central node and comprises a last-level quantum key management server and a QKD device;
the key synchronization tree cluster topology unit consists of a top level node, a plurality of relay nodes and a plurality of final level nodes, and is respectively defined as a top level tree cluster unit, a two-level tree cluster unit and an N-level tree cluster unit according to the sequence of logic hierarchy from high to low;
the tree cluster unit expansion interface is positioned at a top-level node and a last-level node and is used for expanding a network structure;
when a tree cluster unit is internally networked, all nodes report own logic status to a top level node, and finally a tree cluster relation table is formed at the top level node and records node attributes, connection relations and logic membership information of all nodes in the tree cluster unit;
the tree cluster units in each layer have consistent structures and consist of a top-level node, a plurality of relay nodes and a plurality of final-level nodes, the tree cluster units in each layer respectively complete key synchronization of the nodes in the units, and the nodes in the units can be connected with user terminals to output symmetric keys to the user terminals.
Preferably, a connection expansion interface is reserved for both the top node and the relay node of the tree cluster unit, and is provided in the following manner:
when a new node is expanded through a top-level node, a newly added last-level node can be directly connected with the top-level node or connected with the top-level node through a new relay node;
when a new node is expanded through the relay node, the newly added last-stage node can be connected with the top-stage node through the original relay node, or the new relay node is connected with the original relay node and finally connected with the top-stage node.
Preferably, after expanding the new node in the cluster according to the method, the method further includes:
the newly added final node reports node information to the top node in the cluster, the tree cluster unit updates the global tree cluster relation table, and respectively initiates global tree cluster relation table updating requests upwards and downwards, and finally other tree cluster units update the newly added node information to the corresponding logic positions of the global tree cluster relation table.
Preferably, the tree cluster unit expansion interface is provided by:
upward expansion, wherein the top level node provides an upward tree cluster unit interface for expanding a new tree cluster unit at a relatively high level, and the hierarchical relation of each tree cluster unit in the original network is lifted according to the actual situation;
and (3) expanding downwards, wherein a last-stage node provides a downward tree cluster unit interface for expanding new tree cluster units of relatively lower layers, the hierarchical relation of other tree cluster units in the original network is unchanged, and if the unit to which the last-stage node belongs is the N-layer tree cluster unit, the newly added unit is the N + 1-layer tree cluster unit.
Preferably, after expanding the new tree cluster unit according to the method, the method further includes:
for upward expansion, if other high-level tree cluster units in the same level exist, the level relation does not need to be changed, and the tree cluster unit of the current level only needs to report a global tree cluster relation table to the newly expanded high-level tree cluster unit;
for upward expansion, if other high-level tree cluster units in the same hierarchy do not exist, the newly-added tree cluster unit is the top-level tree cluster unit, and the tree cluster unit of the layer only needs to report a global tree cluster relation table to the newly-expanded high-level tree cluster unit;
for downward expansion, the newly added tree cluster unit is an N +1 layer, the hierarchical relationship does not need to change, the tree cluster unit of the layer reports the updated tree cluster relationship table to the tree cluster unit of the upper layer after receiving the tree cluster relationship table of the newly added tree cluster unit and updating the local tree cluster relationship table, and by analogy, the update of the global tree cluster relationship table is completed.
Preferably, the nodes are allowed to be multiplexed by a plurality of tree cluster units,
the top level node can be reused as a last level node of a plurality of upper-level tree cluster units;
the last node can be multiplexed as a last node of a plurality of peer tree cluster units.
The invention also provides a quantum key synchronization method based on the hierarchical tree cluster unit, which is implemented in a quantum key synchronization system for distributing quantum keys to user terminals,
1) each node in the same tree cluster unit forms a network according to a preset topology, connection is established between a last-stage node and a relay node, and between the relay node and a top-stage node, the relay node reports a node connection relation to the upper-stage node after receiving connection of lower-stage nodes, and finally a complete local tree cluster relation table is established at the top-stage node;
2) after the local tree cluster relation table of each tree cluster unit is established, from bottom to top, the lower tree cluster unit reports the tree cluster relation table to the upper tree cluster unit, and the upper tree cluster unit receives the table and inserts the table into the global tree cluster relation table as a subordinate table;
3) finally, a global tree cluster relation table for recording global complete topology is established by the top layer tree cluster unit, then from top to bottom, the upper layer tree cluster unit sends the global tree cluster relation table to the lower layer tree cluster unit, the lower layer tree cluster unit receives and updates the global tree cluster relation table, and finally, the global tree cluster relation table is established by all the tree cluster units;
4) in the same tree cluster unit, any pair of adjacent nodes are directly connected through a quantum channel, and a consistent quantum key is synchronously arranged between the two nodes through QKD;
5) the last-level node takes the relay node as a relay, initiates a key synchronization request to the top-level node, and specifies the ID of the key to be synchronized;
6) the relay node takes out the key to be synchronized from the key pool of the node according to the ID of the key to be synchronized, encrypts the key to be synchronized through the synchronized key of the node and the top node and sends the key to the top node;
7) the top node decrypts and stores the key to be synchronized, and informs the relay node that the key synchronization is successful;
8) the relay node informs the last-stage node that the key synchronization is successful, the last-stage node updates the key state, and the link attribute of the synchronization key is updated to be a two-node link parameter;
9) the last-level node informs the top-level node that the key updating state is successful, and the top-level node updates the link attribute of the synchronous key into a two-node link parameter;
10) after all nodes in the same tree cluster unit are synchronized, a last-level node and a relay node in the tree cluster unit of the layer check a global tree cluster relation table, if a tree cluster unit of a higher layer exists, a top-level node of the tree cluster unit of the layer serves as a relay, and a cross-layer key synchronization request is sent to the top-level node of the tree cluster unit of the higher layer;
11) the cross-layer key synchronization process comprises steps of 5), 6), 7), 8) and 9) in sequence, and finally, in the global network, any top-level node and any node of the local layer tree cluster unit and the low layer tree cluster unit belonging to the node have synchronized quantum keys;
12) when the user terminals of any two nodes acquire the secret key, the terminal sends a secret key acquisition request to the associated node, and the associated node information of the user terminal at the other end is carried;
13) the nodes receive the request and poll the global tree cluster relation table, if the two nodes belong to the same tree cluster unit, the symmetric key is obtained from the top node of the tree cluster unit of the layer, and the symmetric key is sent to the user terminal;
14) if the two nodes belong to the cross-tree cluster condition, the lowest-level top-level node which is in subordination relation with the two nodes is found, and the symmetric key is obtained from the top-level node and is sent to the user terminal.
Preferably, when the top node establishes and maintains the global tree cluster relationship table, the relationship table is broadcasted in the tree cluster unit, and the other nodes receive and store the global tree cluster relationship table.
Preferably, in the process of obtaining the key by the user terminal, the top node returns the key data including the symmetric key and the key ID to the node, the node receives the key data and then sends the key ID to the opposite node, and the opposite node obtains the specified symmetric key from the top node according to the key ID.
Preferably, the top node deletes the symmetric key of the specified key ID from the local symmetric key pool after sending the key of the specified key ID to the two nodes that obtain the key.
Preferably, the symmetric key obtained by the user terminal is derived from a key pool of the top node, and the symmetric key in the key pool is generated by a true random number module of the top node.
Compared with the prior art, the invention has the following beneficial effects:
the invention relates to a quantum key synchronization system and a method based on a hierarchical tree cluster unit, which adopt a mode that each tree cluster unit respectively completes quantum key synchronization, a low-level tree cluster unit takes a top-level node of the unit as a relay node to complete quantum key synchronization with a top-level node of a high-level tree cluster unit, and so on, thereby realizing the purpose of sharing a synchronization key between the top-level node of any tree cluster unit and a subordinate node subordinate to the same, and in addition, each tree cluster unit is parallel to a key synchronization service, thereby reducing the key synchronization time consumption of the whole system to a certain extent; by adopting the global tree cluster relation table for describing the global membership of the nodes and the tree cluster units, two nodes can conveniently acquire the shared key from the top-level node with the closest membership, the complexity, communication and calculation pressure of each central node are reduced, and the defects that the system performance and stability are influenced by overhigh complexity and overlarge pressure of a single central node in a large-scale network structure are avoided; meanwhile, by adopting the topological structure of the multi-center multi-level tree cluster unit, the method can be applied to large-scale multi-party encrypted communication scenes, eliminates the limitation for quantum communication practicality, can flexibly expand network topology, reduces the deployment cost of quantum channels to a certain extent, and is more convenient and practical.
Drawings
FIG. 1 is a schematic block diagram of a quantum key synchronization system based on hierarchical tree cluster units according to the present invention;
FIG. 2 is a schematic flow chart of the present invention for establishing a global tree cluster relationship table based on hierarchical tree cluster units;
in the figure:top level node 100,last level node 200,relay node 300, top level quantumkey management server 400, last level quantumkey management server 500, quantumkey relay server 600,QKD device 700,tree cluster unit 800,user terminal 900.
Detailed Description
The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which embodiments of the invention are shown.
As shown in fig. 1, a quantum key synchronization system based on hierarchical tree cluster unit includes:
atop level node 100, thetop level node 100 comprising a top level quantumkey management server 400 and aQKD device 700;
arelay node 300, therelay node 300 comprising a quantumkey relay server 600 and aQKD device 700;
alast level node 200, saidlast level node 200 comprising a last level quantumkey management server 500 and aQKD device 700;
atree cluster unit 800, wherein thetree cluster unit 800 is a key synchronization tree cluster topology unit composed of atop level node 100, a plurality of relay nodes 300 (which may not include relay nodes), and a plurality ofend level nodes 200, and is respectively defined as a top level tree cluster unit, a two-level tree cluster unit, and an N-level tree cluster unit from high to low according to a logical hierarchy;
a tree cluster unit expansion interface, which is located at thetop node 100 and thelast node 200, for conveniently expanding a network structure;
the method comprises the steps of a tree cluster relation table, when a tree cluster unit is networked internally, all nodes report own logic status to atop node 100, a tree cluster relation table is finally established in thetop node 100 and records node attributes, connection relations, membership relations and other information of all nodes in the tree cluster unit, then a lower-layer tree cluster unit reports the tree cluster relation table to an upper-layer tree cluster unit, the upper-layer tree cluster unit receives the reported relation table and updates the reported relation table to a corresponding logic position in the tree cluster relation table, and finally a global tree cluster relation table for recording global networking conditions is formed in the top-layer tree cluster unit.
Nodes of all roles in the tree cluster unit can be connected to theuser terminal 900, and a symmetric key is distributed to theuser terminal 900.
The top node and the relay node of the tree cluster unit are both reserved with connection expansion interfaces, and the connection expansion interfaces are provided in the following modes:
when a new node is expanded through a top-level node, according to the actual network deployment situation, a newly added last-level node can be directly connected with the top-level node or connected with the top-level node through a new relay node.
When a new node is expanded through a relay node, according to the actual network deployment situation, a newly-added last-stage node can be connected with a top-stage node through an original relay node or is connected with the original relay node through a new relay node and is finally connected with the top-stage node.
After expanding the new nodes in the cluster according to the method, the method further comprises the following steps:
and the newly added last-stage node reports node information to the top-stage node in the cluster, the tree cluster unit updates the global tree cluster relation table, and respectively initiates a global tree cluster relation table updating request upwards and downwards, and finally other tree cluster units update the newly added node information to the corresponding logic position of the global tree cluster relation table.
The tree cluster unit expansion interface is provided by the following method:
the top level node provides an upward tree cluster unit interface for expanding a new tree cluster unit at a relatively high level, and the hierarchical relation of each tree cluster unit in the original network is lifted according to the actual situation;
the last-level node provides a downward tree cluster unit interface and is used for expanding new tree cluster units with relatively low layers, the hierarchical relation of other tree cluster units in the original network is unchanged, and if the unit to which the last-level node belongs is an N-layer tree cluster unit, the newly added unit is an N + 1-layer tree cluster unit.
After expanding the new tree cluster unit according to the method, the method further comprises the following steps:
for upward expansion, if other high-level tree cluster units in the same level exist, the level relation does not need to be changed, and the tree cluster unit of the current level only needs to report a global tree cluster relation table to the newly expanded high-level tree cluster unit;
for upward expansion, if other high-level tree cluster units in the same hierarchy do not exist, the newly-added tree cluster unit is the top-level tree cluster unit, and the tree cluster unit of the layer only needs to report a global tree cluster relation table to the newly-expanded high-level tree cluster unit;
for downward expansion, the newly added tree cluster unit is an N +1 layer, the hierarchical relationship does not need to change, the tree cluster unit of the layer reports the updated tree cluster relationship table to the tree cluster unit of the upper layer after receiving the tree cluster relationship table of the newly added tree cluster unit and updating the local tree cluster relationship table, and by analogy, the update of the global tree cluster relationship table is completed.
The node is allowed to be multiplexed by a plurality of tree cluster units,
the top level node can be multiplexed into a plurality of last level nodes of the upper level tree cluster unit;
the last node can be multiplexed as a last node of a plurality of peer tree cluster units.
The invention also provides a quantum key synchronization method based on the hierarchical tree cluster unit, and the synchronization process comprises the following steps:
1) each node in the same tree cluster unit forms a network according to a preset topology, connection is established between a last-stage node and a relay node, and between the relay node and a top-stage node, the relay node reports a node connection relation to the upper-stage node after receiving connection of lower-stage nodes, and finally a complete local tree cluster relation table is established at the top-stage node;
2) after the local tree cluster relation table of each tree cluster unit is established, from bottom to top, the lower tree cluster unit reports the tree cluster relation table to the upper tree cluster unit (the table comprises the local tree cluster relation table and the subordinate tree cluster relation table), and after the upper tree cluster unit receives the table, the table is used as the subordinate table to be inserted into the global tree cluster relation table;
3) finally, the top layer tree cluster unit establishes a global tree cluster relation table for recording global complete topology, then from top to bottom, the upper layer tree cluster unit sends the global tree cluster relation table to the lower layer tree cluster unit, the lower layer tree cluster unit receives and updates the global tree cluster relation table, and finally all the tree cluster units establish the global tree cluster relation table;
4) in the same tree cluster unit, any pair of adjacent nodes are directly connected through a quantum channel, and a consistent quantum key is synchronously arranged between the two nodes through QKD;
5) the last-level node takes the relay node as a relay, initiates a key synchronization request to the top-level node, and specifies the ID of the key to be synchronized;
6) the relay node takes out the key to be synchronized from the key pool of the node according to the ID of the key to be synchronized, encrypts the key to be synchronized through the synchronized key of the node and the top node and sends the key to the top node;
7) the top level node decrypts and stores the key to be synchronized, and informs the relay node that the key synchronization is successful;
8) the relay node informs the last-stage node that the key synchronization is successful, the last-stage node updates the key state, and the link attribute of the synchronization key is updated to be a two-node link parameter;
9) the last-level node informs the top-level node that the key updating state is successful, and the top-level node updates the link attribute of the synchronous key into a two-node link parameter;
10) after all nodes in the same tree cluster unit are synchronized, a last-level node and a relay node in the tree cluster unit of the layer check a global tree cluster relation table, if a tree cluster unit of a higher layer exists, a top-level node of the tree cluster unit of the layer serves as a relay, and a cross-layer key synchronization request is sent to the top-level node of the tree cluster unit of the higher layer;
11) the cross-layer key synchronization process comprises steps of 5), 6), 7), 8) and 9) in sequence, and finally, in the global network, any top-level node and any node of the local layer tree cluster unit and the low layer tree cluster unit belonging to the node have synchronized quantum keys;
12) when the user terminals of any two nodes acquire the key, the terminal sends a key acquisition request to the associated node, and the key acquisition request carries the information of the associated node (namely the opposite end node) of the user terminal at the other end;
13) the nodes receive the request and poll the global tree cluster relation table, if the two nodes belong to the same tree cluster unit, the symmetric key is obtained from the top level node of the tree cluster unit of the layer, and the symmetric key is sent to the user terminal;
14) if the two nodes belong to the cross-tree cluster condition, the lowest-level top-level node which is in subordination relation with the two nodes is found, and the symmetric key is obtained from the top-level node and is sent to the user terminal.
As shown in fig. 2, the present invention further provides a method for establishing a global tree cluster relationship table based on hierarchical tree cluster units, which takes a system with three levels of tree cluster units as an embodiment for description, and includes the following steps:
1) each node is respectively connected with the upper node thereof according to the preset connection parameters, the last node C in the three-layer tree cluster unit G3 is connected with the relay node B, the relay node B is connected with the top node A, and similarly, the nodes in the two-layer tree cluster unit G2 and the top-layer tree cluster unit G1 are connected;
2) the relay node B reports the node membership of the node B to the top node A;
3) the top node A receives the node membership reported by all the relay nodes in the unit and updates a local tree cluster relation table;
4) meanwhile, similar to steps 1), 2), 3), the second-level tree cluster unit G2 and the top-level tree cluster unit G1 respectively establish and update the local tree cluster relation table;
5) the top node A of the three-layer tree cluster unit G3 reports a tree cluster relation table to the two-layer tree cluster unit G2;
6) the second layer of tree cluster unit G2 updates the tree cluster relation table, including the local and subordinate tree cluster relation tables;
7) after the second-layer tree cluster unit G2 updates the tree cluster relation table, reporting the tree cluster relation table to the top-layer tree cluster unit G1, wherein the tree cluster relation table comprises a local tree cluster relation table and a tree cluster relation table which is subordinate to the local tree cluster relation table;
8) and the top layer tree cluster unit G1 receives the reported tree cluster relation table, establishes and updates a global tree cluster relation table, and records the node connection and the membership of a global network.
The structure and the principle of the invention are integrated to realize the purpose of sharing the synchronous key between the top node of any tree cluster unit and the subordinate nodes subordinate to the tree cluster unit, and in addition, each tree cluster unit is parallel to the key synchronization service, thereby reducing the time consumption of key synchronization of the whole system to a certain extent; the two nodes can conveniently obtain the shared key from the top-level node with the closest membership, the complexity, communication and calculation pressure of each central node are reduced, and the defects that the system performance and stability are influenced by the overhigh complexity and overlarge pressure of a single central node in a large-scale network structure are overcome; meanwhile, the method can be applied to large-scale multi-party encryption communication scenes, limits are removed for quantum communication practicability, network topology can be flexibly expanded, deployment cost of quantum channels is reduced to a certain extent, and the method is more convenient to use and practical.

Claims (11)

CN202010997517.8A2020-09-212020-09-21Quantum key synchronization system and method based on hierarchical tree cluster unitActiveCN112260825B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN202010997517.8ACN112260825B (en)2020-09-212020-09-21Quantum key synchronization system and method based on hierarchical tree cluster unit

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN202010997517.8ACN112260825B (en)2020-09-212020-09-21Quantum key synchronization system and method based on hierarchical tree cluster unit

Publications (2)

Publication NumberPublication Date
CN112260825A CN112260825A (en)2021-01-22
CN112260825Btrue CN112260825B (en)2022-07-01

Family

ID=74232972

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN202010997517.8AActiveCN112260825B (en)2020-09-212020-09-21Quantum key synchronization system and method based on hierarchical tree cluster unit

Country Status (1)

CountryLink
CN (1)CN112260825B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN113055174B (en)*2021-04-142022-06-28长春大学Multi-node quantum key synchronization method based on consensus mechanism
CN114024666B (en)*2021-09-152023-04-25北京邮电大学 A quantum key distribution method and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US8855318B1 (en)*2008-04-022014-10-07Cisco Technology, Inc.Master key generation and distribution for storage area network devices
CN107094078A (en)*2017-06-012017-08-25浙江九州量子信息技术股份有限公司A kind of quantum key synchronization system and synchronous method based on multilevel relay
CN108964890A (en)*2018-06-152018-12-07南京南瑞国盾量子技术有限公司Based on tree-shaped identifiable multi-party quantum key distribution method layered
CN110784320A (en)*2019-11-042020-02-11张冰Distributed key implementation method and system and user identity management method and system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US8713314B2 (en)*2011-08-302014-04-29Comcast Cable Communications, LlcReoccuring keying system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US8855318B1 (en)*2008-04-022014-10-07Cisco Technology, Inc.Master key generation and distribution for storage area network devices
CN107094078A (en)*2017-06-012017-08-25浙江九州量子信息技术股份有限公司A kind of quantum key synchronization system and synchronous method based on multilevel relay
CN108964890A (en)*2018-06-152018-12-07南京南瑞国盾量子技术有限公司Based on tree-shaped identifiable multi-party quantum key distribution method layered
CN110784320A (en)*2019-11-042020-02-11张冰Distributed key implementation method and system and user identity management method and system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Ad Hoc网络环境中基于EBS的安全组播密钥管理机制;胡显伟等;《东北大学学报(自然科学版)》;20080615(第06期);全文*
一种分层的无线传感器网络密钥管理方案;杨洲等;《计算机应用研究》;20091115(第11期);全文*

Also Published As

Publication numberPublication date
CN112260825A (en)2021-01-22

Similar Documents

PublicationPublication DateTitle
CN109639550B (en)Multi-block chain network networking method, device and system
CN112260825B (en)Quantum key synchronization system and method based on hierarchical tree cluster unit
JP4894590B2 (en) Network system, information processing apparatus, and information processing program
CA2379476A1 (en)System and method for processing information using encryption key block
CN1801696B (en) A Key Management Method for Virtual Organization in Grid Computer Environment
CN103763363B (en)Cloud storage system and file copy deployment method based on cloud storage system
CN104601363A (en)Orbit and domain partition type double-layer satellite network system and management method
CN110113400A (en)A kind of data exchange management system
CN106341351A (en)QoS differentiation-based path resource allocation method applied to hybrid network
CN102547690B (en)Wireless sensor network system, node equipment and secret key generating method thereof
CN107948008A (en)A kind of modeling method for low-voltage network monitoring system
CN114580011A (en)Power facility security situation sensing method and system based on federal privacy training
CN102123100B (en)Method and device for maintaining routing information
WO2025043802A1 (en)Method and system for blockchain storage optimization based on erasure coding
CN114124384B (en)QKD network virtualization method and quantum key cloud platform
CN115277430B (en)Link fault probability quantification method and SDN controller deployment method
Zhou et al.A scalable vehicular network architecture for traffic information sharing
CN111885436A (en) A Distribution Network Automation Communication System Based on EPON Technology
CN111800516B (en)Internet of things equipment management method and device based on P2P
JP4654371B2 (en) Communication method and communication system using decentralized key management system
Viana et al.Twins: a dual addressing space representation for self-organizing networks
CN112905993B (en)Large-scale network-oriented distributed password equipment management system and construction method
CN112887364B (en) A system and method for cross-network data synchronization and message distribution of cloud video
Chien et al.Identity-based key agreement protocol for mobile ad-hoc networks using bilinear pairing
Keizer et al.Marked grid labeling

Legal Events

DateCodeTitleDescription
PB01Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
GR01Patent grant
GR01Patent grant

[8]ページ先頭

©2009-2025 Movatter.jp