CN115118420A - Communication method based on quantum detectable weak Byzantine protocol - Google Patents
Communication method based on quantum detectable weak Byzantine protocol Download PDFInfo
- Publication number
- CN115118420A CN115118420A CN202211034093.0A CN202211034093A CN115118420A CN 115118420 A CN115118420 A CN 115118420A CN 202211034093 A CN202211034093 A CN 202211034093A CN 115118420 A CN115118420 A CN 115118420A
- Authority
- CN
- China
- Prior art keywords
- node
- leader
- leader node
- message
- quantum
- 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.)
- Pending
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
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- 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/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Multi Processors (AREA)
Abstract
The invention discloses a communication method based on a quantum detectable weak Byzantine protocol, which comprises the following steps: initializing parameters of all communication nodes in the distributed system; randomly selecting a leader node from all communication nodes and generating a quantum entanglement state and a message array by using the leader node; distributing the quantum entanglement state to other communication nodes according to a preset distribution rule; according to a preset detection rule, other communication nodes detect the received quantum entanglement state; the leader node broadcasts the message array in the distributed system, and other communication nodes detect the received message number and update the effective information set of the other communication nodes according to the detection result; when the message arrays in the communication node valid information set are a preset number, the communication node receives the messages in the message arrays.
Description
Technical Field
The invention relates to the field of quantum cryptography and distributed consensus methods, in particular to a communication method based on a quantum detectable weak Byzantine protocol.
Background
The problem of byzantine consensus refers to how to realize consensus on certain information in a distributed system under the condition that a node with a byzantine error occurs, wherein the byzantine error means that the node can arbitrarily act away from a system protocol, such as offline, forged information and the like. The byzantine problem is widely existed in various distributed systems as a distributed fault tolerance problem. The distributed formula method for solving the problem of the byzantine consensus is called a byzantine consensus protocol, and common byzantine consensus protocols include PBFT, RAFT, PoW, PoS and the like. The Byzantine consensus protocol has been widely applied in various fields such as blockchain technology, federal learning, internet of vehicles, Internet of things and the like, for example, in the blockchain technology, the bitcoin realizes the consistency of decentralized distributed accounts through the Byzantine consensus protocol.
However, in the prior art, the communication method based on the existing quantum Byzantine protocol has the problems of insufficient expansibility, low communication safety and communication efficiency and the like.
Disclosure of Invention
In view of the above, the present invention provides a communication method based on a quantum detectable weak byzantine protocol, so as to be able to solve at least one of the above problems.
According to an embodiment of the present invention, there is provided a communication method based on a quantum detectable weak byzantine protocol, including:
initializing distributed systems
Parameters of the communication nodes, wherein the parameters of the communication nodes comprise the number of the communication nodes, magic list, index set, tolerable error bit number, error flag, maximum length and valid information set,
is a positive integer;
randomly selecting a leader node from the communication nodes, and generating quantum entangled states through the leader node, wherein the number of the quantum entangled states is the same as the value of the maximum length, and each quantum entangled state comprises
A quantum bit;
sending each quantum bit of each quantum entanglement state to a corresponding communication node through a leader node, and detecting the quantum bit received by each communication node according to a quantum distribution and test scheme;
obtaining a message array by using a leader node and broadcasting the message array in a distributed system, wherein the message array comprises information needing to be identified, a summary of the information needing to be identified, which is generated by a summary function, and an index set generated by using a message broadcasting scheme;
detecting the message array from the leader node by using a non-leader node in the communication nodes, adding the detected message array into an effective information set of the communication nodes, and broadcasting the detected message array in a distributed system;
detecting message arrays from other non-leader nodes by using a non-leader node, and adding the message arrays which pass the detection and are not contained in the effective information set of the node to the effective information set of the node;
and under the condition that the number of the message arrays in the effective information set of the communication node is a preset number, the communication node receives the information needing to be identified in the message arrays.
According to an embodiment of the invention, a communication node
Magic list
Is a sequence of numbers and is initialized to a null sequence,
；
wherein the magic list for each communication node is unique in the distributed system;
wherein the communication node
Index collection of (2)
Is a set
And initialized into an empty set, wherein,
representing a communication node
Magic list
Length of (d);
wherein the communication node
Tolerable number of error bits
Representing the maximum number of error bits that can be tolerated when verifying the message array, wherein,
，
representing the length of the summary generated by the summary function;
wherein the communication node
Error flag of
Is a boolean value and is initialized to FALSE;
wherein the communication node
Maximum length of
Representing the maximum length of the magic list in the quantum detectable weak byzantine protocol, wherein,
；
wherein the communication node
Is effectively collected
Includes an array of messages and is initialized to an empty set;
wherein, the first and the second end of the pipe are connected with each other,
the communication nodes have the same number of tolerable error bits and maximum length.
According to the embodiment of the invention, the digest function is a one-way quantum hash function capable of resisting quantum attack, the output of the digest function can pass a randomness test, the same input of the digest function can generate the same output, the length of the output of the digest function is fixed, and mutual information quantity cannot exist between different outputs generated by different inputs of the digest function.
According to an embodiment of the present invention, the sending, by the leader node, the respective qubits of each quantum entangled state to the corresponding communication node includes:
leading the node to obtain an entangled state formed by the first two quantum bits of each quantum entangled state;
the leader node transmits the qubits at the other positions of each quantum entangled state to the non-leader node, wherein the non-leader node obtains 1 qubit at the other positions of each quantum entangled state.
According to an embodiment of the present invention, the detecting, by each communication node, the qubits received by itself according to the quantum distribution and test scheme includes:
the non-leader node checks whether the quantum bit in the quantum entanglement state sent by the leader node is in the maximum mixed state or not to obtain a check result;
in the case where the check result is not in the maximum mixture state, the following operations are performed:
setting the self error mark to FALSE by the non-leader node and broadcasting the self error mark in the distributed system;
and performing initialization operation again, leader node random selection operation, quantum entanglement state generation operation sending and quantum entanglement state generation operation detection operation.
According to an embodiment of the present invention, the sending, by the leader node, the respective qubit of each quantum entangled state to the corresponding communication node further includes:
in the case where the check result is in the maximum mixing state, the following operations are performed:
the communication node detects the received quantum bit based on the preset quantum entanglement state to obtain the length of
Wherein the detection result of the leader node comprises (1,1), (0,0), (0,1) and (1,0), the detection result of the non-leader node comprises 0 and 1, and the preset quantum entanglement state comprises
And
；
the communication nodes broadcast the detection results at the preset positions in the quantum sequence in the distributed system and collect the detection results broadcast by other communication nodes;
when the communication node receives that the error flag sent by other communication nodes is FALSE, the communication node carries out initialization operation, leader node random selection operation, quantum entangled state generation operation sending and quantum entangled state generation operation detection operation again;
detecting the collected detection results of other communication nodes by the communication nodes according to preset detection conditions to obtain detection results;
under the condition that the detection result does not meet the preset detection condition, the communication node sets the error flag of the communication node to FALSE, broadcasts the error flag of the communication node in the distributed system, and performs initialization operation, leader node random selection operation, quantum entanglement state generation operation sending and quantum entanglement state generation operation detection operation again;
and under the condition that the detection result meets the preset detection condition, the communication node sets the magic list of the communication node to be a sequence on a non-preset position.
According to an embodiment of the present invention, the number of the preset positions is set by
It is determined that the preset position is randomly selected,
representing the length of the summary generated by the summary function;
wherein, the preset detection conditions comprise: the detection result of the leader node is (1,1), the detection results of the positions corresponding to the non-leader nodes are all 1, the detection result of the leader node is (0,0), the detection result of the positions corresponding to the non-leader nodes are all 0, the detection result of the leader node is (0,1), the detection results of 1 non-leader node are 0, the detection results of the positions corresponding to the other non-leader nodes are all 1, the detection result of the leader node is (1,0), the detection results of 1 non-leader node are 1, and the detection results of the positions corresponding to the other non-leader nodes are all 0.
According to an embodiment of the present invention, the obtaining a message array by using the leader node and broadcasting the message array in the distributed system includes:
the leader node detects and generates a summary of the message needing to be identified by using a summary function;
the leader node counts variables
And position variable
Initializing to 1;
leader node compares the digests
Number of bits and magic List of leader node
The number of bits, in case the comparison result is equal, will count the variable
Adds the value of (2) to the end of the index set of the leader node, and counts the variables
The value of (a) is increased by 1;
counting variables
Is less than or equal to the maximum length of the leader node, the leader node will place the position variable
Increases by 1 and performs the comparison operation again;
counting variables
If the value of (a) is greater than the maximum length of the leader node, the leader node combines the message, the summary and the index set that need to be known together into a message array and broadcasts the message array in the distributed system.
According to an embodiment of the present invention, the detecting the message array from the leader node by using the non-leader node, adding the detected message array to the valid information set of the non-leader node, and broadcasting the detected message array in the distributed system includes:
the non-leader node detects the message array from the leader node by using a summary function, and determines that the detection result of the message array from the leader node is passed under the condition that the summary in the message array from the leader node is the corresponding summary of the information needing to be identified in the message array from the leader node;
the non-leader node detects an index sequence in the message array from the leader node, and initializes a first empty character string under the condition that the index sequence in the message array from the leader node is an increasing sequence;
the non-leader node iteratively checks the index sequence in the array of messages from the leader node
Digit number
In a
In case of (2), the non-leader node will be the first of its own magic list
The number in bits is added to the end of the first empty string;
determining that the detection result of the message array from the leader node is passed under the condition that the abstract is equal to the first empty character string and the communication node is the leader node or the hamming distance between the abstract and the first empty character string is less than the tolerable error bit number and the communication node is not the leader node;
the non-leader node adds the message array from the leader node and passing the detection to the effective information set of the non-leader node and broadcasts the message array from the leader node and passing the detection in the distributed system.
According to an embodiment of the present invention, the detecting, by the non-leader node, the message arrays from other non-leader nodes, and adding the message array that passes the detection and is not included in the valid information set of the non-leader node to the valid information set of the non-leader node includes:
the non-leader node detects the message arrays from other non-leader nodes by using a summary function, and determines that the detection result of the message arrays from other non-leader nodes is passed under the condition that the summaries of the message arrays from other non-leader nodes are the summaries corresponding to the messages needing to be known together in the message arrays from other non-leader nodes, wherein the message arrays of other non-leader nodes are not contained in the effective information set of the non-leader nodes;
the non-leader node checks the index sequences in the message arrays from other non-leader nodes, and determines that the detection results of the message arrays from other non-leader nodes pass when the index sequences in the message arrays from other non-leader nodes are the increasing sequences;
in the case that the index sequence in the message array from the other non-leader nodes is not an incremental sequence, the non-leader nodes initialize 1 empty string;
the non-leader node iteratively checks the index sequence in the array of messages from other non-leader nodes
Digit number
In a
In case of (2), the non-leader node will be the first in its own magic list
The digits of the bits are added to the end of the string;
under the condition that the abstract is equal to the null character and the communication node is a leader node or the hamming distance between the abstract and the null character is less than the tolerable error bit number and the communication node is not the leader node, determining that the detection result of the message arrays from other non-leader nodes is passed;
the non-leader node adds the message arrays which come from other non-leader nodes and pass the detection to the effective information set of the non-leader node.
The invention uses the forward abstraction technology, can use the limited quantum entanglement resource to realize the consensus on the infinite classical bit information; in addition, the invention realizes the multi-party quantum detectable weak Byzantine consensus protocol, and has better expandability and practicability compared with the existing three-party quantum Byzantine consensus protocol; meanwhile, the method provided by the invention has an optimal fault tolerance boundary, and can realize quantum detectable weak Byzantine consensus under the condition that the number of Byzantine nodes in the system is less than the total number of the nodes.
Drawings
FIG. 1 is a flow diagram of a quantum detectable weak Byzantine protocol based communication method according to an embodiment of the invention;
FIG. 2 is a flow diagram of transmitting individual qubits for each quantum entangled state by a leader node to a corresponding communication node in accordance with an embodiment of the present invention;
FIG. 3 is a flow chart of each communication node detecting its own received qubits in accordance with an embodiment of the present invention;
FIG. 4 is a flow diagram of each communication node detecting its own received qubits in accordance with another embodiment of the invention;
FIG. 5 is a flow diagram of obtaining an array of messages and broadcasting the array of messages in a distributed system using a leader node according to an embodiment of the invention;
FIG. 6 is a flow diagram of a non-leader node detecting an array of messages from a leader node, according to an embodiment of the present invention;
FIG. 7 is a flow diagram of detection of an array of messages from other non-leader nodes by a non-leader node according to an embodiment of the present invention;
FIG. 8 is a flow diagram of a communication method for an optimal tolerance based high efficiency quantum detectable weak Byzantine protocol according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of a measurement result of a quantum entangled state generated using a quantum detectable weak Byzantine protocol based communication method according to an embodiment of the present invention;
fig. 10 is an exemplary diagram of generating and validating an array of messages from a message using a quantum detectable weak byzantine protocol based communication method according to an embodiment of the invention.
Detailed Description
In order that the objects, technical solutions and advantages of the present invention will become more apparent, the present invention will be further described in detail with reference to the accompanying drawings in conjunction with the following specific embodiments.
In the prior art, in consideration of the fact that the continuous development of quantum cryptography can destroy the cryptography foundation of the traditional Byzantine consensus protocol, for example, a Grover search algorithm can greatly accelerate hash operation while a Shor algorithm can be used for breaking an RSA public key system, and the problem needs to be solved by introducing the quantum Byzantine consensus protocol. Because quantum channels and quantum computing cannot solve the problem of Byzantine consensus, the existing quantum Byzantine consensus protocol mainly focuses on solving the problem of weakened Byzantine consensus, such as Detectable Byzantine consensus (detective Byzantine agent) and Weak Byzantine consensus (Weak Byzantine agent).
The existing quantum Byzantine consensus protocol mainly comprises the following steps: the three-party quantum detectable byzantine consensus protocol based on entangled qurtrit proposed by Fitzi et al, and the fast quantum byzantine consensus protocol based on the meak global coin proposed by Ben-Or et al.
The problems of the above quantum byzantine consensus protocol mainly include: (1) the expansibility of the protocol is insufficient, and as the system scale is enlarged, the safety and efficiency of the protocol will be reduced. The three-party quantum detectable Byzantine consensus protocol, as proposed by Fitizi et al, can only achieve consensus among three nodes, if necessary extended to
The node needs to call the protocol
Secondly, the message complexity of the protocol is increased while more quantum entanglement resources are neededA source; (2) in previous work, a large amount of quantum entanglement resources are needed to complete the consensus on a classical information bit, and the efficiency is insufficient. In order to improve the practicability and efficiency of the quantum Byzantine consensus protocol, the consensus on more classical information bits needs to be completed by using the same quantum entanglement resource on the premise of ensuring the safety of the protocol.
The invention aims to solve the problems of the existing quantum Byzantine protocol, provides an efficient quantum detectable weak Byzantine protocol based on an optimal tolerance boundary, and provides a communication method based on the protocol.
Fig. 1 is a flow diagram of a quantum detectable weak byzantine protocol based communication method according to an embodiment of the invention.
As shown in fig. 1, the communication method based on the quantum detectable weak byzantine protocol includes operations S110 to S170.
Initializing the distributed system in operation S110
Parameters of the communication nodes, wherein the parameters of the communication nodes comprise the number of the communication nodes, magic list, index set, tolerable error bit number, error flag, maximum length and valid information set,
is a positive integer.
For any one communication node
Magic list
Is a sequence of numbers and is initialized to a null sequence,
(ii) a The magic list of the leader node consists of 4 numbers of 0,1, 2 and 3, and the magic list of the non-leader node consists of two numbers of 0 and 1The magic list of the leader node can be 001122 or 001233, for example, the magic list of the leader node can be composed of any one or more of 4 numbers of 0,1, 2 and 3, and similarly, the magic list of the non-leader node can be composed of any one or more of 0 and 1; the magic list of each correspondent node is unique in the distributed system, i.e. each correspondent node has a unique magic list that is different from the other correspondent nodes.
For any one communication node
Index set of
Is a set
And initialized into an empty set, wherein,
representing a communication node
Magic list
Length of (d).
For any one communication node
Tolerable error bit number
Representing the maximum number of error bits that can be tolerated when verifying the message array, wherein,
，
representing the length of the digest generated by the digest function.
For any one communication node
Error flag of
Is boolean and is initialized to FALSE.
For any one communication node
Maximum length of
Representing the maximum length of the magic list in the quantum detectable weak byzantine protocol, wherein,
。
for any one communication node
Is effectively set
An array of messages is included and initialized into an empty set.
All communication nodes have the same tolerable error bit number and maximum length, and the tolerable error bit number and the maximum length can also be regarded as system variables of a distributed system and are shared by all the communication nodes.
In operation S120, a leader node is randomly selected from the communication nodes, and quantum entangled states, each of which includes a value of a maximum length, are generated through the leader node, wherein the number of the quantum entangled states is the same as that of the maximum length
Qubits.
The quantum entangled state generated by the leader node
Number and maximum length of
The same is true.
In operation S130, the respective qubits in each quantum entangled state are transmitted to the corresponding communication nodes by the leader node, and the qubits received by itself are detected by each communication node according to the quantum distribution and test scheme.
In the above transmission process, the quantum entangled state composed of the first two qubits of each quantum entangled state is held by the leader node, and for each quantum entangled state
The qubits in other positions, e.g. the qubit in position 3, are then sent by the leader node to the non-leader node, sending only one qubit in other positions of each quantum entangled state to the non-leader node at a time.
In operation S140, an array of messages is obtained by the leader node and is broadcast in the distributed system, where the array of messages includes information that needs to be identified, a summary of the information that needs to be identified, generated by a summary function, and an index set generated by a message broadcast scheme.
The abstract function is a one-way quantum hash function capable of resisting quantum attack, the output of the abstract function can pass a randomness test, the same input of the abstract function can generate the same output, the length of the output of the abstract function is fixed, and mutual information quantity cannot exist between different outputs generated by different inputs of the abstract function.
All communication nodes use the above digest function to perform subsequent detection or message verification operations.
In operation S150, the non-leader node detects an array of messages from the leader node, adds the array of messages passing the detection to its own valid information set, and broadcasts the array of messages passing the detection in the distributed system.
In operation S160, the non-leader node detects message arrays from other non-leader nodes, and adds a message array that passes the detection and is not included in the valid information set of the non-leader node to the valid information set of the non-leader node.
Operation S160 performs a detection of an array of messages from a non-leader node, e.g. a non-leader node
For the node from the non-leader
The array of messages of (1) is detected, wherein,
。
in operation S170, in the case that the number of message arrays in the valid information set of the communication node is a preset number, the communication node accepts information that needs to be commonly recognized in the message arrays.
The preset number may be 1.
The invention uses the forward abstraction technology, can use the limited quantum entanglement resource to realize the consensus on the infinite classical bit information; in addition, the invention realizes the multi-party quantum detectable weak Byzantine consensus protocol, and has better expandability and practicability compared with the existing three-party quantum Byzantine consensus protocol; meanwhile, the method provided by the invention has an optimal fault tolerance boundary, and can realize quantum detectable weak Byzantine consensus under the condition that the number of Byzantine nodes in the system is less than the total number of the nodes.
Fig. 2 is a flow diagram of transmitting individual qubits for each quantum entanglement state by a leader node to a corresponding communication node in accordance with an embodiment of the present invention.
As shown in FIG. 2, the sending of the qubits of each quantum entangled state to the corresponding communication node by the leader node comprises operations S210-S220.
In operation S210, the leader node obtains an entangled state composed of the first two qubits of each quantum entangled state.
In operation S220, the leader node transmits the qubits at the other positions of each quantum entangled state to the non-leader node, wherein the non-leader node obtains 1 qubit at the other positions of each quantum entangled state.
The leader node entangles each quantum in a state
The first two subsystems (the first two qubits of the quantum entangled state) constitute an entangled state held by the leader node, and the other subsystems (the qubits in the respective positions) are distributed to corresponding and unique non-leader nodes.
The quantum entangled state distribution process may be, for example, a process for distributing any one of the quantum entangled states
Its quantum entanglement state composed of 1 st and 2 nd qubits is held by the leader node, and for the 1 st
Position (a)
) The above qubits are sent to 1 non-leader node, and each non-leader node only obtains 1 qubit of 1 quantum entangled state.
Fig. 3 is a flow chart of each communication node detecting its own received qubits according to an embodiment of the invention.
As shown in FIG. 3, according to the quantum distribution and test scheme, detecting the qubits received by each communication node comprises operations S310-S330.
In operation S310, the non-leader node checks whether the qubit in the quantum entanglement state sent by the leader node is in the maximum mixture state, resulting in a check result.
In the case where the check result is not in the maximum mixture state, the following operations are performed:
in operation S320, the non-leader node sets its own error flag to FALSE and broadcasts its own error flag in the distributed system.
In operation S330, the initialization operation, the leader node random election operation, the quantum entangled state generation operation transmission, and the quantum entangled state generation operation detection operation are newly performed.
Fig. 4 is a flow chart of each communication node detecting its own received qubit according to another embodiment of the invention.
As shown in FIG. 4, the transmitting, by the leader node, the respective qubits for each quantum entangled state to the corresponding communication node further comprises operations S340-S380.
In the case where the check result is in the maximum mixing state, the following operations are performed:
in operation S340, the communication node detects the received qubit based on a preset quantum entanglement state to obtain a length of
The quantum sequence of (1), wherein the detection result of the leader node comprises (1,1), (0,0), (0,1) and (1,0), the detection result of the non-leader node comprises 0 and 1, and the preset quantum entanglement state comprises
And
。
in operation S350, the communication node broadcasts the detection result at a preset position in the quantum sequence in the distributed system and collects the detection results broadcast by other communication nodes.
In operation S360, when the communication node receives that the error flag sent by another communication node is FALSE, the initialization operation, the leader node random election operation, the quantum entangled state generation operation sending, and the quantum entangled state generation operation detection operation are performed again.
In operation S370, the communication node detects the collected detection results of other communication nodes according to a preset detection condition, and obtains a detection result.
In operation S380, if the detection result does not satisfy the preset detection condition, the communication node sets its own error flag to FALSE, broadcasts its own error flag in the distributed system, and performs the initialization operation, the leader node random selection operation, the quantum entanglement state generation operation transmission, and the quantum entanglement state generation operation detection operation again.
And under the condition that the detection result meets the preset detection condition, the communication node sets the magic list of the communication node to be a sequence on a non-preset position.
According to an embodiment of the present invention, the number of the preset positions is set by
It is determined that the preset position is randomly selected,
representing the length of the digest generated by the digest function.
Wherein, the preset detection conditions comprise: the detection result of the leader node is (1,1), the detection results of the positions corresponding to the non-leader nodes are all 1, the detection result of the leader node is (0,0), the detection result of the positions corresponding to the non-leader nodes are all 0, the detection result of the leader node is (0,1), the detection results of 1 non-leader node are 0, the detection results of the positions corresponding to the other non-leader nodes are all 1, the detection result of the leader node is (1,0), the detection results of 1 non-leader node are 1, and the detection results of the positions corresponding to the other non-leader nodes are all 0.
The flow shown in fig. 4 will be described in further detail below with reference to specific embodiments.
Communication nodes (including leader node and non-leader node) to
And
obtaining a length of
The result obtained by detecting each subsystem by other non-leader nodes except the leader node is 0 or 1, each subsystem of the leader node comprises two qubits, and the detected results are one of four cases (1,1), (0,0), (0,1) and (1,0), which are respectively represented by 0,1, 2 and 3; random selection in quantum sequences
The communication node broadcasts the detection result at the randomly selected position, collects the detection results of other communication nodes, if the communication node
Receiving other communication nodes
Transmitted error flag
Then, the communication method terminates the continuous operation (i.e., operations S140 to S170), and resumes operations S110 to S130.
The communication node detects whether the collected result meets the following conditions: (1) in the first case, when the detection result of the leader node is 0, the detection results of the positions corresponding to other nodes are all 1; (2) in case two, when the detection result of the leader node is 1, the detection results of the positions corresponding to other nodes are 0; (3) in case III, when the detection result of the leader node is 2, the detection result of the only node is 0, and the detection results of the positions corresponding to other nodes are 1; (4) in case four, when the detection result of the leader node is 3, the detection result of the only node is 1, and the detection results of the positions corresponding to other nodes are 0; (5) the probabilities of the above four cases occurring are 1/3, 1/3, 1/6 and 1/6, respectively.
If the detection result does not satisfy the 4 conditions or the communication node receives other communication nodes
Error flag of transmission
The communication node marks itself as an error
Setting the error flag to be FALSE, broadcasting the error flag in the distributed system, terminating the subsequent operations (i.e., operations S140 to S170) by the communication method, and performing operations S110 to S130 again.
FIG. 5 is a flow diagram of obtaining an array of messages and broadcasting the array of messages in a distributed system using a leader node according to an embodiment of the invention.
As shown in FIG. 5, the obtaining of the message array by using the leader node and the broadcasting of the message array in the distributed system include operations S410 to S450.
In operation S410, the leader node detects and generates a digest of the message that needs to be agreed by using a digest function;
in operation S420, the leader node counts variables
And position variable
Initialized to 1.
In operation S430, the leader node compares the digests first
Number of bits and magic List of leader node
The number of bits, in case the comparison result is equal, will count the variable
Adds the value of (2) to the end of the index set of the leader node, and counts the variables
The value of (a) is increased by 1.
In operation S440, variables are counted
Is less than or equal to the maximum length of the leader node, the leader node will place the position variable
Is increased by 1 and the comparison operation is repeated.
In operation S450, variables are counted
If the value of (a) is greater than the maximum length of the leader node, the leader node combines the message, the summary and the index set that need to be known together into a message array and broadcasts the message array in the distributed system.
The operations S410 to S450 will be described in further detail with reference to the following embodiments.
Leader node
Collecting information requiring consensus
Generated using a digest function
Summary of (1)
Generating index sets using a message broadcast scheme
And broadcasting the message array
(ii) a Leader node key function detection generation message
Summary of (1)
(ii) a Leader node initialization count variable
Position variable
(ii) a Comparison summary
To (1) a
Magic list of bits and leader node itself
If the two numbers of bits are equal, the bit numbers are first equal
Is added to the index set
At the end of (1), then order
(ii) a If it is not
Then the corresponding message is sent
Abstract of the disclosure
And index set combined into message array
And broadcasts the message array, otherwise orders
Go to the comparison operation.
FIG. 6 is a flow diagram of a non-leader node detecting an array of messages from a leader node, according to an embodiment of the present invention.
As shown in fig. 6, the detecting the message array from the leader node by using the non-leader node, adding the detected message array to the effective information set of itself, and broadcasting the detected message array in the distributed system includes operations S510 to S550.
In operation S510, the non-leader node detects the message array from the leader node by using a digest function, and determines that the detection result of the message array from the leader node is a pass if the digest in the message array from the leader node is the corresponding digest of the information that needs to be known in the message array from the leader node.
And determining that the detection result of the message array from the leader node is not passed in the case that the summary in the message array from the leader node is not the corresponding summary of the information needing to be commonly identified in the message array from the leader node.
In operation S520, the non-leader node detects an index sequence in the array of messages from the leader node, and initializes a first empty string in the case where the index sequence in the array of messages from the leader node is an incremented sequence.
And determining that the detection result of the message array from the leader node is not passed in the case that the index sequence in the message array from the leader node is an increment sequence.
In operation S530, the non-leader node iteratively checks the index sequence in the array of messages from the leader node
Digit number
In a
In case of (2), the non-leader node will be the first of its own magic list
The number of bits is added to the end of the first dummy string.
In that
In the case of (2), the detection result of the message array from the leader node is determined to be failed. Wherein the content of the first and second substances,
indicates the index sequence of
The value on the bit.
In operation S540, in a case where the digest is equal to the first empty character string and the communication node is a leader node or a hamming distance between the digest and the first empty character string is less than a tolerable number of error bits and the communication node is not the leader node, it is determined that a detection result of the message array from the leader node is a pass.
And if the two conditions are not met at the same time, determining that the detection result of the message array from the leader node is failed.
In operation S550, the non-leader node adds the array of passed detected messages from the leader node to its own active information set and broadcasts the array of passed detected messages from the leader node in the distributed system.
FIG. 7 is a flow diagram of detection of an array of messages from other non-leader nodes by a non-leader node according to an embodiment of the present invention.
As shown in fig. 7, the detecting of the message arrays from other non-leader nodes by the non-leader node, and adding the message arrays that pass the detection and are not included in the valid information set of the node to the valid information set of the node includes operations S610 to S660.
In operation S610, the non-leader node detects the message arrays from other non-leader nodes by using a digest function, where the digests of the message arrays from other non-leader nodes are digests corresponding to messages that need to be known together in the message arrays from other non-leader nodes, and determines that the detection result of the message arrays from other non-leader nodes is passed, where the message arrays of other non-leader nodes are not included in the valid information set of the leader node.
It will be appreciated by those skilled in the art that the non-leader node and the other non-leader nodes are two distinct communication nodes.
In operation S620, the non-leader node checks the index sequences in the message arrays from other non-leader nodes, and determines that the detection result of the message arrays from other non-leader nodes is a pass if the index sequences in the message arrays from other non-leader nodes are an increasing sequence.
Otherwise, determining that the detection result of the message arrays from other non-leader nodes is a pass-fail result.
In operation S630, in case the index sequence from the other non-leader nodes and not included in the message array in its own valid information set is not an incrementing sequence, the non-leader node initializes 1 empty string.
And in the case that the index sequence in the message array which is from other non-leader nodes and not included in the self effective information set is an increment sequence, determining that the detection result of the message array from other non-leader nodes is not passed.
In operation S640, the non-leader node iteratively checks the index sequence in the array of messages from other non-leader nodes
Digit number
In a
In case of (2), the non-leader node will be the first in its own magic list
The digits of the bits are added to the end of the string.
In that
In case (2), the detection result of the message array from other non-leader nodes is determined as not passing.
In operation S650, in the case where the digest is equal to the null character and the communication node is the leader node or the hamming distance between the digest and the null character is less than the tolerable number of error bits and the communication node is not the leader node, it is determined that the detection results of the message arrays from other non-leader nodes are passed.
Otherwise, determining that the detection result of the message arrays from other non-leader nodes is not passed.
In operation S660, the non-leader node adds the message arrays from other non-leader nodes and through detection to its own valid information set.
The operations S610 to S650 are used to detect an array of messages broadcasted by the non-leader node, that is, the non-leader node
And a non-leader node
In (ii) detection of an array of messages in (ii), wherein,
。
fig. 8 is a flow chart of a communication method of an optimal tolerance boundary based high efficiency quantum detectable weak byzantine protocol according to an embodiment of the invention.
As shown in fig. 8, the distributed system is initialized, that is, the parameters of all nodes in the distributed system are initialized; randomly electing a leader node among all nodes
The leader node generates a message containing
Quantum entangled state of quantum bits
Wherein, in the step (A),
is the number of nodes in the distributed system; leader node
Entangle quantum in state
Each subsystem of (a) is sent to a corresponding node, and all nodes use quantaTesting the state distribution and test scheme, and under the condition that the test is not passed, carrying out initialization operation, random leader node selection operation, quantum entanglement state generation and sending operation again; leader node
Collecting information requiring consensus
Generated using a digest function
Summary of (1)
Generating index sets using a message broadcast scheme
And broadcasting the message array
(ii) a Node pair slave leader node
To an array of received messages
Detecting, adding the detected message array to the effective information set of the node and broadcasting the message array by the node; the node pair removes the leader node from
Nodes other than
To receive an array of messages
Detect that the node willBy detecting valid information sets not contained in themselves
The message array in (1) is added to the effective information set of the user; node-only efficient information collection
When there is only one message array, the node accepts the message in the message array
。
Fig. 9 is a schematic diagram of a measurement result of quantum entanglement states generated using a quantum detectable weak byzantine protocol-based communication method according to an embodiment of the present invention.
Fig. 10 is an exemplary diagram of generating and validating an array of messages from a message using a quantum detectable weak byzantine protocol based communication method according to an embodiment of the invention.
The communication method based on the quantum detectable weak byzantine protocol provided by the present invention is further described in detail below with reference to fig. 9 and 10.
In operation S1, in a system in which 5 distributed communication nodes exist, parameters of all communication nodes are initialized, and the communication nodes
Includes the number of the communication node
Magic list
Index collection
Tolerable error bit number
Error flag
Maximum length of
Valid information set
。
In operation S2, a leader node is randomly elected among all communication nodes
Assuming the remaining four communication nodes are each represented by A, B, C, D, the leader node
In turn generate
A quantum entangled state comprising 6 qubits
(ii) a Leader node
Generated quantum entangled state
Is a composed of
A system of qubits in an entangled state,
is the number of communication nodes.
At operation S3, the leader node
Entangle quanta into state
And sending the subsystems to corresponding communication nodes, wherein all the communication nodes use quantum state distribution and a test scheme for testing, and the specific test flow is shown as operation S31-operation S36.
At operation S31, the leader node
Entangle each quantum in state
Are sequentially distributed to the respective communication nodes, wherein the first two subsystems (quantum entangled state)
The first two qubits) are held by the leader node, and other subsystems (qubits at various positions) are distributed to corresponding and unique communication nodes, for example, the communication node a corresponds to the 3 rd qubit, the communication node B corresponds to the 4 th qubit, the communication node C corresponds to the 5 th qubit, and the communication node D corresponds to the 6 th qubit.
In operation S32, the non-leader node checks for a slave leader node
In the received quantum entangled state
If the sub-system is in the maximum mixing state, the operation S33 is entered if the detection is successful, otherwise, the non-leader node broadcasts
In operation S33, the communication node receives a request to establish a connection with a mobile station
And
obtaining a length of a received subsystem for base detection
The non-leader node except the leader node detects that each subsystem has a result of 0 or 1, each subsystem of the leader node includes two qubits, the detected results are one of 4 cases (1,1), (0,0), (0,1) and (1,0), and the leader node records the 4 cases with 0,1, 2, 3, respectively.
As shown in FIG. 9, due to the quantum entanglement effect, the quantum entangled state is present before being measured
In a mixed state, all the qubits are in a superposition state of 0 and 1, when any node measures the qubit held by the node and obtains a result of 0 or 1, all other qubits can synchronously change and be fixed to 0 or 1, and the result obtained after measurement is assumed to be
Then the leader node
The results obtained were 01, A, C and D were 1, and B was 0.
In operation S34, a random selection is performed
A communication node broadcasts its own detection results at the positions in operation S33, collects the detection results of other communication nodes, and if the communication node receives the detection results of other communication nodes
Transmitted error flag
Then the terminating operation S3 goes to operation S1.
In operation S35, the correspondent node detects whether the collected results satisfy the conditions shown in the following table: (1) in the first case, when the detection result of the leader node is 0, the detection results of the positions corresponding to other communication nodes are all 1; (2) in case two, when the detection result of the leader node is 1, the detection results of the positions corresponding to other communication nodes are 2; (3) in case III, when the detection result of the leader node is 3, the detection result of the only communication node is 0, and the detection results of the positions corresponding to other communication nodes are all 1; (4) in case IV, when the detection result of the leader node is 10, the detection result of the only communication node is 1, and the detection results of the positions corresponding to the other communication nodes are all 0; (5) the probabilities of occurrence of the above four cases are 1/3, 1/3, 1/6 and 1/6, respectively, as shown in table 1.
TABLE 1 four Category Condition Table
| Measurement results | The leader node has a result of 0; of other communication nodes Measurement result was 0 | The leader node has a result of 1; other communication nodes The result of (A) is 1; | the leader node has a result of 2; other communications Of the nodes, there is one and only one communication node The result of (1) is 0; | the leader node has a result of 3; other communications Of the nodes, there is one and only one communication node The result of (A) is 1; |
| probability of | 1/3 | 1/3 | 1/6 | 1/6 |
In operation S36, if the detection in operation S35 fails or receives another communication node
Transmitted error flag
Then the communication node broadcasts
And terminating operation S3 to operation S1, otherwise the communication node lists itself in magic list
A sequence that is not broadcasted in operation S34 is set.
At operation S4, the leader node
Collecting information requiring consensus
Generated using a digest function
Summary of (1)
Generating index sets using a message broadcast scheme
And broadcasting the message array
The specific operations are shown in S41-S45.
In operation S41, the leader node detects a generated message using a digest function
Summary of (1)
。
In operation S42, the leader node initializes variables
Of variable quantity
。
In operation S43, the digests are compared
To (1) a
Magic lists of bits and communication nodes themselves
First, the
If the two numbers are equal, the digit of the bit is firstly processed
Is added to the index set
End of (2) and then order
。
In operation S44, if
Go to operation S45, otherwise let
Go to operation S43.
In operation S45, a corresponding message is transmitted
Abstract of the disclosure
And index collection
Combined into message arrays
And broadcasts the array of messages.
Assuming the summary is 1011 and the magic list is as shown in FIG. 10, then according to the magic list, the first 1 of the leader node appears at the second bit of the magic list, so the first bit of the index set is 2, and so on, for the magic list
The leader node generates a set of indices as
In operation S5, the non-leader node
To slave leaderA node
To an array of received messages
Detect, non-leader node
And adding the detected message array to the effective information set of the user and broadcasting the message array, wherein the specific flow is shown as operation S51-operation S55.
In operation S51, the non-leader node
Detecting digests in an array of messages using a digest function
Whether it is a message in a message array
And if the detection fails, the detection fails.
In operation S52, the non-leader node
Checking index sequences in an array of messages
Whether the sequence is an increasing sequence, if the detection fails, otherwise, the non-leader node
Initializing a null string
。
In operation S53, the index sequence in the message array is checked in turn
Each number in
If, if
If the detection is not passed, otherwise, the leader node is not connected
Magic list
To
Adding digit to character string
To the end of (c).
In operation S54, if the communication node is a leader and
or the communication node is not a leader and
and
the Hamming distance between is less than the tolerable number of error bits
The detection is passed, otherwise the detection is not passed.
In operation S55, the non-leader node
Adding an array of passing detected messages to a message queueOwn valid information set
And broadcasting the message array; according to leader node
Transmitted by
All non-leader nodes may be available
Of arrays of messages
Equal, the message array is detected, and the node is updated to
。
In operation S6, the non-leader node
For the slave leader node
Other non-leader nodes
The received valid information set which is not contained in the self
Array of messages in (1)
Detect, non-leader node
Will pass detection and message array additionThe specific flow of the valid information set to the user is shown in operations S61-S66.
In operation S61, if the non-leader node
Slave leader node
Nodes other than
To receive an array of messages
Not included in its own valid information set, operation S62 is passed.
In operation S62, the non-leader node
Detecting digests in an array of messages using a digest function
Whether it is a message in a message array
And if the detection fails, the detection fails.
In operation S63, the non-leader node
Checking index sequences in an array of messages
Whether the sequence is an increasing sequence, if the detection fails, otherwise, the non-leader node
Initializing a dummy string
。
In operation S64, the index sequence in the message array is checked in turn
Each number in
If, if
If the detection is not passed, otherwise, the non-leader node is detected
Magic list
To (1)
Adding digit to character string
To the end of (c).
In operation S65, if the communication node is a leader node and
or the communication node is not a leader and
and
the Hamming distance between is less than the tolerable number of error bits
The detection is passed, otherwise the detection is not passed.
In operation S66, the non-leader node
And adding the message array passing the detection to the effective information set of the user.
Only when the communication node
Is effectively set
When there is only one message array, the communication node
Accepting messages in the array of messages
。
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only examples of the present invention, and should not be construed as limiting the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (9)
1. A quantum detectable weak byzantine protocol based communication method, comprising:
in initialising a distributed system
Parameters of the communication nodes, wherein the parameters of the communication nodes comprise the number of the communication nodes, a magic list, an index set, a tolerable error bit number, an error flag, a maximum length and a valid information set,
is a positive integer;
randomly selecting a leader node from the communication nodes and generating quantum entangled states by the leader node, wherein the number of the quantum entangled states is the same as the value of the maximum length, and each quantum entangled state comprises
A qubit;
sending each quantum bit of each quantum entanglement state to a corresponding communication node through the leader node, and detecting the quantum bit received by each communication node according to a quantum distribution and test scheme;
obtaining a message array by using the leader node and broadcasting the message array in the distributed system, wherein the message array comprises information needing to be identified, a summary of the information needing to be identified, which is generated by a summary function, and an index set generated by a message broadcasting scheme, the summary function is a one-way quantum hash function capable of resisting quantum attack, the output of the summary function can pass a randomness test, the same input of the summary function can produce the same output, the length of the output of the summary function is fixed, and mutual information quantity cannot exist between different outputs produced by different inputs of the summary function;
detecting a message array from the leader node by using a non-leader node in the communication nodes, adding the detected message array into an effective information set of the communication nodes, and broadcasting the detected message array in the distributed system;
detecting message arrays from other non-leader nodes by using the non-leader node, and adding the message arrays which pass the detection and are not contained in the self effective information set into the self effective information set;
and under the condition that the number of the message arrays in the effective information set of the communication node is a preset number, the communication node receives the information needing to be identified in the message arrays.
2. The method of claim 1, wherein a communication node
Magic list
Is a sequence of numbers and is initialized to a null sequence,
；
wherein the magic list of each of the communication nodes is unique within the distributed system;
wherein the communication node
Index set of
Is a set
And initialized into an empty set, wherein,
representing the communication node
Magic list
The length of (d);
wherein the communication node
Is tolerableNumber of error bits
Representing the maximum number of error bits that can be tolerated when verifying the message array, wherein,
，
representing the length of the summary generated by the summary function;
wherein the communication node
Error flag of
Is a boolean value and is initialized to FALSE;
wherein the communication node
Maximum length of
Representing a maximum length of a magic list in the quantum detectable weak Byzantine protocol, wherein,
；
wherein the communication node
Is effectively set
Including the array of messages and initialized to an empty set;
wherein, the
The communication nodes have the same number of tolerable error bits and maximum length.
3. The method of claim 1, wherein said transmitting, by the leader node, the respective qubit of each of the quantum entangled states to the corresponding communication node comprises:
the leader node obtains an entangled state formed by the first two qubits of each quantum entangled state;
the leader node sends qubits at each of the other positions of the quantum-entangled state to the non-leader node, wherein the non-leader node obtains 1 qubit at each of the other positions of the quantum-entangled state.
4. The method of claim 1, wherein the detecting, by each of the communication nodes, the qubits received by itself according to a quantum distribution and testing scheme comprises:
the non-leader node checks whether the quantum bit of the quantum entanglement state sent by the leader node is in a maximum mixed state or not to obtain a check result;
in the case that the check result is not in the maximum mixing state, performing the following operations:
setting, by the non-leader node, a self error flag to FALSE and broadcasting a self error flag in the distributed system;
and performing initialization operation again, leader node random selection operation, quantum entanglement state generation operation sending and quantum entanglement state generation operation detection operation.
5. The method of claim 4, further comprising:
in a case where the check result is in a maximum mixing state, performing the following operations:
the communication node detects the received quantum bit based on the preset quantum entanglement state to obtain the length of
Wherein the detection result of the leader node comprises (1,1), (0,0), (0,1) and (1,0), the detection result of the non-leader node comprises 0 and 1, and the preset quantum entanglement state comprises
And
；
the communication node broadcasts the detection result at the preset position in the quantum sequence in the distributed system and collects the detection results broadcast by other communication nodes;
when the communication node receives that the error flag sent by the other communication node is FALSE, the communication node carries out initialization operation, leader node random selection operation, quantum entangled state generation operation sending and quantum entangled state generation operation detection operation again;
according to a preset detection condition, the communication node detects the collected detection results of the other communication nodes to obtain a detection result;
under the condition that the detection result does not meet the preset detection condition, the communication node sets the own error flag to be FALSE, broadcasts the own error flag in the distributed system, and performs initialization operation, leader node random selection operation, quantum entanglement state generation operation sending and quantum entanglement state generation operation detection operation again;
and under the condition that the detection result meets the preset detection condition, the communication node sets the magic list of the communication node to be a sequence which is not on the preset position.
6. The method of claim 5, wherein the number of preset positions is determined by
Determining that the preset position is randomly selected,
representing the length of the summary generated by the summary function;
wherein the preset detection condition comprises: the detection result of the leader node is (1,1), the detection results of the positions corresponding to the non-leader nodes are all 1, the detection result of the leader node is (0,0) and the detection result of the positions corresponding to the non-leader nodes are all 0, the detection result of the leader node is (0,1), 1 detection result of the non-leader node is 0, the detection results of the positions corresponding to the other non-leader nodes are all 1, the detection result of the leader node is (1,0), the detection result of the non-leader node is 1, and the detection results of the positions corresponding to the other non-leader nodes are all 0.
7. The method of claim 1, wherein the obtaining and broadcasting an array of messages in the distributed system with the leader node comprises:
the leader node detects and generates the summary of the message needing to be identified by using the summary function;
the leader node counts variables
And position variable
Initializing to 1;
the leader node compares the digests
Number of bits and magic List of the leader node
The number of bits, in case of equality of the comparison result, counting the variables
Is added to the end of the index set of the leader node and the count variable is added
The value of (a) is increased by 1;
at the counting variable
Is less than or equal to the maximum length of the leader node, the leader node assigns the position variable to the position variable
Increases by 1 and performs the comparison operation again;
at the counting variable
Is greater than the maximum length of the leader node, the leader node combines the message requiring consensus, the digest, and the index set into the message array and broadcasts the message array in the distributed system.
8. The method of claim 1, wherein the detecting, with the non-leader node, the array of messages from the leader node, adding the array of passed messages to its own set of valid information, and broadcasting the array of passed messages in the distributed system comprises:
the non-leader node detects the message array from the leader node by using the digest function, and determines that the detection result of the message array from the leader node is passed under the condition that the digest in the message array from the leader node is the corresponding digest of the information needing to be known in the message array from the leader node;
the non-leader node detecting an index sequence in the array of messages from the leader node, the non-leader node initializing a first null string if the index sequence in the array of messages from the leader node is an incrementing sequence;
the non-leader node iteratively checks the index sequence in the array of messages from the leader node
Digit number
In a
In case of (2), the non-leader node will be the first of its own magic list
Adding the number of the bit to the end of the first empty character string;
determining that the detection result of the message array from the leader node is a pass if the digest is equal to the first null character string and the communication node is the leader node or the hamming distance between the digest and the first null character string is less than a tolerable number of error bits and the communication node is not the leader node;
the non-leader node adds the array of detected messages from the leader node to its own active set of information and broadcasts the array of detected messages from the leader node in the distributed system.
9. The method of claim 1, wherein the detecting, with the non-leader node, arrays of messages from other non-leader nodes, adding an array of messages that pass the detection and are not included in the own valid information set to the own valid information set comprises:
the non-leader node detects message arrays from other non-leader nodes by using the digest function, and determines that the detection result of the message arrays from other non-leader nodes is passed under the condition that the digests of the message arrays from other non-leader nodes are digests corresponding to messages needing to be known in the message arrays from other non-leader nodes, wherein the message arrays from other non-leader nodes are not included in the self effective information set of the non-leader nodes;
the non-leader node checks index sequences in the message arrays from other non-leader nodes, and determines that the detection result of the message arrays from other non-leader nodes is a pass if the index sequences in the message arrays from other non-leader nodes are incremental sequences;
in the event that the index sequence in the array of messages from other non-leader nodes is not an incremented sequence, the non-leader node initializes a second empty string;
the non-leader node iteratively checks the index sequence in the array of messages from other non-leader nodes
Digit number
In a
In case of a non-leader node, the non-leader node will be the second in its own magic list
The digit of the bit is added to the end of the string;
determining that the detection results of the message arrays from other non-leader nodes are passed if the digest and the second empty character string are equal and the communication node is the leader node or the hamming distance between the digest and the second empty character string is less than the tolerable number of error bits and the communication node is not the leader node;
the non-leader node adds the message arrays which come from other non-leader nodes and are detected to the effective information set of the non-leader node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211034093.0A CN115118420A (en) | 2022-08-26 | 2022-08-26 | Communication method based on quantum detectable weak Byzantine protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211034093.0A CN115118420A (en) | 2022-08-26 | 2022-08-26 | Communication method based on quantum detectable weak Byzantine protocol |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115118420A true CN115118420A (en) | 2022-09-27 |
Family
ID=83335824
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211034093.0A Pending CN115118420A (en) | 2022-08-26 | 2022-08-26 | Communication method based on quantum detectable weak Byzantine protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115118420A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210126800A1 (en) * | 2019-10-25 | 2021-04-29 | Telefónica loT & Big Data Tech, S.A. | Method and system for dlt networks consensus enhancement using quantum computing mechanisms |
| CN112953955A (en) * | 2021-03-03 | 2021-06-11 | 南京航空航天大学 | Multi-party quantum Byzantine consensus optimization protocol |
-
2022
- 2022-08-26 CN CN202211034093.0A patent/CN115118420A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210126800A1 (en) * | 2019-10-25 | 2021-04-29 | Telefónica loT & Big Data Tech, S.A. | Method and system for dlt networks consensus enhancement using quantum computing mechanisms |
| CN112953955A (en) * | 2021-03-03 | 2021-06-11 | 南京航空航天大学 | Multi-party quantum Byzantine consensus optimization protocol |
Non-Patent Citations (1)
| Title |
|---|
| 薛立德: "区块链共识算法及其应用研究", 《中国博士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11232478B2 (en) | Methods and system for collecting statistics against distributed private data | |
| Brassard et al. | Oblivious transfers and intersecting codes | |
| Chatzikokolakis et al. | Anonymity protocols as noisy channels | |
| Shu et al. | Privacy-preserving and truthful detection of packet dropping attacks in wireless ad hoc networks | |
| Winter et al. | Commitment capacity of discrete memoryless channels | |
| US20050249352A1 (en) | Quantum-key distribution method between a plurality of users or groups | |
| Arrazola et al. | Multiparty quantum signature schemes | |
| CN113271204B (en) | Byzantine fault-tolerant consensus method based on quantum key distribution | |
| CN113570357B (en) | Dynamic layered efficient PBFT algorithm | |
| CN111179087B (en) | Alliance chain consensus method based on grid arbitration | |
| Shi et al. | Quantum secret sharing between multiparty and multiparty with Bell states and Bell measurements | |
| Dou et al. | Rational Non-Hierarchical Quantum State Sharing Protocol. | |
| Goldreich et al. | A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm | |
| Fields et al. | Extracting unambiguous information from a single qubit by sequential observers | |
| Kreidl et al. | On decentralized detection with partial information sharing among sensors | |
| CN115118420A (en) | Communication method based on quantum detectable weak Byzantine protocol | |
| Bluhm et al. | Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks | |
| Casse et al. | Bounds and characterizations of authentication/secrecy schemes | |
| CN114745129B (en) | Reference system independent quantum digital signature method | |
| Li et al. | A new (w, t, n)-weighted threshold quantum secret sharing scheme based on two-qubit system | |
| CN111970130B (en) | Quantum block chain establishment method and system | |
| Qin et al. | Efficient quantum digital signatures over long distances with likely bit strings | |
| Zhang et al. | Anti-noise quantum network coding protocol based on bell states and butterfly network model | |
| Sun et al. | Certifying randomness in quantum state collapse | |
| Hirose et al. | Group-Testing Aggregate Entity Authentication |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20220927 |
|
| WD01 | Invention patent application deemed withdrawn after publication |