CN110690964B - Quantum service block chain creation method and application system - Google Patents
Quantum service block chain creation method and application system Download PDFInfo
- Publication number
- CN110690964B CN110690964B CN201910949362.8A CN201910949362A CN110690964B CN 110690964 B CN110690964 B CN 110690964B CN 201910949362 A CN201910949362 A CN 201910949362A CN 110690964 B CN110690964 B CN 110690964B
- Authority
- CN
- China
- Prior art keywords
- quantum
- node
- current
- relay
- nodes
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
- H04L9/0855—Quantum cryptography involving additional nodes, e.g. quantum relays, repeaters, intermediate nodes or remote nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Abstract
The invention provides a method for creating a quantum service block chain, which comprises the following steps: the accounting node broadcasts the information set of the current block; the quantum node of the target quantum network creates a current node relay state and carries out digital signature, and the current node relay state is used as a current transaction and is sent to an accounting node; the current accounting node encapsulates the current block. The invention also provides an application system of the quantum service block chain, which comprises the quantum network alliance chain and the quantum security service block chain. According to the invention, the quantum node relay state is stored on the block chain, so that the separation and distributed management of the quantum key relay function and the quantum network are realized, the problem of concurrency conflict of the quantum relay link is solved, the safety management risk of the quantum relay key is reduced, and the service efficiency of the quantum key is improved. The embodiment of the invention has good application and popularization prospects in the application fields of mobile secret communication, mobile office systems, enterprise VPN, quantum security block chains and the like.
Description
Technical Field
The invention relates to the technical field of quantum key distribution networks and block chains, in particular to a quantum service block chain establishing method and an application system.
Background
A Quantum node in a Quantum communication network generally consists of a classical communication unit connected to a classical communication network and a Quantum device unit connected to a Quantum Key Distribution (QKD) network. Due to the lack of practical, non-landing quantum communication relay technology, trusted relay technology is typically employed in QKD networks. However, the trusted relay technology has the problem of the concurrent conflict of the quantum links in scale and large relay delay, for example, a low-delay quantum key mobile service method disclosed in chinese patent application publication No. CN 109995513 a has the problem of the concurrent conflict of the quantum links in scale, and the difficulty of the security management technology of the quantum key is large. At present, no open literature exists for solving the technical problem of quantum relay by using the block chain technology.
Disclosure of Invention
In order to solve the problems of the quantum relay technology in the background art, the invention provides a method for creating a quantum service block chain, which comprises the following steps: the accounting node broadcasts the information set of the current block; the quantum node of the target quantum network creates a current node relay state and carries out digital signature, and the signed current node relay state is used as a current transaction of the quantum node and is sent to one or more accounting nodes; the current accounting node collects the current unconfirmed transactions in the target volume subnetwork to form a current unconfirmed transaction set; judging whether the packaging condition is met, and if the packaging condition is met, packaging the current block; wherein the node relay state includes: some or all of the target quantum nodes relay routing states, wherein one node relay routing state comprises: the exclusive or value and the corresponding identification of the shared quantum key group negotiated by the target quantum node and the two adjacent quantum nodes respectively; the information set includes: height identification of the current block; the target network comprises any one of the following options: quantum key distribution network, quantum communication network, quantum sensing network, quantum security internet.
Optionally, the method further includes: and the plurality of accounting nodes carry out alternate accounting according to a consensus mechanism.
Optionally, the method further comprises any one of the following application methods: creating a virtual quantum link state between any two service nodes based on one or more blocks, performing quantum key service based on one or more blocks, or negotiating a quantum-secure shared key, wherein the virtual quantum link state is an exclusive or value and an identification of an associated quantum key packet or a random number packet of the two service nodes associated therewith.
The invention also provides an application system of the quantum service block chain, which comprises the quantum network alliance chain and is used for taking the quantum nodes of the target quantum network as the nodes of the alliance block chain, and adopting any method to establish the current transaction of the nodes and establish the first block.
Optionally, the system further includes: and the quantum security service block chain is used for negotiating quantum security shared keys for any two or more nodes based on one or more first blocks or/and providing quantum security transaction services, and creating a second block.
Optionally, the system further includes: a Token mechanism, in which a quantum network alliance chain rewards a certain amount of first tokens for each quantum node participating in the current transaction of the created node; the second Token of the quantum secure services block chain is used for transactions between nodes.
The invention has the following innovations: according to the invention, the quantum key relay state is stored on the block chain, so that the separation of the quantum key relay function and the quantum network is realized, the problem of concurrency conflict of the quantum key relay link is solved, the safety management risk of the quantum key relay is reduced, and the service efficiency of the quantum key is improved. The system can realize efficient quantum security service and transaction with an incentive mechanism through Token. The embodiment of the invention has good application and popularization prospects in the application fields of mobile secret communication, mobile office systems, enterprise VPN, quantum security block chains and the like.
Drawings
Fig. 1 is a schematic diagram of a method for creating a quantum service block chain according to an embodiment of the present invention;
fig. 2 is a method for a relay node to establish a relay state of a current node according to an embodiment of the present invention;
fig. 3 is a method for a service node to create a relay state of a current node according to an embodiment of the present invention;
fig. 4 is a method for creating a virtual quantum link state according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an embodiment of a quantum service block chain application provided in an embodiment of the present invention;
fig. 6 is a schematic diagram of a block-based quantum key service method according to an embodiment of the present invention;
Fig. 7 is a schematic diagram of an application system of a quantum service block chain according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention and some terms and meanings thereof will be described first as part of the present invention.
(1) Examples of target traffic subnetworks to which embodiments of the present invention are applicable include, but are not limited to, any of the following: quantum key distribution network, quantum communication network, quantum sensing network, quantum security internet, other networks which adopt point-to-point single-hop landing forwarding mode for relay transmission; accordingly, target quantum nodes in embodiments of the present invention include, but are not limited to: some or all of the relay nodes in the target quantum network, and some or all of the service nodes (or quantum access nodes) in the target quantum network. The target quantum node in the embodiment of the present invention is suitable for, but not limited to, a target node accessing a target quantum network through a fiber interface and a wireless interface (or a free space interface).
(2) The target relay node of the embodiment of the invention is a quantum node used as a relay in a target quantum network, or a quantum node which has at least two adjacent nodes on one or more relay links and is used as a relay; a service node (or referred to as an access node) refers to other quantum nodes in the target quantum network that are not used for relaying or are not directly used for relaying (in some possible designs, the service node may be used for quantum relaying through a virtual node); in addition, for a specific embodiment of the present invention, the corresponding target quantum network includes the relay node and the serving node included in the above embodiment.
(3) The communication channels involved in embodiments of the invention for quantum networks include quantum channels and conventional communication network channels, wherein conventional communication network channels are employed for other communication processes except that quantum key distribution between adjacent quantum nodes (an adjacent quantum node refers to two nodes capable of normal point-to-point QKD or quantum communication) requires occupation of the quantum channel or link, and include, but are not limited to, one or more of wired communication and wireless/mobile/satellite communication channels.
(4) The shared quantum key packet in the embodiment of the invention is shared key data with a certain data length. Because different application systems have different requirements on the length of the shared secret key and the bit rate of the point-to-point QKD link has a certain difference, the invention does not specially limit the data length of the shared quantum secret key grouping; it is obvious that the data length refers to counting by the same data unit (e.g., bit, byte). In practice, the data length of the shared quantum key packet (e.g., 2048 bits, 100 kbytes, 10 mbytes, 1 gbyte, or any other data length that meets the requirements of the system) may be determined according to the rate of encoding of the QKD system in actual use, the specific requirements of the application system, or future industry standard requirements.
In order to make the technical solutions and advantages of the present invention clearer, the present invention is described in further detail below with reference to the accompanying drawings and specific embodiments as a part of the present invention.
The method for creating a quantum service block chain provided by the embodiment of the present invention shown in fig. 1 includes the following steps: s101: the accounting node broadcasts the information set of the current block; s102: the quantum node of the target quantum network creates a current node relay state and carries out digital signature, and the signed current node relay state is used as a current transaction of the quantum node and is sent to one or more accounting nodes; s103: the current accounting node collects the unconfirmed current transactions in the target volume subnetwork to form a current unconfirmed transaction set, judges whether a packaging condition is met, and packages the current block if the packaging condition is met; wherein, the information set includes but is not limited to: the height of the current block.
In one possible design, in the above embodiment, the quantum node sends the current transaction to one or more accounting nodes in an encrypted manner.
In one possible design, in the above embodiment, the plurality of accounting nodes perform alternate accounting according to a consensus mechanism, where the consensus mechanism includes, but is not limited to: a proxy billing consensus (or PoS consensus), and a public credit consensus (or PoC consensus).
In one possible design, in the above embodiment, the accounting node verifies the digital signature of each unconfirmed current transaction and places the verified unconfirmed current transaction into the set of current unconfirmed transactions.
In one possible design, in the above embodiment, the package includes but is not limited to: creating a block header; wherein the block header includes but is not limited to: the Hash value of the last block, the Hash value of the current block, and the timestamp.
In the above embodiment, the quantum node creating the current node relay state includes any one of the following methods: (method 1) the relay node creates a current node relay state, the service node saves a quantum key group associated with the current node relay state of the adjacent relay node and an identifier thereof, and (method 2) the relay node and the service node create the current node relay state respectively.
Fig. 2 shows a method for a relay node to create a current node relay state according to an embodiment of the present invention, which includes the following steps: s201: negotiating a shared quantum key packet with each of n adjacent destination nodes (for convenience, noted as: { QK _ a _ Bi, 0 ≦ i < n }, where i and n are natural numbers, and n is greater than 1, QK _ a _ Bi = QK _ Bi _ a representing the shared quantum key packet negotiated by relay node a and adjacent destination node Bi);
S202: calculating exclusive or values of any two of the shared quantum key packets and creating an identifier (i.e., { RRS _ Bi _ a _ Bj = QK _ a _ Bi ≧ QK _ a _ Bj, 0 ≦ i < n, 0 ≦ j < n, i < j } (where RRS _ Bi _ a _ Bj = RRS _ Bj _ a _ Bi, which represents an exclusive or value of the shared quantum key packets QK _ a _ Bi and QK _ a _ Bj negotiated by a with Bi and Bj, respectively, and taking the exclusive or value and the routing identifier thereof as one node relay routing state of the relay node), creating C (n,2) node relay routing states (where C (n,2) is a combination number of 2 arbitrarily selected from n elements, the same applies below), and destroying the n shared quantum key packets;
s203: the relay node takes all the C (n,2) current node relay route states as a current node relay state.
In one possible design, in the above embodiment, a data digest or Hash value of the relay routing status of each current node may also be created.
Fig. 3 shows a method for a serving node to create a current node relay state according to an embodiment of the present invention, which includes the following steps:
s301: negotiating a shared quantum key group with each of m adjacent target nodes respectively;
s302: creating a virtual relay node, generating a random number group, respectively calculating the exclusive or value of any two sharing quantum key groups in the (m +1) sharing key groups, creating an identifier, and creating C (m +1,2) node relay routing states;
S303: and taking the relay routing state of C (m +1,2) nodes as the relay state of a current node, and safely storing the random number packet and the identification thereof.
In one possible design, in the foregoing embodiment, the node identifier includes but is not limited to: node ID, height identification (or global identification) of the block.
In one possible design, in the foregoing embodiment, a route identifier is created for the node relay route status, where the route identifier includes, but is not limited to: a height identifier (or global identifier) of the block, and routing identifiers of a previous neighboring target node and a next neighboring target node connecting the current target node and the current target node (or an identifier of the current serving node, an identifier of the first neighboring target node, and an identifier of the second neighboring target node).
In one possible design, in the foregoing embodiment, a group identifier is created for the shared quantum key group or the random number group, where the group identifier includes: height identification (or global identification) of the block, link identification (or current node identification, adjacent node identification) of the current node and the adjacent node.
In one possible design, a virtual quantum link state between any two service nodes may be created based on the one or more blocks, and quantum key service or negotiation of quantum-secure shared keys may be performed based on the one or more blocks. Fig. 4 shows a method for creating a virtual quantum link state according to an embodiment of the present invention, which includes the following steps: s401: selecting a block; s402: selecting a quantum key relay link between two service nodes, screening out corresponding node relay routing state data in all node relay states associated with the quantum key relay link from the block, and calculating the exclusive or value of the data. In one possible design, creating a virtual quantum link state identifier for the exclusive or value includes, but is not limited to, a height identifier (or global identifier) of the block, and ID identifiers of the two service nodes. The exclusive or value and its identity may be treated as a virtual quantum link state.
Fig. 5 shows an application example of a quantum service block chain according to an embodiment of the present invention; three relay nodes 1, 2 and 3 are included, and 4 serving nodes 4, 5, 6 and 7 are included. Any one node negotiates 1 shared quantum key QK _ ij with each neighboring node respectively (where QK _ ij = QK _ ji, representing the group of shared quantum keys negotiated between node i and node j). The relay node j calculates each node relay route state and creates a route identifier (denoted as RRS _ ijk, where 0< j <4, j is an integer, which may include a data digest or a Hash value of the corresponding node relay route state). The serving nodes i respectively generate random number packets R _ i (3 < i <8, i is an integer), and the node relay route status of the serving node i is recorded as RRS _ iij. For example, the relay routing status of the node 1 is RRS _412= RRS _214= (QK _41 ^ QK _12), and the relay routing status of the node 4 is RRS _441= (QK _41 ^ R _ 4). Other nodes may be computed in a similar manner. The 7 nodes respectively carry out digital signature on relay routing states of all the nodes and send the digital signature to the current accounting node as the current transaction of the nodes; the current accounting node encapsulates the current transactions of all 7 nodes into one block.
Based on this block, a virtual quantum link state (denoted as VQLS) between any two of the service nodes 4, 5, 6, and 7 can be computed. For example, the virtual quantum link state between nodes 4 and 5 is:
VQLS_45=RRS_441⊕RRS_413⊕RRS_531⊕RRS_553
=(R_4⊕QK_41)⊕(QK_41⊕QK_13)⊕(QK_13⊕QK_53)⊕(QK_53⊕R_5)
=R_4⊕R_5。
obviously, in one possible design, nodes 4 and 5 may directly negotiate to use R _4 or R _5 as a shared session key based on VQLS _ 45. In a similar way, the virtual quantum link state between any other two service nodes can be calculated, or/and quantum key service (or quantum-secure shared key negotiation) can be carried out on a block basis.
In one possible design, in the above embodiment, the serving node i may not generate the random number packet R _ i (3 < i <8, i being an integer), but hold the shared quantum key packet negotiated with the relay node.
In one possible design, a block-based quantum key service method provided in the embodiment of the present invention shown in fig. 6 may be implemented, where the method includes the following steps:
step 1: a user U and a user V respectively apply for registration and obtain ID identification to a service node in a vector sub-network block chain, and respectively apply for A and B and obtain a certain amount of random key packets (respectively marked as Kui and Kvj, wherein i and j are natural numbers and are used for corresponding serial numbers); a and B respectively create service association lists of association U and association V and upload the service association lists to a virtual quantum link server (or a third-party server); the service association list is composed of a plurality of records, wherein each record represents the association information of one registered user, including but not limited to the ID identification of the user, the identification of the associated service node and the margin information of the random key grouping;
And 2, step: requesting the virtual quantum link state of the V from a virtual quantum link server (or a third-party server) by the U; the virtual quantum link server (or a third-party server) firstly identifies U, searches corresponding service association lists according to ID (identity) identifications of U and V after the identification is passed, and searches associated service nodes A and B according to the service association lists;
and 3, step 3: the virtual quantum link server (or a third-party server) selects a block from the block book, selects a virtual quantum link state (marked as Ka ^ Kb) associated with A and B in the block, and respectively sends corresponding virtual quantum link state identifications to A and B;
and 4, step 4: a sends the XOR value of the random number packet Ka associated with the virtual quantum link state and a random key packet (for example, Ku2 is selected) of U and the corresponding identification thereof to the virtual quantum link server (or a third party server); b sending the xor value of the random number packet Kb associated with the virtual quantum link state and a random key packet (e.g. select Kv 5) of V and its corresponding identification to the virtual quantum link server (or third party server);
And 5: the virtual quantum link server (or a third-party server) performs an exclusive-or operation on the exclusive-or value of the two exclusive-or values and the virtual quantum link state, that is, calculates:
(Ka bolaku 2) · (Kb bolakv 5) · (Ka bolakb) = Ku2 · Kv 5; then Ku2 ^ Kv5 and the corresponding random key grouping identification are respectively sent to U and V;
and 6: the U and V negotiations use Ku2 or Kv5 as shared keys. Or, in one possible design, U sends to V a check value of Ku2 ≦ Ku2 ≦ Kv5 ≦ R = Kv5 ≦ R; v, calculation: kv5 ≦ R ≦ Kv5= R, and then the check value of R is calculated, and if the two check values are the same, R is successfully shared; otherwise, renegotiation; wherein, R may be plaintext data or a random key.
Obviously, the quantum key service process does not occupy the bandwidth of the QKD network, and does not coordinate the QKD link resources in real time to perform quantum key trusted relay, i.e., the quantum key service separated from the QKD network is realized. The method can effectively solve the problems of the concurrency conflict of the scale relay link and the delay of the credible relay in the QKD network application.
Fig. 7 is a schematic diagram of an application system of a quantum service block chain according to an embodiment of the present invention, where the application system includes a quantum network alliance chain and a quantum security service block chain, where (1) the quantum network alliance chain: taking quantum nodes of a target quantum network as nodes of a quantum network alliance chain, creating current transactions of the nodes by adopting the methods in the above-mentioned fig. 1, fig. 2 and fig. 3, and creating a resource block book (namely, a node relay state block database) by adopting the method in fig. 1 or fig. 5; the quantum network alliance chain provides a resource block ledger for the quantum security service block chain; (2) quantum secure service blockchain: based on the resource block ledger, the method in fig. 4, or/and fig. 5, or/and fig. 6 is adopted to negotiate quantum-safe shared keys between any two or more nodes, or/and provide quantum-safe transactions, and create transaction block ledger.
In a possible design, a Token is set in the application system, and the Token adopts a mode of issuing a credit reward, and can be used for transaction, can also be used for paying quantum security service fee, and can also be used for rewarding each quantum node participating in the current transaction of the creation node.
In a possible design, two types of Token are set in the application system, wherein the first type of Token adopts a mode of issuing a reward and rewarding for rewarding, can be used for transaction, and can be used for paying quantum security service fee; the second Token employs a limited number of issues for rewarding each quantum node participating in the current transaction of creating a node.
As will be appreciated by one of skill in the art, embodiments of the present invention may be provided as a method, or system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, systems and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although the present invention has been described in connection with the specific features and embodiments thereof, it is apparent that various modifications and combinations can be made thereto without departing from the spirit and scope of the invention. Accordingly, the specification and drawings are merely illustrative of the invention as defined by the appended claims and are intended to cover any and all modifications, variations, combinations, or equivalents within the scope of the invention. It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (9)
1. A method for creating a quantum service block chain is characterized by comprising the following steps:
the accounting node broadcasts the information set of the current block;
each quantum relay node in a target quantum network negotiates 1 shared quantum key group with each of n adjacent target quantum nodes respectively, calculates an exclusive or value of any two shared quantum key groups in the n shared quantum key groups and creates a route identifier, takes each exclusive or value and the route identifier thereof as a node relay route state, takes the corresponding node relay route state or node relay route states as a current node relay state and carries out digital signature, takes the signed current node relay state as a current transaction and sends the current transaction to one or more accounting nodes, and destroys the n used shared quantum key groups;
each quantum service node in the target quantum network negotiates a shared quantum key group with each of m adjacent target quantum nodes respectively, a virtual quantum relay node is created, a random number group is generated and a corresponding group identifier is created, the random number group is taken as a shared quantum key group between the virtual quantum relay node and the quantum service node, the m adjacent target quantum nodes and the quantum service node are taken as (m +1) adjacent target quantum nodes of the virtual quantum relay node, the exclusive or values of any two shared quantum key groups in the (m +1) shared quantum key groups are calculated and a route identifier is created, each exclusive or value and the route identifier thereof are marked as a node relay route state, and one or more corresponding node relay route states are taken as a current node relay state and are digitally signed, taking the signed relay state of the current node as a current transaction and sending the current transaction to one or more accounting nodes, and safely storing the random number group and the group identifier thereof;
The current accounting node collects the unconfirmed current transactions in the target volume subnetwork and forms a current unconfirmed transaction set, judges whether the packaging condition is met, and packages the current block if the packaging condition is met;
the target quantum node comprises a quantum relay node or/and a quantum service node; the target quantum network comprises any one of the following options: quantum key distribution network, quantum communication network, quantum sensing network, quantum security internet; the set of information includes: height identification of the current block; n is an integer of not less than 2, and m is an integer of not less than 1.
2. The method for creating a quantum service block chain as claimed in claim 1, comprising: and the plurality of accounting nodes carry out alternate accounting according to the consensus mechanism.
3. The method for creating a quantum service block chain according to claim 1, comprising any one of the following application methods: creating a virtual quantum link state between any two service nodes based on one or more blocks, performing quantum key service based on one or more blocks, or negotiating a quantum-secure shared key, wherein the virtual quantum link state is an exclusive or value and an identification of an associated quantum key packet or a random number packet of the two service nodes with which it is associated.
4. The method of claim 1, wherein the routing identifier comprises: the random number packet and the shared quantum key packet have the same data format.
5. The method of claim 1, wherein the encapsulating comprises: creating a block header, the block header comprising: the Hash value of the last block, the Hash value of the current block and the timestamp.
6. The method of claim 1, wherein the encapsulation condition comprises: the transactions in the current unconfirmed transaction set already contain the current transactions for all target nodes that meet the requirements of the target quantum network.
7. An application system of a quantum service block chain, comprising:
quantum network alliance-chain employing quantum nodes of a target quantum network as nodes of the quantum network alliance-chain and employing the method of any of claims 1 to 2 to create a current transaction of nodes and to create a first block.
8. The system of claim 7, comprising: and the quantum security service block chain is used for negotiating quantum security shared keys for any two or more nodes based on one or more first blocks or/and providing quantum security transaction services, and creating a second block.
9. The system of claim 8, comprising: the Token mechanism, quantum network alliance chain awards a certain amount of first Token for each quantum node participating in the current transaction of creating nodes, and the second Token of quantum security service block chain is used for the transaction between nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910949362.8A CN110690964B (en) | 2019-10-11 | 2019-10-11 | Quantum service block chain creation method and application system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910949362.8A CN110690964B (en) | 2019-10-11 | 2019-10-11 | Quantum service block chain creation method and application system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110690964A CN110690964A (en) | 2020-01-14 |
| CN110690964B true CN110690964B (en) | 2022-06-28 |
Family
ID=69111601
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910949362.8A Active CN110690964B (en) | 2019-10-11 | 2019-10-11 | Quantum service block chain creation method and application system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110690964B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111262699A (en) * | 2020-03-03 | 2020-06-09 | 成都量安区块链科技有限公司 | Quantum security key service method and system |
| CN114172639B (en) * | 2020-09-11 | 2023-06-27 | 军事科学院系统工程研究院网络信息研究所 | Quantum encryption communication method based on block chain |
| CN113328853B (en) * | 2021-05-25 | 2023-09-08 | 成都量安区块链科技有限公司 | Coalition chain system for improving security by adopting quantum key |
| CN113765664B (en) * | 2021-11-10 | 2022-02-08 | 济南量子技术研究院 | Block chain network secure communication method based on quantum key |
| CN114266073B (en) * | 2022-03-02 | 2022-05-17 | 环球数科集团有限公司 | Data link privacy processing system based on block chain technology |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107181599A (en) * | 2017-07-18 | 2017-09-19 | 天津理工大学 | The storage of route location data confidentiality and sharing method based on block chain |
| CN108023725A (en) * | 2016-11-04 | 2018-05-11 | 华为技术有限公司 | A kind of quantum key trunking method and device based on centralized management with control network |
| CA2961357A1 (en) * | 2017-03-05 | 2018-09-05 | Jeanne Louise Jls Shih | Distributive networks of groups of moveable autonomous devices |
| CN109995512A (en) * | 2017-12-29 | 2019-07-09 | 成都零光量子科技有限公司 | A kind of mobile security application method based on quantum key distribution network |
| CN110247713A (en) * | 2019-04-26 | 2019-09-17 | 北京邮电大学 | A kind of virtual service mapping method and device based on quantum key distribution optical-fiber network |
-
2019
- 2019-10-11 CN CN201910949362.8A patent/CN110690964B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108023725A (en) * | 2016-11-04 | 2018-05-11 | 华为技术有限公司 | A kind of quantum key trunking method and device based on centralized management with control network |
| CA2961357A1 (en) * | 2017-03-05 | 2018-09-05 | Jeanne Louise Jls Shih | Distributive networks of groups of moveable autonomous devices |
| CN107181599A (en) * | 2017-07-18 | 2017-09-19 | 天津理工大学 | The storage of route location data confidentiality and sharing method based on block chain |
| CN109995512A (en) * | 2017-12-29 | 2019-07-09 | 成都零光量子科技有限公司 | A kind of mobile security application method based on quantum key distribution network |
| CN110247713A (en) * | 2019-04-26 | 2019-09-17 | 北京邮电大学 | A kind of virtual service mapping method and device based on quantum key distribution optical-fiber network |
Non-Patent Citations (1)
| Title |
|---|
| Quantum-secured blockchain;E.O. Kiktenko等;《Arxiv》;20180603;第2-6页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110690964A (en) | 2020-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110690964B (en) | Quantum service block chain creation method and application system | |
| CN110661620B (en) | Shared key negotiation method based on virtual quantum link | |
| CN110581763B (en) | Quantum key service block chain network system | |
| CN109995510B (en) | Quantum key relay service method | |
| CN110690928B (en) | Quantum relay link virtualization method and device | |
| CN110690961B (en) | Quantum network function virtualization method and device | |
| KR101097548B1 (en) | Digital object title authentication | |
| CN112865964B (en) | Quantum key distribution method, device and storage medium | |
| Xu et al. | Game theoretical secure caching scheme in multihoming edge computing-enabled heterogeneous networks | |
| CN112367163B (en) | Quantum network virtualization method and device | |
| CN111262699A (en) | Quantum security key service method and system | |
| CN110690962B (en) | Application method and device of service node | |
| CN110677241A (en) | Quantum network virtualization architecture method and device | |
| US11405407B2 (en) | Data packet sending method, network device, control device, and network system | |
| CN110690960B (en) | Routing service method and device of relay node | |
| CN111342952B (en) | Safe and efficient quantum key service method and system | |
| KR101116109B1 (en) | Digital object title and transmission information | |
| CN113691313A (en) | Satellite-ground integrated quantum key link virtualization application service system | |
| CN112367160B (en) | Virtual quantum link service method and device | |
| CN113193958A (en) | High-safety high-efficiency quantum key service method and system | |
| CN116506174A (en) | Multi-server data transmission method suitable for Internet of vehicles and supporting user hidden identity | |
| CN111464298A (en) | Data processing method and device in block chain and block chain network | |
| CN113840349B (en) | Self-organizing network routing method based on blockchain | |
| Garg et al. | Edge Supported QoS based Secure Data Communication mechanism for Software Defined Vehicular Networks | |
| CN114285550A (en) | Quantum security key service network, system and node device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |