CN117811746A - Electric power data transmission method and system based on quantum Bayesian consensus - Google Patents
Electric power data transmission method and system based on quantum Bayesian consensus Download PDFInfo
- Publication number
- CN117811746A CN117811746A CN202311846750.6A CN202311846750A CN117811746A CN 117811746 A CN117811746 A CN 117811746A CN 202311846750 A CN202311846750 A CN 202311846750A CN 117811746 A CN117811746 A CN 117811746A
- Authority
- CN
- China
- Prior art keywords
- signature
- node
- information
- backup node
- backup
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000005540 biological transmission Effects 0.000 title claims abstract description 22
- 238000012795 verification Methods 0.000 claims abstract description 80
- 230000007246 mechanism Effects 0.000 claims abstract description 58
- 238000004891 communication Methods 0.000 claims abstract description 20
- 238000012546 transfer Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 238000007726 management method Methods 0.000 description 4
- 239000011159 matrix material Substances 0.000 description 2
- 206010004142 Bartholinitis Diseases 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001427 coherent effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 230000005610 quantum mechanics Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 230000002040 relaxant effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
- Y04S40/20—Information technology specific aspects, e.g. CAD, simulation, modelling, system security
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a power data transmission method and a system based on quantum Bayesian and horological consensus, wherein the method comprises the following steps: the master node signs the information to be transmitted and transmits the information to the backup node; each backup node receives the information and the signature sent by the main node and signs the signature of the information and the signature, and integrally sends the information and the signature to the next backup node; the signature is a quantum digital signature; after each backup node receives the information and the signature received by all the backup nodes, sending the whole backup node to a third party signing checking mechanism for verification, if the verification is not passed, returning to the step 2, and if the verification is passed, outputting the message sent by the main node by the backup node; the invention has the advantages that: communication complexity is reduced to polynomial, and the communication method can be practically expanded to hundreds of thousands of participants.
Description
Technical Field
The invention relates to the technical field of quantum security, in particular to a power data transmission method and system based on quantum Bayesian consensus.
Background
The bayer consensus protocol, which is the basis for blockchains, aims to achieve consensus in a distributed network to ensure that each independently located node can agree on network messages even if there are malicious nodes to disqualify. However, the classical bayer consensus protocol faces two major challenges. First, the classical bayer consensus protocol is severely constrained by a 1/3 fault tolerance limit, meaning that the system requires at least 3f+1 nodes to tolerate f malicious nodes. Strict mathematical evidence has shown that the 1/3 fault tolerance limit cannot be breached for any pair-wise communication of the decentralised system. Secondly, due to the adoption of the traditional cryptography method, such as a public-private key cryptography system, the security vulnerability is particularly serious when facing the threat of quantum computing, such as a quantum Shor algorithm.
Aiming at the two points, the detection quantum Bayesian consensus protocol realizes the special three general problems by constructing a special quantum entangled state. But it cannot be extended to multiple situations and to prepare and maintain quantum entanglement, making it impractical.
At present, electric power is used as a necessary energy source for daily use, and users of an electric power system relate to household households. Meanwhile, because of different types of use, the power system also has service systems with different levels and types, and the power load management system users monitor and control the load of all-provinces and all-high-voltage users, the single-transmission data size is large, the safety requirement is high, and meanwhile, the requirements on the real-time property, the accuracy and other aspects in the data transmission process are more severe, so that the system can agree on the transmitted data, and the classical Bayesian consensus protocol is not applicable any more.
In recent years, chinese patent publication No. CN114553423a discloses a decentralised quantum byesting consensus method, and proposes a byesting consensus scheme using quantum digital signatures, which, although achieving unconditional security and breaking through the 1/3 fault tolerance limit, meets the requirements of the power load management system on data transmission consistency to a certain extent, has an exponential increase in communication complexity with the increase of participants, and is difficult to accommodate hundreds of thousands of participants in real life, and is not practical. Therefore, finding a new quantum-bayer consensus protocol for secure power data transmission is a problem to be solved in power load management systems.
Disclosure of Invention
The technical problem to be solved by the invention is that the quantum Bayesian and busy consensus method in the prior art has the problem that the communication complexity is exponentially increased along with the increase of the participation users of the power load management system, so that the method cannot be practically expanded to the participation situation of a large number of users in real life.
The invention solves the technical problems by the following technical means: a power data transmission method based on quantum Bayesian consensus comprises the following steps:
step 1, a master node signs information to be transmitted and transmits the information to a backup node;
step 2, each backup node receives the information and signature sent by the main node and signs the information and signature of the own, and integrally sends the information and signature to the next backup node, the next backup node adds the information and signature received by the own and sent by the main node, signs the own signature, integrally sends the information and signature to the next backup node, and according to the mode, data flow is sequentially carried out, and the last backup node gives all the information and signature to the first backup node, so that each backup node collects the information and signature received by other backup nodes; the signature is a quantum digital signature;
and step 3, after each backup node receives the information and the signature received by all the backup nodes, sending the whole information and the signature to a third-party signature verification mechanism for verification, returning to the step 2 if the verification is not passed, and outputting the information sent by the main node by the backup nodes if the verification is passed.
Further, the step 1 includes:
assuming that n power subsystems are shared, randomly selecting one from the n power subsystems as a main node, using the rest n-1 power subsystems as backup nodes, performing quantum digital signature on information sent to each backup node by the main node, and sending the information and the quantum digital signature to the corresponding backup node together, wherein the information refers to power data to be transmitted by the power subsystems.
Still further, the step 1 further includes:
the master node S sends itself to the backup node R i Information m of (2) i Quantum digital signature is carried out, and signature is sigma i Message m i Signature as a whole { m } i |σ i Is sent to the corresponding backup node R together i Wherein i is the serial number of the backup node.
Further, in the step 2, the order in which each backup node collects the messages and signatures received by other backup nodes is clockwise collection.
Further, the step 2 includes:
first backup node R 1 Information m of host node received by self 1 And quantum digital signature sigma 1 As a whole { m } 1 |σ 1 ) Marking the quantum digital signature sigma of the user 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the second backup node R 2 A second backup node R 2 Message m of host node received by oneself 2 And quantum digital signature sigma 2 As a whole { m 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 2 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 According to this flow, up to the last backup node R n-1 Message received by the master node from the master node and quantum digital signature { m } n-1 |σ n-1 All add and sign their own quantum digital signature sigma n-1→1 Thereafter, by the last backup node R n-1 Digitally signing all messages and quanta { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 All handed to the first backup node.
Further, the quantum digital signature is implemented by using a one-hash-at-a-time type quantum digital signature for a long message, a BB84 single-bit GC01 type quantum digital signature, or an SARG04 single-bit quantum digital signature.
Further, the step 3 includes:
after each backup node takes the information and the signatures of all the backup nodes, the information and the signatures are sent to a third party signature verification mechanism as a whole to verify whether each signature is correct, if each signature is correct, the third party signature verification mechanism sends back "correct", the backup node inputs all the messages into a preset decision type function, outputs the messages as the messages which are finally considered to be sent by the main node, if the signatures are incorrect, the third party signature verification mechanism sends back "error", and step 2 is re-executed until the third party signature verification mechanism returns "correct".
Further, the predetermined decision type function is a quality function or a one-to-one mapping choice function.
The invention also provides a power data transmission system based on quantum Bayesian consensus, which comprises:
the signature distribution module is used for signing the information to be transmitted by the master node and transmitting the information to the backup node;
the signature exchange module is used for each backup node to receive the information and the signature sent by the main node and sign the signature of the own, integrally send the information and the signature to the next backup node, the next backup node adds the information and the signature received by the own main node, signs the own signature, integrally sends the information and the signature to the next backup node, and sequentially carries out data transfer according to the mode, and the last backup node gives all the information and the signature to the first backup node, so that each backup node collects the information and the signature received by other backup nodes; the signature is a quantum digital signature;
and after each backup node receives the information and the signature received by all the backup nodes, the result verification module integrally sends the information and the signature to a third-party signature verification mechanism for verification, if the verification is not passed, the signature communication module is returned to be executed, and if the verification is passed, the backup node outputs the message sent by the main node.
Further, the signature distribution module is further configured to:
assuming that n power subsystems are shared, randomly selecting one from the n power subsystems as a main node, using the rest n-1 power subsystems as backup nodes, performing quantum digital signature on information sent to each backup node by the main node, and sending the information and the quantum digital signature to the corresponding backup node together, wherein the information refers to power data to be transmitted by the power subsystems.
Still further, the signature distribution module is further configured to:
the master node S sends itself to the backup node R i Information m of (2) i Quantum digital signature is carried out, and signature is sigma i Message m i Signature as a whole { m } i |σ i Is sent to the corresponding backup node R together i Wherein i is the serial number of the backup node.
Further, the order in which each backup node in the signature exchange module collects the messages and signatures received by other backup nodes is clockwise collection.
Further, the signature communication module is further configured to:
first backup node R 1 Information m of host node received by self 1 And quantum digital signature sigma 1 As a whole { m } 1 |σ 1 ) Marking the quantum digital signature sigma of the user 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the second backup node R 2 A second backup node R 2 Message m of host node received by oneself 2 And quantum digital signature sigma 2 As a whole { m 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 2 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 According to this flow, up to the last backup node R n-1 Message received by the master node from the master node and quantum digital signature { m } n-1 |σ n-1 All add and sign their own quantum digital signature sigma n-1→1 Thereafter, by the last backup node R n-1 Digitally signing all messages and quanta { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 All handed to the first backup node.
Further, the quantum digital signature is implemented by using a one-hash-at-a-time type quantum digital signature for a long message, a BB84 single-bit GC01 type quantum digital signature, or an SARG04 single-bit quantum digital signature.
Further, the result verification module is further configured to:
after each backup node takes the information and the signatures of all the backup nodes, the information and the signatures are sent to a third party signature verification mechanism as a whole to verify whether each signature is correct, if each signature is correct, the third party signature verification mechanism sends back "correct", the backup node inputs all the messages into a preset decision type function, outputs the messages as the messages which are finally considered to be sent by the main node, if the signatures are incorrect, the third party signature verification mechanism sends back "error", and the signature communication module is re-executed until the third party signature verification mechanism returns "correct".
Further, the predetermined decision type function is a quality function or a one-to-one mapping choice function.
The invention has the advantages that:
(1) According to the invention, by relaxing some centralization conditions, a signature checking mechanism which only participates in verifying signatures but not in actual decisions is fixed, and by utilizing unconditional safe anti-repudiation and anti-counterfeiting properties of quantum digital signatures and the backup node signature communication mode of step 2, the communication complexity of the Bayesian consensus scheme is reduced to a polynomial, and the communication complexity of the traditional quantum Bayesian consensus scheme is exponentially increased along with the number of participants, and the protocol successfully realizes the polynomial complexity, so that the communication complexity can be practically expanded to hundreds of thousands of participants.
(2) The quantum Bayesian consensus scheme provided by the invention is a real unconditional security scheme, and is safe in front of classical computing attacks or quantum computing attacks. The security of the digital quantum signature is based on the used digital quantum signature protocol, the security of the digital quantum signature is provided by the basic principle of quantum mechanics, the digital quantum signature is not based on the computational complexity of mathematical problems, and the digital quantum signature is truly unconditional security, also called information theory security.
(3) The quantum Bayesian consensus scheme provided by the invention does not need to construct a special multi-particle quantum entanglement state, and only needs a weak coherent state required by quantum digital signature in actual implementation, so that the quantum Bayesian consensus scheme is more practical and is convenient for production. The scheme only needs to realize three-party quantum digital signature, and the quantum digital signature in any mode can be directly applied to the method, so that the method has strong compatibility and practicability and can be realized by using various quantum systems; the method can be realized in the system of the current state of the art, and can be freely integrated in the future quantum Internet system, and has extremely strong application range and prospect in the current stage and the future.
(4) The quantum Bayesian consensus scheme provided by the invention uses quantum digital signature and fixes a trusted third party signature verification mechanism, so that the information transmitted in the process and the corresponding signature can ensure anti-repudiation and anti-tampering, namely, no one can deny own signature and falsify the message or signature, thus, in principle, the scheme breaks the classical 1/3 fault tolerance limit, and based on the verification mechanism of step 3, only two honest users are needed to enable honest users to agree on the message in the network.
Drawings
Fig. 1 is a schematic diagram of a signature distribution flow of a master node in a power data transmission method based on quantum-based bartholinitis disclosed in an embodiment of the invention;
fig. 2 is a schematic diagram of a quantum digital signature flow in a power data transmission method based on quantum bayer consensus according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a backup node signature communication flow in a power data transmission method based on quantum bayer pattern consensus according to an embodiment of the present invention;
fig. 4 is a schematic diagram of quantum digital signature of backup node signature exchange process of a power data transmission method based on quantum bayer pattern consensus according to the embodiment of the invention;
fig. 5 is a schematic diagram of verifying signatures and outputting results by backup nodes in a power data transmission method based on quantum-based bayer consensus according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions in the embodiments of the present invention will be clearly and completely described in the following in conjunction with the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
The invention provides a power data transmission method based on quantum Bayesian consensus, which mainly comprises the following three steps: and distributing the signature of the master node, exchanging the signature of the backup node, verifying the signature of the backup node and outputting a result. In this embodiment, it is assumed that the system has n power subsystems in total. The main node S randomly selects one from the n power subsystems, and the other n-1 power subsystems become backup nodes R i (i=1, 2,3, …, n-1). In the three-party quantum digital signature described in the following flow, the verifier is fixed as a third party signature verification mechanism, and the signer and the receiver are power subsystems. The specific process is as follows:
step 1, signature distribution of a master node:
the master node S sends itself to the backup node R i Information m of (2) i Quantum digital signature is carried out, and signature is sigma i The own message and signature { m }, are signed i |σ i Is sent to the corresponding backup node R together i As shown in fig. 1. The three-party quantum digital signature participation process comprises the following steps: the master node S is used as a signer and the backup node R i As a recipient, a fixed third party signing authority acts as a verifier, as shown in fig. 2. The quantum digital signature method may be one-hash-at-a-time type quantum digital signature for a long message, BB84 single-bit GC01 type quantum digital signature, or SARG04 single-bit quantum digital signature. This embodiment is preferably directed to one-hash-at-a-time quantum digital signatures of multiple bits.
Step 2, backup node signature communication:
after receiving the messages and signatures sent by the master node, the backup nodes need to collect the information received by other backup nodes. In the present embodiment, the backup node R 1 As an example. First backup node R 1 The information and signature { m > of the host node received by the host node 1 |σ 1 As a whole, is signed with its own quantum digital signature sigma 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the next backup node R 2 . Second backup node R 2 Message and signature { m > of host node received by self 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 2 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 . Proceeding according to the flow until the last backup node R n-1 Message and signature { m } from the master node it receives n-1 |σ n-1 All add and sign their own signature sigma n-1→1 Thereafter, by the last backup node R n-1 All messages and signatures { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 All are handed over to the first backup node R 1 . A specific flow is shown in fig. 3, and a related quantum digital signature flow is shown in fig. 4. Each backup node performs the collection process of the message and the signature, and collects the messages and the signatures of other backup nodes on its own hands. For each backup node, the order of collection of information and signatures is clockwise, e.g., 1- > 2- > 3- > … - > i- > … - > n-1- > 1, according to the number of the backup node subscripts.
Step 3, the backup node verifies the signature and outputs a result:
as shown in fig. 5, each backup node R i After the information and signature of all other backup nodes are obtained, the information and signature are sent to a third party signing checking mechanism as a whole, and each signing checking mechanism is enabled to verifyWhether a signature is correct. If each signature is correct, the third party signing checking mechanism sends back "correct", the backup node inputs all the messages into the predetermined decision type function, and outputs the messages as the final message which the backup node considers to be sent by the master node. If the signature is incorrect, the third-party signature verification mechanism sends back an error, and the backup node finds that other backup nodes are cheated, and the step 2 is executed again until the signature verification mechanism returns to correct. For example, in the last phase, the first backup node R 1 The result of the information and signature of all the backup nodes taken is { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 First backup node R 1 Sending the signature to a third party signature verification mechanism which sequentially verifies the signature sigma 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 If the result is correct, returning the result to the first backup node R 1 . First backup node R 1 It is believed that each message value m 1 ，m 2 ，…，m n-1 It inputs it into a deterministic one-to-one mapping function with good advance quotients, outputting the final result as the message of the master node. The deterministic one-to-one mapping function in this embodiment selects the majority function, then the first backup node R 1 The final result isThe most frequently occurring element is the message list.
By the technical scheme, due to the non-repudiation property of the quantum digital signature, anyone cannot repudiate the name signed by himself. Due to the non-counterfeitable nature of quantum digital signatures, anyone cannot tamper with the message and signature in the delivery process. Thus, the list of messages that each backup node can successfully pick up is the same and m 1 ，m 2 ，m 3 ，…，m n-1 A list of these n-1 messages. The same list is input into a deterministic one-to-one mapping function, such as a majority function, and the resulting final output will be consistent. Therefore, theoretically, only at least two honest users in the primary node and the backup node are needed, and honest users in the system can achieve consistent output on the message sent by the primary node. Thus, even if malicious nodes do nothing, each node with independent status can still agree on the message sent by the master node, so that the scheme of the invention breaks the classical 1/3 fault tolerance limit.
Example 2
The difference between the present embodiment 2 and embodiment 1 is that: the quantum digital signature specifically adopts one-hash quantum digital signature at a time. A one-time hash quantum digital signature method based on N bits is adopted to demonstrate the four-party quantum Bayesian consensus, and the participants are a main node S and a backup node R i (i=1, 2, 3), the power data transmission method based on quantum bayer consensus includes the steps of:
step 1, signature distribution of a master node: the master node S sends itself to the backup node R i Information m of (i=1, 2, 3) i Quantum digital signature is carried out, and signature is sigma i It will itself message and signature { m } i |σ i Is sent to the corresponding backup node R together i 。
The one-hash quantum digital signature participation process at a time is as follows: the master node S is used as a signer and the backup node R i As a recipient, a fixed third party signing authority acts as a verifier. The first step: the signature party is a main node S, and the receiving party is a backup node R i And the verifier holds two sets of random keys for a third party signing checking mechanism respectively, and the 6 strings of keys are divided into two groups which are marked as A group and B group. The two strings of random number key strings held by the signature party as the master node S are marked as A 1 And B 1 Similarly backup node R i Hold A 2 And B 2 The verification party holds A for the third party signing verification mechanism 3 And B 3 The signature party, two groups of keys between the receiving party and the verification party respectively form a secret sharing relation; realizing secretThe mode of secret sharing is preferably quantum secret sharing; relationship of secret sharing:wherein A is 1 ，A 2 ，A 3 Is N bit, B 1 ，B 2 ，B 3 Is 2N bits. Note that the operations mentioned in this invention are binary algorithms.
The signature side master node S obtains N-bit random numbers through a random number generator, wherein the N-bit random numbers are used for generating irreducible polynomials, and the specific process is as follows:
firstly, sequentially using coefficients of each item except the highest item in each corresponding polynomial of N-bit random numbers to generate an N-order polynomial in a GF (2) domain, wherein the coefficient of the highest item is 1; for example, the N-bit random number is k= (k) N-1 ，k N-2 ，k N-3 ，…，k 1 ，k 0 ) The generated polynomial is p 1 (x)＝x N +k N-1 x N-1 +k N-2 x N-2 +…+k 1 x+k 0 The method comprises the steps of carrying out a first treatment on the surface of the Only when k is 0 When=1, the generated polynomial may be an irreducible polynomial, so, to reduce the calculation amount in the later verification of the irreducible polynomial, the N-bit random number may be first determined: if the last bit of the N-bit random number is 0, the last bit of the random number is 1; or if the last bit of the N-bit random number is 0, regenerating the N-bit random number until the last bit of the generated N-bit random number is 1; this reduces the amount of computation in post-verification of irreducible polynomials, ultimately resulting in a polynomial p 1 (x)＝x N +k N-1 x N-1 +k N-2 x N-2 +…+k 1 x+1. Then, verifying whether the N-order polynomial is an irreducible polynomial, if the verification result is NO, directly generating another group of N-bit random numbers by a random number generator of the master node S, returning the generated random numbers as new N-bit random numbers to regenerate the polynomial and verifying; if the verification result is yes, stopping verification to obtain an irreducible polynomial; preferably, the authentication method herein employs two kinds of authentication in the document disclosed in patent application number CN202111336020.2A method of irreducible polynomials.
After generating the irreducible polynomial, the signer master node uses its own first set of N-bit keys A 1 Generating a linear feedback shift register based hash function as an input random number with an irreducible polynomialMessage m is then sent again i Inputting a hash function to obtain a hash value +.>Hash value +.>The character string composed of each term coefficient k except the highest term in the irreducible polynomial forms the abstract ++>The form of the digest may be performed by a predetermined rule, such as hash value+character string, character string+hash value, etc., and the resulting digest is 2N bits; the signer Alice uses its own second set of 2N-bit keys B 1 The digest Dig is unconditionally secure encrypted, where the unconditional secure encryption is preferably one-time-pad exclusive-or encryption, and then the final signature +.>
Wherein, the hash function based on the linear feedback shift register is Toeplitz matrix with dimension N×M, wherein N is the length of the first group key of the signature party, and M is the message M i Is a length of (c). Vector k= (k) N-1 ，k N-2 ，k N-3 ，…，k 1 ，k 0 ) Is an irreducible polynomial coefficient. Vector A 1 ＝(a 1 ，a 2 ，a 3 ，…，a N ) Key A, a first set of N bits of a signer 1 . Order the … …, n=128 in this embodiment. T represents the transpose of the matrix. Thus, the form of the LFSR-based Toeplitz hash function generation is as follows:
verifying the signature: the signer master node S sends the message m i And signature sigma i As a whole to the recipient Bob, and at the same time the signer S sends the secret key to the recipient R in an unconditionally secure manner i The unconditional security mode is realized by adopting a quantum key distribution technology or a mode of safely distributing quantum random numbers; receiver R i Two groups of keys A held by the user after receiving 2 And B 2 Message m i And signature sigma i Sending the two sets of keys A to a trusted third party signing verification mechanism fixed by a verification party, and after the signing verification mechanism receives the two sets of keys A held by the third party signing verification mechanism 3 And B 3 Is sent to the receiver R i Backup node, receiver R i The signature verification mechanism calculates two groups of keys of the signature party S according to the keys held by the signature verification mechanism; it should be noted here that the receiver R i The information exchange between the signature verification mechanism and the signature verification mechanism is a classical channel which needs authentication, so that the signature verification mechanism is prevented from being tampered with;
(1) Receiver R i And third party signing checking mechanism respectively using the respectively calculated second group key of signature party master node SAnd->For signature sigma i Performing decryption operation to obtain respective reverse abstracts ∈>And the reverse directionAbstract-> Andare all hash value->And a character string k composed of each term of coefficients except the highest term in the irreducible polynomial; receiver R i And the signature verification mechanisms each utilize the hash value ++in the separate digest by the preset rule before>And a string k of irreducible polynomial coefficients. (2) Receiver R i And the signing party Alice first group key calculated by the third party signing authority respectively +.>As seed of hash function, and utilize character string k formed from every item of coefficient except highest item in the non-approximate polynomials separated in previous step to produce LFSR-Toeplitz hash function, then make received message m i Input-generated hash function generation receiver R i Forward digest->And a positive digest of a verification party signing authorityIf the forward digest of the receiver->Equal to reverse summary->Then receiver R i Accepting the signature, otherwise, not accepting; if the forward digest of the verifier->Equal to reverse summary->The signature checking mechanism accepts the signature, otherwise, the signature checking mechanism does not accept the signature; if the receiver R i And the digital signature is completed when the verification party signature verification mechanism receives the digital signature at the same time. Only if the receiver R i And the verification party signature verification mechanism can be regarded as successful signature when receiving the signature, otherwise, the verification party signature verification mechanism fails.
Step 2, backup node signature communication: after receiving the messages and signatures sent by the master node to the backup nodes, the backup nodes need to collect the information received by other backup nodes. Here, by the backup node R 1 As an example. R is R 1 The information and signature { m > of the host node received by the host node 1 |σ 1 As a whole, is signed with its own quantum digital signature sigma 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the next backup node R 2 . Second backup node R 2 Message and signature { m > of host node received by self 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 . Last backup node R 3 Message and signature { m } from the master node it receives 3 |σ 3 All add and sign their own signature sigma 3→1 Thereafter, from R 3 All messages and signatures { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 1→2 ，σ 2→3 ，σ 3→1 All are handed over to R 1 . Each backup node will perform such a process of collecting messages and signatures, and will backup the other in the clockwise direction of the reference numberThe node's message and signature are collected on its own hand. R is R 2 The final received result is { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 2→3 ，σ 3→1 ，σ 1→2 }，R 3 The final received result is { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 3→1 ，σ 1→2 ，σ 2→3 }. The quantum digital signature flow in the step 2 is the same as the flow in the step 1, and the signature verification party is fixed as a third party signature verification mechanism.
Step 3, the backup node verifies the signature and outputs a result: each backup node R i After the information and the signatures of all other backup nodes are obtained, the information and the signatures are sent to a third-party signing checking mechanism as a whole, so that the third-party signing checking mechanism can verify whether each signature is correct. If each signature is correct, the signature verification mechanism sends back "correct", the backup node inputs all messages into a predetermined decision type function, and outputs the messages as the final message which the backup node considers to be sent by the master node. If the signature is incorrect, the signature checking mechanism sends back an error, and the backup node finds that other backup nodes have cheating, and the step 2 is executed again until the signature checking mechanism returns to be correct. In the last stage, R 1 The final list taken is { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 1→2 ，σ 2→3 ，σ 3→1 }，R 2 The final received whole is { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 2→3 ，σ 3→1 ，σ 1→2 }，R 3 The final received whole is { m } 1 ，m 2 ，m 3 |σ 1 ，σ 2 ，σ 3 ，σ 3→1 ，σ 1→2 ，σ 2→3 }。R 1 The result is sent to a signature checking mechanism which sequentially verifies the signature sigma 1 ，σ 2 ，σ 3 ，σ 1→2 ，σ 2→3 ，σ 3→1 Whether it is correct or not to have a correct,if they are all correct, return the result to R 1 。R 1 It is believed that each message value m 1 ，m 2 ，m 3 }；R 2 The received whole is sent to a third party signature verification mechanism which sequentially verifies the signature sigma 1 ，σ 2 ，σ 3 ，σ 2→3 ，σ 3→1 ，σ 1→2 If they are correct, returning the result to R 2 。R 2 It is believed that each message value m 1 ，m 2 ，m 3 )；R 3 The received whole is sent to a third party signature verification mechanism which sequentially verifies the signature sigma 1 ，σ 2 ，σ 3 ，σ 3→1 ，σ 1→2 ，σ 2→3 If they are correct, returning the result to R 3 。R 3 It is believed that each message value m 1 ，m 2 ，m 3 }. All three backup nodes have the same trusted message list { m }, with all three backup nodes 1 ，m 2 ，m 3 And inputting the result into a deterministic one-to-one mapping function with good advance quotient, and outputting the final result as a message of the master node. Preferably here we choose the majority function, then R 1 ，R 2 ，R 3 The final results obtained were allThe output is the element with the highest number of occurrences of the message list.
Example 3
Based on embodiment 1, embodiment 3 of the present invention further provides a power data transmission system based on quantum-bayer-family consensus, including:
the signature distribution module is used for signing the information to be transmitted by the master node and transmitting the information to the backup node;
the signature exchange module is used for each backup node to receive the information and the signature sent by the main node and sign the signature of the own, integrally send the information and the signature to the next backup node, the next backup node adds the information and the signature received by the own main node, signs the own signature, integrally sends the information and the signature to the next backup node, and sequentially carries out data transfer according to the mode, and the last backup node gives all the information and the signature to the first backup node, so that each backup node collects the information and the signature received by other backup nodes; the signature is a quantum digital signature;
and after each backup node receives the information and the signature received by all the backup nodes, the result verification module integrally sends the information and the signature to a third-party signature verification mechanism for verification, if the verification is not passed, the signature communication module is returned to be executed, and if the verification is passed, the backup node outputs the message sent by the main node.
Specifically, the signature distribution module is further configured to:
assuming that n power subsystems are shared, randomly selecting one from the n power subsystems as a main node, using the rest n-1 power subsystems as backup nodes, performing quantum digital signature on information sent to each backup node by the main node, and sending the information and the quantum digital signature to the corresponding backup node together, wherein the information refers to power data to be transmitted by the power subsystems.
More specifically, the signature distribution module is further configured to:
the master node S sends itself to the backup node R i Information m of (2) i Quantum digital signature is carried out, and signature is sigma i Message m i Signature as a whole { m } i |σ i Is sent to the corresponding backup node R together i Wherein i is the serial number of the backup node.
Specifically, the order in which each backup node in the signature communication module collects the messages and signatures received by other backup nodes is clockwise collection.
Specifically, the signature communication module is further configured to:
first backup node R 1 Information m of host node received by self 1 And quantum digital signature sigma 1 As a whole { m } 1 |σ 1 ' marking with its own quantum digital signature sigma 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the second backup node R 2 A second backup node R 2 Message m of host node received by oneself 2 And quantum digital signature sigma 2 As a whole { m 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 2 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 According to this flow, up to the last backup node R n-1 Message received by the master node from the master node and quantum digital signature { m } n-1 |σ n-1 All add and sign their own quantum digital signature sigma n-1→1 Thereafter, by the last backup node R n-1 Digitally signing all messages and quanta { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 All handed to the first backup node.
Specifically, the quantum digital signature mode is to use one-hash-at-a-time quantum digital signature, BB84 single-bit GC01 type quantum digital signature or SARG04 single-bit quantum digital signature for long messages.
Specifically, the result verification module is further configured to:
after each backup node takes the information and the signatures of all the backup nodes, the information and the signatures are sent to a third party signature verification mechanism as a whole to verify whether each signature is correct, if each signature is correct, the third party signature verification mechanism sends back "correct", the backup node inputs all the messages into a preset decision type function, outputs the messages as the messages which are finally considered to be sent by the main node, if the signatures are incorrect, the third party signature verification mechanism sends back "error", and the signature communication module is re-executed until the third party signature verification mechanism returns "correct".
More specifically, the preset decision type function is a quality function or a one-to-one mapping choice function.
The above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. The electric power data transmission method based on quantum Bayesian consensus is characterized by comprising the following steps of:
step 1, a master node signs information to be transmitted and transmits the information to a backup node;
step 2, each backup node receives the information and signature sent by the main node and signs the information and signature of the own, and integrally sends the information and signature to the next backup node, the next backup node adds the information and signature received by the own and sent by the main node, signs the own signature, integrally sends the information and signature to the next backup node, and according to the mode, data flow is sequentially carried out, and the last backup node gives all the information and signature to the first backup node, so that each backup node collects the information and signature received by other backup nodes; the signature is a quantum digital signature;
and step 3, after each backup node receives the information and the signature received by all the backup nodes, sending the whole information and the signature to a third-party signature verification mechanism for verification, returning to the step 2 if the verification is not passed, and outputting the information sent by the main node by the backup nodes if the verification is passed.
2. The method for transmitting power data based on quantum bayer pattern consensus according to claim 1, wherein the step 1 comprises:
assuming that n power subsystems are shared, randomly selecting one from the n power subsystems as a main node, using the rest n-1 power subsystems as backup nodes, performing quantum digital signature on information sent to each backup node by the main node, and sending the information and the quantum digital signature to the corresponding backup node together, wherein the information refers to power data to be transmitted by the power subsystems.
3. The method for transmitting power data based on quantum bayer pattern consensus according to claim 2, wherein the step 1 further comprises:
the master node S sends itself to the backup node R i Information m of (2) i Quantum digital signature is carried out, and signature is sigma i Message m i Signature as a whole { m } i |σ i Is sent to the corresponding backup node R together i Wherein i is the serial number of the backup node.
4. The method for power data transmission based on quantum-bayer-family consensus according to claim 1, wherein the order in which each backup node collects the messages and signatures received by other backup nodes in step 2 is clockwise.
5. The method for transmitting power data based on quantum bayer pattern consensus according to claim 1, wherein the step 2 comprises:
first backup node R 1 Information m of host node received by self 1 And quantum digital signature sigma 1 As a whole { m } 1 |σ 1 ' marking with its own quantum digital signature sigma 1→2 Then the whole { m }, is 1 |σ 1 ，σ 1→2 Send to the second backup node R 2 A second backup node R 2 Message m of host node received by oneself 2 And quantum digital signature sigma 2 As a whole { m 2 |σ 2 Adding and marking the quantum digital signature sigma of the user 2→3 Will be overall { m 1 ，m 2 |σ 1 ，σ 2 ，σ 1→2 ，σ 2→3 And handed to the third backup node R 3 According to this flow, straightTo the last backup node R n-1 Message received by the master node from the master node and quantum digital signature { m } n-1 |σ n-1 All add and sign their own quantum digital signature sigma n-1→1 Thereafter, by the last backup node R n-1 Digitally signing all messages and quanta { m } 1 ，m 2 ，…，m n-1 |σ 1 ，σ 2 ，…，σ n-1 ，σ 1→2 ，σ 2→3 ，…，σ n-1→1 All handed to the first backup node.
6. The method for transmitting power data based on quantum bayer consensus according to claim 1, wherein the quantum digital signature is a one-hash-at-a-time quantum digital signature, a BB84 single-bit GC01 type quantum digital signature, or an SARG04 single-bit quantum digital signature for long messages.
7. The method for transmitting power data based on quantum bayer pattern consensus according to claim 1, wherein the step 3 comprises:
after each backup node takes the information and the signatures of all the backup nodes, the information and the signatures are sent to a third party signature verification mechanism as a whole to verify whether each signature is correct, if each signature is correct, the third party signature verification mechanism sends back "correct", the backup node inputs all the messages into a preset decision type function, outputs the messages as the messages which are finally considered to be sent by the main node, if the signatures are incorrect, the third party signature verification mechanism sends back "error", and step 2 is re-executed until the third party signature verification mechanism returns "correct".
8. The method for power data transmission based on quantum-bayer-based consensus according to claim 7, wherein the predetermined decision function is a majority function or a one-to-one choice function.
9. A quantum-bayer-based power data transmission system, comprising:
the signature distribution module is used for signing the information to be transmitted by the master node and transmitting the information to the backup node;
the signature exchange module is used for each backup node to receive the information and the signature sent by the main node and sign the signature of the own, integrally send the information and the signature to the next backup node, the next backup node adds the information and the signature received by the own main node, signs the own signature, integrally sends the information and the signature to the next backup node, and sequentially carries out data transfer according to the mode, and the last backup node gives all the information and the signature to the first backup node, so that each backup node collects the information and the signature received by other backup nodes; the signature is a quantum digital signature;
and after each backup node receives the information and the signature received by all the backup nodes, the result verification module integrally sends the information and the signature to a third-party signature verification mechanism for verification, if the verification is not passed, the signature communication module is returned to be executed, and if the verification is passed, the backup node outputs the message sent by the main node.
10. The quantum-bayer-based power data transmission system according to claim 9, wherein the signature distribution module is further configured to:
assuming that n power subsystems are shared, randomly selecting one from the n power subsystems as a main node, using the rest n-1 power subsystems as backup nodes, performing quantum digital signature on information sent to each backup node by the main node, and sending the information and the quantum digital signature to the corresponding backup node together, wherein the information refers to power data to be transmitted by the power subsystems.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311846750.6A CN117811746A (en) | 2023-12-27 | 2023-12-27 | Electric power data transmission method and system based on quantum Bayesian consensus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311846750.6A CN117811746A (en) | 2023-12-27 | 2023-12-27 | Electric power data transmission method and system based on quantum Bayesian consensus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117811746A true CN117811746A (en) | 2024-04-02 |
Family
ID=90423280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311846750.6A Pending CN117811746A (en) | 2023-12-27 | 2023-12-27 | Electric power data transmission method and system based on quantum Bayesian consensus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117811746A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| US20180157558A1 (en) * | 2016-10-04 | 2018-06-07 | Nec Europe Ltd. | Method and system for byzantine fault-tolerance replicating of data on a plurality of servers |
| CN113094743A (en) * | 2021-03-18 | 2021-07-09 | 南京邮电大学 | Power grid data storage method based on improved Byzantine consensus algorithm |
| CN113409154A (en) * | 2021-05-10 | 2021-09-17 | 精英数智科技股份有限公司 | Credible storage-based liability insurance processing method and system |
-
2023
- 2023-12-27 CN CN202311846750.6A patent/CN117811746A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180157558A1 (en) * | 2016-10-04 | 2018-06-07 | Nec Europe Ltd. | Method and system for byzantine fault-tolerance replicating of data on a plurality of servers |
| CN106789095A (en) * | 2017-03-30 | 2017-05-31 | 腾讯科技（深圳）有限公司 | Distributed system and message treatment method |
| CN113094743A (en) * | 2021-03-18 | 2021-07-09 | 南京邮电大学 | Power grid data storage method based on improved Byzantine consensus algorithm |
| CN113409154A (en) * | 2021-05-10 | 2021-09-17 | 精英数智科技股份有限公司 | Credible storage-based liability insurance processing method and system |
Non-Patent Citations (1)
| Title |
|---|
| CHEN-XUN WENG等: "Beating the Fault-Tolerance Bound and Security Loopholes for Byzantine Agreement with a Quantum Solution", RESEARCH, 21 November 2023 (2023-11-21), pages 1 - 11 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107733648B (en) | Identity-based RSA digital signature generation method and system | |
| CN113297633B (en) | Quantum digital signature method | |
| WO2023082823A1 (en) | Quantum digital signature and quantum digital signcryption method | |
| Kuznetsov et al. | Code-based electronic digital signature | |
| CN107911209A (en) | The method for establishing the security public key cryptography of resisting quantum computation attack | |
| CN110599164B (en) | Supervision-capable quick payment method for any payee under chain | |
| CN110011995A (en) | Encryption and decryption approaches and device in multi-casting communication | |
| Kuznetsov et al. | New approach to the implementation of post-quantum digital signature scheme | |
| CN106452790B (en) | Multi-quantum digital signature method without trust center | |
| Li et al. | One-time universal hashing quantum digital signatures without perfect keys | |
| CN113268762B (en) | Unconditional security authentication method based on LFSR hash | |
| CN114065249A (en) | Authentication encryption method | |
| Ertaul et al. | Elliptic curve cryptography based threshold cryptography (ecc-tc) implementation for manets | |
| Strand | A status update on quantum safe cryptography | |
| CN117811746A (en) | Electric power data transmission method and system based on quantum Bayesian consensus | |
| Xin et al. | Identity-based quantum signature based on Bell states | |
| Xin et al. | Efficient identity-based public-key quantum signature scheme | |
| Wang et al. | New construction of blind signatures from braid groups | |
| CN114338029A (en) | Mercker tree signature method for resisting quantum computation attack | |
| Amiri et al. | Unconditionally secure signatures | |
| Tong et al. | Threshold‐based key management scheme for space network | |
| Díaz et al. | Chor-rivest knapsack cryptosystem in a post-quantum world | |
| Tamil Selvi et al. | Post‐Quantum Cryptosystems for Blockchain | |
| Huang et al. | Quantum signature scheme based on secret sharing | |
| Tanwar | Basics of cryptographic primitives for blockchain development |
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 |