CN114615288B - Novel block chain system based on quantum Byzantine consensus protocol - Google Patents
Novel block chain system based on quantum Byzantine consensus protocol Download PDFInfo
- Publication number
- CN114615288B CN114615288B CN202210054546.XA CN202210054546A CN114615288B CN 114615288 B CN114615288 B CN 114615288B CN 202210054546 A CN202210054546 A CN 202210054546A CN 114615288 B CN114615288 B CN 114615288B
- Authority
- CN
- China
- Prior art keywords
- quantum
- node
- list
- bit
- block
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network 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/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/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
Abstract
The invention discloses a novel block chain system based on a quantum Byzantine consensus protocol, and belongs to the field of quantum information calculation and block chain distributed consensus protocols. The system architecture includes: user layer, core layer and base layer. The user layer comprises node management and service functions; the core layer comprises a quantum Byzantine consensus protocol, an intelligent contract and an encryption algorithm; the base layer includes computing storage and a peer-to-peer network. Unlike other blockchain systems, the peer-to-peer network in the base layer of the novel blockchain system adopts classical and quantum channels to realize communication between nodes. The classical channel is used for transmitting a large amount of classical block data; the quantum channel is combined with the quantum computing technology to realize a novel secret number list distribution mode, and the secret number list distribution efficiency and the quantum resource utilization rate are improved. Each node in the user layer achieves a quantum Byzantine consensus protocol in the core layer through the secret number list, and the fault-tolerant capability and the safety of the block chain system are improved.
Description
Technical Field
The invention relates to the field of quantum information and calculation and the field of a block chain distributed consensus protocol, in particular to a novel block chain system based on a quantum Byzantine consensus protocol.
Background
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. The innovative distributed disintermediation trust system changes the traditional internet trust establishment and maintenance system relying on a centralized mechanism, changes the traditional internet trust establishment and maintenance mechanism relying on the centralized mechanism, and brings profound influence on various fields such as finance, economy, politics, science and technology, government and the like. From the technical aspect, the blockchain can be regarded as a distributed account book for realizing data storage in a distributed system, a consensus mechanism ensures how to keep data consistency when the distributed nodes transmit information, and a cryptography mechanism ensures that the blockchain information is not tampered and can be authenticated.
The consensus mechanism design of the blockchain greatly influences the performance of the blockchain system, including transaction capability, expandability and partition fault tolerance capability. The most important partition fault tolerance capability refers to how nodes in the system agree on an untrusted network environment. The solution to this problem and Leslie Lamport et al, 1982, have proposed the heteroscedasticity of the problem of the general of Byzantin: knowing that a general is a traitor, how the remaining loyal general agreed. Common recognition algorithms such as PoW, PBFT and the like applied in the current block chain are combined with actual application scenes, and feasible solutions of the problem of the Byzantine general are provided to different degrees. However, theory has demonstrated that: if more than 1/3 of the general is a traitor, the problem of the Byzantine general will be undone unless the general has a set of correlated private number lists. Therefore, solving the problem of the kazakhstan general can be relegated to solving the problem of the generation and secure distribution of these lists. The security of the classical distribution scheme relies on a hash algorithm and public-private key cryptography, while for quantum computing, which has advantages over classical, public-key cryptography can theoretically be broken in a very short time, meaning that no secure secret list is available. Thus, there is no way to fully cope with the presence of any number of malicious nodes in the blockchain system, relying entirely on classical scientific techniques. How to combine the blockchain technology with the quantum-resistant technology, design and optimize a consensus mechanism according to a blockchain application scenario, so that a blockchain system can break through classical limitations, and has the security of quantum computing attack resistance, which is a problem to be solved urgently at present.
Disclosure of Invention
Based on the problems, the invention provides a novel block chain system based on a quantum Byzantine consensus protocol, which fundamentally improves the safety and reliability of the block chain system.
The technical scheme of the invention comprises the following steps:
a novel block chain system architecture based on quantum Byzantine consensus protocol comprises three layers: a user layer, a core layer and a base layer; the user layer comprises node management and service functions; the core layer comprises a quantum Byzantine consensus protocol, an intelligent contract and an encryption algorithm; the base layer includes computing storage and a peer-to-peer network. The composition of the novel blockchain system is different from other blockchain systems in the quantum Byzantine consensus protocol and the peer-to-peer network.
Preferably, the peer-to-peer network in the system base layer adopts two channels of classical and quantum for communication; the quantum Byzantine consensus protocol in the system core layer comprises the following steps: master node P 1 Selecting; master node P 1 Generating 256 groups of secret number lists with specific association with other common nodes through quantum computation and quantum channels; master node P 1 Sending block B, block summary information m and information position list V generated according to self secret list through classical channel 1 To other nodes; each node P k Receiving a master node P 1 After all messages are sent, the block summary information m and the secret list l are sent through the classical channel k Generated information position list V k Sending the data to other nodes; and each node compares all the obtained messages with the secret list of the node to verify, and determines to update the block synchronously or abandon updating according to the verification result.
Preferably, the blockchain link points facilitate the implementation of a quantum byzantine consensus protocol in the blockchain system core layer through successful distribution of the list of secret numbers.
Preferably, each consensus need for a complete blockFirst, selecting the master node P from the user layer 1 。
Preferably, the master nodes are enumerated by round robin.
Preferably, the main node and other common nodes of the user layer perform quantum state transmission through quantum channels to cooperatively complete a quantum phase estimation algorithm, so as to generate a group of secret number lists with specific associations;
the cooperative quantum phase estimation algorithm process comprises the following steps: the main node firstly generates an initial quantum state, the initial quantum state is mutually transmitted among the nodes, each node is subjected to corresponding quantum operation in each transmission, and finally the quantum operation is transmitted back to the main node to be subjected to the final operation, so that the distribution of a group of secret number lists is completed.
Preferably, all nodes transmit through quantum channels by 1 working quantum bit and t auxiliary quantum bits, and ntL quantum communication is carried out to complete the quantum phase estimation calculation method; where n is the total number of nodes in the network and L is the length of the list of secret numbers.
Preferably, the block includes a block header and a block body, and the block body stores uplink data using a meikel tree.
Preferably, the block header includes: version number, previous chunk hash, root of mekerr tree, timestamp.
Preferably, the digest information of the block is calculated by performing two hash calculations on the block header by using the SHA-256 algorithm.
Compared with the prior art, the invention has the following beneficial effects:
(1) A novel block chain system based on a quantum Byzantine consensus protocol is constructed, the partition fault-tolerant capability of the block chain system is greatly improved, and the purpose of improving the safety and the reliability of the whole network data is further achieved. The system can satisfy the following conditions no matter how many malicious nodes exist in the network: i, synchronizing all honest nodes or synchronizing the same block B and corresponding summary information m, writing a verified new block into a local block chain database, or giving up synchronization, and selecting the next node as a main node to perform the next round of consensus; if master node P 1 Is honest, then each timeIndividual honest nodes or synchronization P 1 And writing the new block passing the verification into a local block chain database by the sent block B and the corresponding summary information m, or abandoning the synchronization, and selecting the next node as a leading node to perform the next round of consensus.
(2) The invention provides a safe and efficient secret data list distribution method, which can distribute a group of secret digital lists associated with each node with the success probability close to 100% only by ntL quantum communication and few quantum bits, and can efficiently utilize quantum resources.
(3) A quantum circuit of a safe and efficient digital list distribution method is constructed, and the quantum circuit is specific, clear and easy to implement. The list distribution quantum circuit provided by the invention provides a design thought for the construction of a quantum circuit model of a block chain consensus mechanism, and meanwhile, the quantum circuit summarizes the specific implementation mode of interaction among all nodes, and a quantum communication channel and a quantum hardware system can achieve expected results by applying the circuit design.
Drawings
Fig. 1 is a system architecture diagram for constructing a new blockchain system based on the quantum byzantine consensus protocol according to an embodiment of the present invention.
Fig. 2 is a flow chart of the quantum byzantine consensus protocol employed by the novel blockchain system in an embodiment of the present invention.
Fig. 3 is a quantum circuit diagram for constructing a secure and efficient data list distribution method between nodes according to an embodiment of the present invention.
Fig. 4 is a schematic diagram of message transmission for completing consensus among 3 nodes according to an embodiment of the present invention.
FIG. 5 is a Merkel tree data structure for recording data according to an embodiment of the invention.
FIG. 6 is a block chain structure according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings and specific embodiments. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
A novel block chain system based on a quantum Byzantine consensus protocol is different from other block chain systems, and a peer-to-peer network in a base layer of the novel block chain system adopts a classical channel and a quantum channel to realize communication between nodes. The classical channel is used for transmitting a large amount of classical block data; the quantum channel is combined with the quantum computing technology to realize a novel secret number list distribution mode, and the secret number list distribution efficiency and the quantum resource utilization rate are improved. Each node in the user layer can achieve a quantum Byzantine consensus protocol in the core layer of the novel block chain system through the secret number list, and the fault-tolerant capability and the safety and reliability of the block chain system are improved. As shown in fig. 1, the system architecture includes three layers: user layer, core layer, and base layer. The user layer is composed of node management and service functions and is mainly responsible for various user (node) authentication access, exit and authority control, user service description, operation and other management works. The core layer comprises a quantum Byzantine consensus protocol, an intelligent contract and an encryption algorithm, and the quantum Byzantine consensus protocol realizes that each node can reach a consensus in an untrusted network environment within a specific time; the intelligent contract is responsible for realizing, compiling and deploying the service logic of the block chain system in a code form, and finishing condition triggering and automatic execution of a set rule; the encryption algorithm provides support for cryptographic algorithms for upper-layer components, and the support comprises various common hash algorithms, signature algorithms, privacy protection algorithms and the like. The basic layer comprises a computing storage and a peer-to-peer network, various computing tasks of the system are realized by using a CPU, a GPU and an ASIC, information such as block chain computing and uplink is stored by using storage resources such as a hard disk and the like, and communication interconnection among all nodes is realized by using quantum channels and classical channels.
The core characteristic of the novel block chain system is that a quantum Byzantine consensus protocol is adopted, a flow chart of the novel block chain system is shown in figure 2, and the novel block chain system mainly comprises the following steps:
the method comprises the following steps: master node P in user layer 1 And (4) selecting. In this embodiment, each node determines the master node P in common every round by adopting a round-robin scheme 1 . Master node P 1 Carrying out quantum state transmission with other common nodes through a quantum channel to cooperatively complete a quantum phase estimation algorithm, thereby generating a group of secret number lists l with specific association; the main node P is selected out first every time the consensus on the complete block needs to be carried out 1 。
Step two: master node P 1 And other common nodes distribute 256 sets of secret lists l with specific associations through quantum computation and quantum channels.
In this embodiment, each node needs to generate a corresponding set of secret number lists by the following process, and the circuit diagram implemented is shown in fig. 3, where
i is an imaginary unit, N is the number of total nodes in the block chain network, and N 1 Is the 1 st node, N 2 Is the 2 nd node, N n Is an nth node, comprising:
(1) master node P 1 Preparation of quantum states using 1 working bit and t auxiliary bits
|s>Is a quantum state representation composed of t auxiliary bits,
is the tensor symbol, |0>Is the initial state of the working bit.
(2) Master node P 1 Randomly selecting N from the set {0, 1.,. N-1} 1 Applying unitary operation
C is the operation of the control bit or bits,
is the operation of the target bit. As shown in FIG. 2, the control bit is the tth bit from top to bottom, and the target bit is the lowest bit, resulting in the first quantum state
|1>In the single-quantum bit state. Then the master node P 1 Transmitting | psi through quantum channel 1 >To the common node P 2 ；
(3) Common node P 2 Randomly selecting N from the set 0,1 2 Applying unitary operation
To obtain a second quantum state
Then the | psi is transmitted through the quantum channel 2 >To the common node P 3 ；
(4) Common node P 3 、P 4 、...、P n Repeating common node P 2 Obtaining the nth quantum state
At this time, the normal node P n Transmitting | psi through quantum channel n >Retransfer to master node P 1 。
(5) Repeating the processes of (2) to (4) t-1 times, wherein each node selects N each time k Must be identical to the one previously selected, except that: for the jth time, j ∈ { 1.,. T-1}, each node P k Is changed into
As shown in fig. 3, the control bit is the (t-j) th bit from top to bottom, and the target bit is always the lowermost bit.
(6) Master node P 1 Carrying out quantum Fourier inverse transformation operation on the t auxiliary bits to obtain quantum state | theta>Wherein
(7) Master node P 1 Selecting the appropriate supplementary number N s Make it
Updating N 1 ＝(N 1 +N s )modn。
Through the above process, each node is equivalent to a digit that determines its own list. The process of (1) to (7) is repeated L times, and a list set satisfying the following properties is generated between the nodes.
Property I: the list length is L. P 1 List l of 1 Is any one element of the set 0,1, 2. List l 2 ，l 3 ，...，l n Is arbitrarily chosen among the bits 0, 1.
Property II: for the j-th bit of each list, the following relationship is applied once l 1 If the j bit is 0 or 1, then the corresponding positions of other lists are all 0 or 1, if l 1 The j-th digit is denoted by x, and N ∈ { 2.,. N-1}, leaving the list with the corresponding position digits summed as N-x.
Step three: master node P 1 Sending block B, its summary information m and its secret list l according to itself through classical channel 1 Generated information position list V 1 To other nodes;
in this embodiment, the block B includes a block head and a block body, wherein: the zone block uses the Merkel tree to store the uplink data. The chunk header includes version number version, previous chunk hash prev _ hash, root merkle _ root of the mekerr tree, and timestamp ntime.
In this embodiment, the master node P 1 Valid data is selected from the data pool to form a Merkel tree as shown in FIG. 5, and the block stores the Merkel tree formed by selecting data from the data pool. The block chain structure is shown in fig. 6. The SHA-256 hash algorithm is used 2 times to obtain 256 bits of digest information m of the block header information of the block B, that is, m = SHA256 (version + prev _ hash + merkle _ root + ntime)). Master node P 1 According to the summary information m and the self secret list l of the block B 1 Generating corresponding list position information V 1 . Then, the summary information m of the block B and the corresponding list position information V are compared 1 Respectively sent to P through classical channels 2 、P 3 、...、P n 。
Step four: each node receives a master node P 1 After all the messages are sent, the block B, its summary information m and the list l according to its own secret are listed k Generated information position list V k And sending the data to other nodes. In this embodiment, the processes of step three and step four are shown in fig. 4, and fig. 4 is a schematic diagram of a message transmission process of 3 nodes.
Step five: and each node compares and verifies the obtained messages in the third step and the fourth step with the secret list of the node, and then determines to synchronize the update block or abandon the update.
In this example, P 2 、P 3 、...、P n After receiving the new block, checking the validity of the block and the digital signature of the data in the block (ensuring the cryptology); after the confirmation is valid, consistency verification (consensus mechanism guarantee) is carried out, P 2 、P 3 、...、P n Respectively sending own B and m to all other nodes through a classical channel. Since B and m in the classical channel are at risk of tampering, the generated list needs to be utilized to ensure synchronization m again. Each generated list can agree on a 1-bit binary number. For m of 256 bits, a total of 256 consensus is performed, and each time success is necessary, the consensus is really known.
For example, there are a total of 3 nodes in a blockchain network. Master node P 1 To agree on the message 010, 3 rounds of agreement on the binary digit are required, the 1 st round agreeing on the digit 0, assuming that P is now the case 1 、P 2 、P 3 The secret number lists obtained by the three nodes through the step two are respectively as follows:
l 1 ：{2，0，1，0，1，1，2，0，2}
l 2 ：{0，0，1，0，1，1，0，0，1}
l 3 ：{1，0，1，0，1，1，1，0，0}
1) If P is 1 Is honest and it will follow its own delivery plan, delivering m 12 ＝m 13 =0, simultaneously transmitting V 12 ＝V 13 = (2,4,8). When P is present 2 Receive m 12 And V 13 The following two results occur:
①m 12 、V 12 and l 2 Secret number list property 2 is satisfied, and the data are consistent;
②m 12 、V 12 and l 2 Do not satisfy Property 2,P 2 Acknowledgement P 1 Are malicious nodes. P 2 No action will be taken until P is reached in the next step of the protocol 3 A consensus plan is reached. For example when P 2 Receive m 12 ＝0，V 23 ＝(2，4，6)。
2)P 2 Transmitting the data received by the P to the P 3 . Message m 23 Not only 0 or 1, but also ″, indicating that i have received inconsistent data. And if P 2 The received message is 0 or 1, which needs to be sent to P 3 Some necessary data to indicate m 23 ＝m 12 . For this purpose, P 2 Also sends a list V 23 To P 3 And asserts that this is associated with slave P 1 To receive V 12 As such. When P is present 3 Receive from P 2 M of 23 、V 23 Or T, it has already received its hand from P 1 M of 13 And V 13 . Next, it is listed in P 3 The information in the hand is all that is possible. For a source from P 1 There are only 2 possible cases of (1):
①A 1 ：m 13 、V 13 、l 3 and (5) the consistency is achieved.
②A 2 ：m 13 、V 13 、l 3 Not coincident, i.e. ") j.
For a source from P 2 There are the following 4 cases.
①B 1 ：m 23 、V 23 、l 3 Are in agreement, and m 23 ＝m 13 。
②B 2 ：m 23 、V 23 、l 3 Are in agreement, and m 23 ≠m 13 。
③B 3 : "T", i.e., P 2 Tell P 3 He already knows P 1 Are traitors.
④B 4 ：m 23 、V 23 、l 3 And (4) inconsistency.
3) The above cases are arranged and combined as follows.
(1) If P is 3 The information in the hand is A 1 B 1 At this time, there is no malicious node, and 3 nodes achieve the round of consensus m 23 ＝m 13 。
(2) If P 3 The information in the hand is A 1 B 2 Then P 3 Can conclude that P 1 Is a malicious node, P 3 Abandon the consensus round. This is because P 1 Is the only one that can send consistent data to P 2 And P 3 The node of (2).
(3) If P is 3 The information in the hand is A 1 B 3 Then P 3 To achieve the common recognition m of the wheel 13 。
(4) If P is 3 The information in the hand is A 1 B 4 Then P 3 Acknowledgement P 2 Being a malicious node, P 3 To achieve the common recognition m of the wheel 13 . This is because P 3 Does not receive ″, which is indicated at P 2 M in hand 12 、V 12 And l 2 And (5) the consistency is achieved. If P is 2 Honesty, he must send m 23 ＝m 12 ，V 23 ＝V 12 To P 3 At this time m 23 、V 23 、l 3 Must also be consistent.
(5) If P 3 The information in the hand is A 2 B 1 Or A 2 B 2 At this time P 1 Is a malicious node, P 3 Abandon the consensus round.
(6) If P is 3 The information in the hand is A 2 B 3 Then P 2 And P 3 All know P 1 Is a malicious node, P 3 Abandon the consensus round.
⑦P 3 The information in the hand is A 2 B 4 In this case, only P can be described 1 And P 2 Are all malicious nodes, P 3 Abandon the consensus round.
In this embodiment, the novel block chain system based on the quantum byzantine consensus algorithm uses a classical-quantum two-layer peer-to-peer network for communication, the classical channel is used for transmitting a large amount of classical block data, and the quantum channel combines with a quantum computing technology to realize a novel secret digital list distribution mode, thereby improving the distribution efficiency of the secret digital list and the utilization efficiency of quantum resources thereof. The network node can achieve a detectable Byzantine consensus protocol in the block chain system through the secret number list, and the fault tolerance capability and the safety reliability of the block chain are improved. So far, the embodiments of the present invention have been described in detail with reference to the accompanying drawings. A person skilled in the art should have a clear understanding of a new blockchain system based on the quantum byzantine consensus protocol.
Implementations not depicted or described in the drawings or description are all forms known to those of ordinary skill in the art and are not specifically described in detail. Further, the above definitions of the various elements and methods are not limited to the various specific structures, shapes or arrangements of parts mentioned in the examples, which may be easily modified or substituted by those of ordinary skill in the art.
The above-mentioned embodiments further explain the objects, technical solutions and advantages of the present invention in detail. The invention is not to be considered as limited to the specific embodiments thereof, but is to be understood as being modified in all respects, all changes and equivalents that come within the spirit and scope of the invention.
Claims (8)
1. A novel block chain system based on quantum Byzantine consensus protocol is characterized in that the architecture of the novel block chain system comprises three layers: a user layer, a core layer and a base layer; the user layer comprises node management and service functions; the core layer comprises a quantum Byzantine consensus protocol, an intelligent contract and an encryption algorithm; the base layer comprises a computing storage and a peer-to-peer network;
the peer-to-peer network in the system base layer adopts a classical channel and a quantum channel for communication; the quantum Byzantine consensus protocol in the system core layer comprises the following steps: master node P 1 Selecting; master node P 1 Generating 256 groups of secret number lists with specific association with other common nodes through quantum computation and quantum channels; master node P 1 Sending block B, block summary information m and information position list V generated according to self secret list through classical channel 1 To other nodes; each node P k Receiving a master node P 1 After all messages are sent, the block summary information m and the secret list l are sent through the classical channel k Generated information position list V k Sending the data to other nodes; each node compares all the obtained messages with a self secret list for verification, and determines to update the block synchronously or abandon the update according to the verification result;
each node needs to generate a corresponding set of secret number lists by a process in which
i is an imaginary unit, N is the number of total nodes in the block chain network, and N 1 Is the 1 st node, N 2 Is the 2 nd node, N n Is an nth node, comprising:
(1) master node P 1 Preparation of quantum states using 1 working bit and t auxiliary bits
|s>Is a quantum state representation composed of t auxiliary bits,
is the tensor symbol, |0>Is the initial state of the working bit;
(2) master node P 1 Randomly selecting N from the set {0,1, \8230;, N-1} 1 Applying unitary operation
C is the operation of the control bit or bits,
an operation for a target bit; the control bit is the t bit from top to bottom, the target bit is the lowest bit, and the first quantum state is obtained
|1>In a single quantum bit state, and then the master node P 1 Transmitting | psi through quantum channel 1 >To the common node P 2 ；
(3) Common node P 2 Randomly selecting N from the set 0,1 2 Applying unitary operation
To obtain a second quantum state
Then the | psi is transmitted through the quantum channel 2 >To the common node P 3 ；
(4) Common node P 3 、P 4 、…、P n Repeating common node P 2 Obtaining the nth quantum state
At this time, the normal node P n Transmitting | psi through quantum channel n >Retransfer to master node P 1 ；
(5) Repeating the processes of (2) to (4) t-1 times, wherein each node selects N each time k Must be identical to the one previously selected, except that: for the jth, j ∈ {1, \ 8230;, t-1}, each node P k Operation ofBecome into
The control bit is the (t-j) th bit from top to bottom, and the target bit is the lowest bit all the time;
(6) master node P 1 Carrying out quantum Fourier inverse transformation operation on the t auxiliary bits to obtain quantum state | theta>In which
(7) Master node P 1 Selecting the appropriate supplemental number N s Make it
Updating N 1 ＝(N 1 +N s )mod n；
Through the process, each node is equivalent to a digit for determining the own list; repeating the processes from (1) to (7) for L times, and generating a list set which satisfies the following properties among the nodes:
property I: the list lengths are all L; p 1 List of (l) 1 Is any one element of the set {0,1,2, \ 8230;, n-1 }; list l 2 ,l 3 ,…,l n The element(s) of (2) is selected arbitrarily from the bits {0,1 };
property II: for the j-th bit of each list, the following relationship is applied once l 1 If the j bit is 0 or 1, then the corresponding positions of other lists are all 0 or 1, if l 1 The j-th digit is denoted by x and N ∈ {2, \ 8230;, N-1}, leaving the list with the sum of the corresponding position digits N-x.
2. The novel blockchain system of claim 1, wherein blockchain link points facilitate implementation of a quantum byzantine consensus protocol in a core layer of the blockchain system through successful distribution of a list of secret numbers.
3. The novel blockchain system of claim 1, wherein eachThe second recognition of the complete block requires the selection of the master node P at the user level 1 。
4. The novel blockchain system of claim 1, wherein master nodes are elected by round-robin.
5. The novel blockchain system of claim 1, wherein all nodes perform ntL quantum communication through quantum channel transmission by 1 working qubit and t auxiliary qubits to complete the quantum phase estimation algorithm; where n is the total number of nodes in the network and L is the length of the list of secret numbers.
6. The novel blockchain system of claim 1 wherein the blocks include a block header and a block body, the block body utilizing a meikel tree to store uplink data.
7. The novel blockchain system of claim 6, wherein the blockhead includes: version number, previous chunk hash, root of mekerr tree, timestamp.
8. The system of claim 6, wherein the digest information of the block is computed by hashing the block header twice by SHA-256 algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210054546.XA CN114615288B (en) | 2022-01-18 | 2022-01-18 | Novel block chain system based on quantum Byzantine consensus protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210054546.XA CN114615288B (en) | 2022-01-18 | 2022-01-18 | Novel block chain system based on quantum Byzantine consensus protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114615288A CN114615288A (en) | 2022-06-10 |
| CN114615288B true CN114615288B (en) | 2023-03-21 |
Family
ID=81857381
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210054546.XA Active CN114615288B (en) | 2022-01-18 | 2022-01-18 | Novel block chain system based on quantum Byzantine consensus protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114615288B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106027163A (en) * | 2016-04-26 | 2016-10-12 | 苏州大学 | Quantum dialogue method based on network encoding |
| EP3461059A1 (en) * | 2017-09-22 | 2019-03-27 | NEC Laboratories Europe GmbH | Scalable byzantine fault-tolerant protocol with partial tee support |
| CN110677485A (en) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | Dynamic layered Byzantine fault-tolerant consensus method based on credit |
| CN111614468A (en) * | 2020-05-24 | 2020-09-01 | 济南欣格信息科技有限公司 | Block chain consensus method and system |
| CN112329051A (en) * | 2020-10-23 | 2021-02-05 | 中国科学院数据与通信保护研究教育中心 | Safe and efficient consensus mechanism implementation method and system |
| CN113271204A (en) * | 2021-05-06 | 2021-08-17 | 西安电子科技大学 | Byzantine fault-tolerant consensus method based on quantum key distribution |
| EP3886356A1 (en) * | 2020-03-23 | 2021-09-29 | Deutsche Telekom AG | Method and system of quantum key distribution |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| MY147120A (en) * | 2008-09-10 | 2012-10-31 | Mimos Berhad | Method of integrating quantum key distribution with internet key exchange protocol |
| KR101070473B1 (en) * | 2009-10-13 | 2011-10-06 | 아주대학교산학협력단 | Method for generating dynamic group key |
| US9294272B2 (en) * | 2011-09-12 | 2016-03-22 | Norbert Lütkenhaus | System and method for quantum key distribution |
-
2022
- 2022-01-18 CN CN202210054546.XA patent/CN114615288B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106027163A (en) * | 2016-04-26 | 2016-10-12 | 苏州大学 | Quantum dialogue method based on network encoding |
| EP3461059A1 (en) * | 2017-09-22 | 2019-03-27 | NEC Laboratories Europe GmbH | Scalable byzantine fault-tolerant protocol with partial tee support |
| CN110677485A (en) * | 2019-09-30 | 2020-01-10 | 大连理工大学 | Dynamic layered Byzantine fault-tolerant consensus method based on credit |
| EP3886356A1 (en) * | 2020-03-23 | 2021-09-29 | Deutsche Telekom AG | Method and system of quantum key distribution |
| CN111614468A (en) * | 2020-05-24 | 2020-09-01 | 济南欣格信息科技有限公司 | Block chain consensus method and system |
| CN112329051A (en) * | 2020-10-23 | 2021-02-05 | 中国科学院数据与通信保护研究教育中心 | Safe and efficient consensus mechanism implementation method and system |
| CN113271204A (en) * | 2021-05-06 | 2021-08-17 | 西安电子科技大学 | Byzantine fault-tolerant consensus method based on quantum key distribution |
Non-Patent Citations (5)
| Title |
|---|
| Quantum circuit and Byzantine generals problem;Chia-Hung Chien,Tein-Sheng Lin,Chin-Yung Lu,Shih-Yi Yuan;《2012 12th IEEE International Conference on Nanotechnology (IEEE-NANO)》;全文 * |
| Quantum Consensus;Jorden Seet，Paul Griffin;《2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)》;全文 * |
| Threats and Opportunities: Blockchain meets Quantum Computation;Wei Cui，Tong Dou，Shilu Yan;《2020 39th Chinese Control Conference (CCC)》;全文 * |
| 区块链的共识机制研究;翟冉，陈学斌;《数据与计算发展前沿》;第3卷(第3期);全文 * |
| 基于PBFT算法改进的区块链共识机制研究与实现;余戈;《中国优秀硕士学位论文全文数据库（信息科技辑）》(第5期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114615288A (en) | 2022-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6726367B2 (en) | Changing the primary node in a distributed system | |
| CN109768987B (en) | Block chain-based data file safe and private storage and sharing method | |
| JP6732321B2 (en) | Execution of recovery processing for network nodes in distributed systems | |
| CN110169015B (en) | Achieving consensus among network nodes in a distributed system | |
| US11128522B2 (en) | Changing a master node in a blockchain system | |
| CN112329051B (en) | Safe and efficient consensus mechanism implementation method and system | |
| TWI720918B (en) | Consenus of shared blockchain data storage based on error correction code | |
| Zhan et al. | DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains | |
| CN112418860A (en) | Block chain efficient management framework based on cross-chain technology and working method | |
| CN113271204B (en) | Byzantine fault-tolerant consensus method based on quantum key distribution | |
| TW202119243A (en) | Prioritizing shared blockchain data storage | |
| CN113328997B (en) | Alliance chain crossing system and method | |
| TW202119210A (en) | Data security of shared blockchain data storage based on error correction code | |
| Chen et al. | DEXON: a highly scalable, decentralized DAG-based consensus algorithm | |
| CN112116349B (en) | High-throughput-rate-oriented random consensus method and device for drawing account book | |
| CN111466098A (en) | Block chain implemented security system and method for blind result selection | |
| WO2019142884A1 (en) | Block verification device, block verification method and program | |
| US20210021429A1 (en) | Delegated Signatures for Smart Devices | |
| CN110750796A (en) | Encrypted data duplication removing method supporting public audit | |
| Dolev et al. | SodsBC: a post-quantum by design asynchronous blockchain framework | |
| Gerrits et al. | Experimental scalability study of consortium blockchains with bft consensus for iot automotive use case | |
| CN114615288B (en) | Novel block chain system based on quantum Byzantine consensus protocol | |
| CN111541668A (en) | Energy Internet of things information safe transmission and storage method based on block chain | |
| TW202034651A (en) | Method for information verification in distributed systems | |
| CN115174048A (en) | Consensus method, system and consensus node |
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 |