A trusted proxy tree cross-domain transaction consensus method and storage medium based on digital signature

Abstract

The present invention relates to a cross-domain transaction consensus method and storage medium based on a trusted proxy tree with digital signatures, and belongs to the field of blockchain consensus technology. The method includes: the transaction initiation node calculates and selects the leader node according to the location information of the two parties to the transaction to form a consensus committee; the transaction initiation node acts as a consensus request initiation node, sends the consensus request message and the consensus committee information to the leader node, and the leader node broadcasts and sends the consensus request message; the consensus committee members and the leader node calculate the aggregate signature; the leader node verifies whether the aggregate signature is valid, if the verification is successful, the consensus is successful, the leader node generates a new block on the alliance chain managed by itself and writes the consensus request message into the new block; otherwise, the consensus fails. This method can reduce the number of communications in the consensus process, and realize system load balancing, ensuring the security, stability, efficiency and low energy consumption of the cross-domain transaction consensus.

Description

Technical Field

[0001] The present invention belongs to the field of blockchain consensus technology, and in particular relates to a trusted proxy tree cross-domain transaction consensus method and storage medium based on digital signatures. Background Art

[0002] At present, in the large-scale transaction circulation links under the standardized system, centralized system management methods are mostly used to provide data recording and security services; with the mature application of blockchain technology, many industries have also begun to introduce this "distributed ledger" technology to give full play to its tamper-proof characteristics and provide trusted support for recording, auditing and evidence collection, but such attempts are mostly concentrated in small-scale businesses or high-latency and low-concurrency application scenarios.

[0003] As one of the core technologies in blockchain applications, the consensus mechanism plays an important role in the efficiency and cost of blockchain operations. The Byzantine Fault Tolerant algorithm is the most widely used solution in the consortium chain, but even in a trusted execution environment, its communication complexity is still high, and the efficiency and activity of the consensus system will also be significantly affected by the communication distance. Obviously, when using the traditional consortium chain consensus mechanism to provide consensus services for cross-domain transactions, it will be subject to multiple severe limitations in terms of concurrency, transaction volume, and distance, and cannot meet performance requirements such as high reliability, low latency, and low consumption.

[0004] Therefore, how to provide a real-time, reliable, low-energy and environmentally friendly trusted transaction consensus method in high-concurrency, large-volume and long-distance scenarios has become an urgent problem to be solved. Summary of the invention

[0005] The main purpose of the present invention is to overcome the shortcomings and deficiencies of the prior art and provide a cross-domain transaction consensus method and storage medium based on a trusted proxy tree with digital signatures, which can reduce the number of communications in the consensus process and achieve system load balancing, thereby ensuring the security, stability, efficiency and low energy consumption of cross-domain transaction consensus.

[0006] According to one aspect of the present invention, the present invention provides a trusted proxy tree cross-domain transaction consensus method based on digital signature, the method comprising the following steps:

[0007] Step 1: Input security parameters to initialize the system, calculate and disclose system public parameters;

[0008] Step 2: The user node calls an asymmetric encryption algorithm to generate a key pair based on the system public parameters; the system assigns a proxy node in the tree structure network as its management node based on the permanent location information of the user node;

[0009] Step 3: The transaction initiating node calculates and selects the leader node based on the location information of the transaction parties, determines the other member nodes of the consensus committee, and forms a consensus committee;

[0010] Step 4: The transaction initiating node acts as the consensus request initiating node and sends the consensus request message and consensus committee information to the leading node. The leading node broadcasts the consensus request message; the consensus committee members and the leading node calculate the aggregate signature;

[0011] Step 5: The leader node verifies whether the aggregate signature is valid. If the verification is successful, the consensus is successful. The leader node generates a new block on the alliance chain it manages and writes the consensus request message into the new block; otherwise, the consensus fails.

[0012] Preferably, the step 1 comprises:

[0013] Call the system initialization algorithm pp←Setup(1 λ ): Input security parameter λ, select cyclic groups G1 and G of prime order q T and the integer group e represents the bilinear map G1×G1→G T , generator g∈G1, generator Z=e(g,g)∈G T , H s is the definition Cryptographic hash function; output and disclose the system's global public parameters

[0014] Preferably, step 2 comprises:

[0015] User node i uses the system public parameters to generate an asymmetric key pair: select a random number As the private key, and obtain the corresponding public key P through group operation i =d i G;

[0016] The system assigns a proxy node as the management node MaN of user node i according to the permanent location information of user node i.

[0017] Preferably, the step 3 comprises:

[0018] From the two management nodes MaN to which the two user nodes belong respectively A and MaN B First, search upward for the same upper node with the smallest height between the two transaction parties as the leader node LN, where the same upper node with the smallest height represents the common parent node with the lowest relative level in the tree structure found from the two management nodes;

[0019] Will depart from LN to MaN Aand MaN B All nodes in the two shortest single chains between them and the nodes of both parties of the transaction are determined as the member nodes MeN of the consensus committee; the consensus committee Group = {LN, MeN1, MeN2, ..., MeN n}.

[0020] Preferably, step 4 comprises:

[0021] In the first stage, the transaction initiating node acts as the consensus request initiating node CRIN, sends the consensus request message and consensus committee information to LN, and LN broadcasts the consensus request message; in the second stage, the consensus committee members MeN in the tree structure network calculate the initial cumulative value of the aggregate signature from bottom to top; in the third stage, LN combines the initial cumulative value and the consensus message to calculate the hash value, and broadcasts the result; in the fourth stage, the consensus committee members in the tree structure network calculate the final cumulative value of the aggregate signature from bottom to top, where bottom to top means the logical order of completing related calculations layer by layer from the lowest level of the tree structure; the complete aggregate signature is composed of the calculation results of the third and fourth stages.

[0022] Preferably, the step 4 specifically includes:

[0023] CRIN sends the consensus message S and the consensus committee Group of this round to the LN in the Group;

[0024] LN to MeN1, MeN2, ..., MeN n Broadcast consensus message S;

[0025] LN and MeN1, MeN2, ..., MeN n Based on their relative positions in the tree structure network, the calculation is completed from bottom to top to obtain the parameters used for signing;

[0026] The leader node LN uses the parameters used for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′).

[0027] Preferably, the leader node LN uses the parameters for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′), including:

[0028] If the MeN is a leaf node type MeN: Generate a random number Calculate the initial cumulative value Send the calculation result to the parent node, where i∈{1,...,n};

[0029] If the MeN is a non-leaf node type MeN: Generate a random number calculate L i ′=L i +L son ′, and send the calculation result to its parent node, where i∈{1,...,n}, L son ′ is the message sent by its child node;

[0030] If the node is a leader node LN: Generate a random number calculate Calculate L0′=L0+L son1 ′+L son2 ′, where L son ′ and L son2 ′ is the message received from its child nodes;

[0031] LN calculates hash c = H s (L0′||S), to MeN1, MeN2, ..., MeN n Broadcast c, where “||” means concatenating two strings.

[0032] Preferably, the leader node LN uses the parameters for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′), including:

[0033] If MeN is a leaf node type MeN: calculate the final cumulative value r i ′=r i = l i -cd i , send the calculation result to the parent node, where i∈{1,...,n}, d i is the private key of the node;

[0034] If the MeN is a non-leaf node type MeN: calculate r i = l i -cd i , calculate r i ′=r i +r son ′, send the calculation result to the parent node, where i∈{1,...,n}, d i is the private key of the node, r son ′ is the message received from its child nodes;

[0035] If the node is the leader node LN: calculate r0 = l0-cd o , calculate r0′=r0+r son1 ′+r son2 ′, where r so ′ and r son2′ is the message received from its child node, and d0 is the private key of the node;

[0036] Get the complete aggregate signature message (c, r0′).

[0037] Preferably, step 5 comprises:

[0038] LN calculation And calculate c′=H s (L0″||S), where P i is the public key set of Group members, i∈{0, 1, ..., n};

[0039] Determine whether c′ is equal to c. If they are equal, the signature verification is successful, proving that the consensus committee has completed this consensus. LN generates a new block on the alliance chain it manages and writes the consensus message S into the new block. Otherwise, the signature verification fails, proving that the consensus has failed, and the chain operation is not performed.

[0040] According to another aspect of the present invention, the present invention further provides a computer-readable storage medium, characterized in that the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions implement the above method steps when executed by a processor.

[0041] Beneficial effects: The present invention is based on a cross-domain communication system with a tree structure in a trusted environment, provides a leadership node selection algorithm based on the characteristic relationship between the positions of the two transaction parties, dynamically performs on-chain selection, and can reasonably publish transaction negotiation information on different alliance chains. The method of selective information submission facilitates the hierarchical management of content; the consensus committee composition algorithm of the present invention dynamically selects consensus members, balances the task load and resource consumption of each node, and improves the overall concurrency; the consensus strategy based on aggregate signatures can exponentially reduce the communication complexity in traditional consensus strategies, reduce network congestion during system operation and communication interruption problems in asynchronous network environments, and meet the system in cross-domain massive transaction scenarios. The system can operate reliably with low energy consumption, and has broad application prospects.

[0042] The features and advantages of the present invention will become clear through reference to the following drawings and detailed description of specific embodiments of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] Figure 1 The present invention is a flow chart of a cross-domain transaction consensus method based on a trusted proxy tree with digital signatures according to an embodiment;

[0044] Figure 2 is a schematic diagram of a tree-structured cross-domain communication system structure of another embodiment;

[0045] Figure 3is a schematic diagram of executing a cross-domain transaction consensus method according to another embodiment;

[0046] Figure 4 is an overall flow chart of a trusted proxy tree cross-domain transaction consensus method according to another embodiment;

[0047] Figure 5 This is the distribution diagram of the consensus task ratio during the simulation experiment in the three-layer tree system. DETAILED DESCRIPTION

[0048] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0049] Example 1

[0050] Figure 1 The following is a flow chart of a cross-domain transaction consensus method based on a trusted proxy tree with digital signatures according to an embodiment of the present invention. Figure 1 As shown, this embodiment provides a trusted proxy tree cross-domain transaction consensus method based on digital signature, and the method includes the following steps:

[0051] Step 1: Input security parameters to initialize the system, calculate and disclose system public parameters;

[0052] Step 2: The user node calls an asymmetric encryption algorithm to generate a key pair based on the system public parameters; the system assigns a proxy node in the tree structure network as its management node based on the permanent location information of the user node;

[0053] Step 3: The transaction initiating node calculates and selects the leader node based on the location information of the transaction parties, determines the other member nodes of the consensus committee, and forms a consensus committee;

[0054] Step 4: The transaction initiating node acts as the consensus request initiating node and sends the consensus request message and consensus committee information to the leading node. The leading node broadcasts the consensus request message; the consensus committee members and the leading node calculate the aggregate signature;

[0055] Step 5: The leader node verifies whether the aggregate signature is valid. If the verification is successful, the consensus is successful. The leader node generates a new block on the alliance chain it manages and writes the consensus request message into the new block; otherwise, the consensus fails.

[0056] This method can reduce the number of communications in the consensus process and achieve system load balancing, ensuring the security, stability, efficiency and low energy consumption of cross-domain transaction consensus.

[0057] Preferably, the step 1 comprises:

[0058] Call the system initialization algorithm pp←Setup(1 λ ): Input security parameter λ, select cyclic groups G1 and G of prime order q T and the integer group e represents the bilinear map G1×G1→G T , generator g∈G1, generator Z=e(g,g)∈G T , H s is the definition Cryptographic hash function; output and disclose the system's global public parameters

[0059] Preferably, step 2 comprises:

[0060] User node i uses the system public parameters to generate an asymmetric key pair: select a random number As the private key, and obtain the corresponding public key P through group operation i =d i G;

[0061] The system assigns a proxy node as the management node MaN of user node i according to the permanent location information of user node i.

[0062] Preferably, the step 3 comprises:

[0063] From the two management nodes MaN to which the two user nodes belong respectively A and MaN B First, search upward for the same upper node with the smallest height between the two transaction parties as the leader node LN, where the same upper node with the smallest height represents the common parent node with the lowest relative level in the tree structure found from the two management nodes;

[0064] Will depart from LN to MaN A and MaN B All nodes in the two shortest single chains between them and the nodes of both parties of the transaction are determined as the member nodes MeN of the consensus committee; the consensus committee Group = {LN, MeN1, MeN2, ..., MeN n}.

[0065] Preferably, step 4 comprises:

[0066] In the first stage, the transaction initiating node acts as the consensus request initiating node CRIN, sends the consensus request message and consensus committee information to LN, and LN broadcasts the consensus request message; in the second stage, the consensus committee members MeN in the tree structure network calculate the initial cumulative value of the aggregate signature from bottom to top; in the third stage, LN combines the initial cumulative value and the consensus message to calculate the hash value, and broadcasts the result; in the fourth stage, the consensus committee members in the tree structure network calculate the final cumulative value of the aggregate signature from bottom to top, where bottom to top means the logical order of completing related calculations layer by layer from the lowest level of the tree structure; the complete aggregate signature is composed of the calculation results of the third and fourth stages.

[0067] Preferably, the step 4 specifically includes:

[0068] CRIN sends the consensus message S and the consensus committee Group of this round to the LN in the Group;

[0069] LN to MeN1, MeN2, ..., MeN n Broadcast consensus message S;

[0070] LN and MeN1, MeN2, ..., MeN n Based on their relative positions in the tree structure network, the calculation is completed from bottom to top to obtain the parameters used for signing;

[0071] The leader node LN uses the parameters used for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′).

[0072] Preferably, the leader node LN uses the parameters for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′), including:

[0073] If the MeN is a leaf node type MeN: Generate a random number Calculate the initial cumulative value Send the calculation result to the parent node, where i∈{1,...,n};

[0074] If the MeN is a non-leaf node type MeN: Generate a random number calculate L i ′=L i +L son ′, and send the calculation result to its parent node, where i∈{1,...,n}, L son ′ is the message sent by its child node;

[0075] If the node is a leader node LN: Generate a random number calculate Calculate L0′=L0+L son1 ′+L son2 ′, where L sonl ′ and L son2 ′ is the message received from its child nodes;

[0076] LN calculates hash c = H s (L0′||S), to MeN1, MeN2, ..., MeN n Broadcast c, where “||” means concatenating two strings.

[0077] Preferably, the leader node LN uses the parameters for signing to calculate the hash value and the cumulative value operator of the aggregate signature to obtain a complete aggregate signature message (c, r0′), including:

[0078] If MeN is a leaf node type MeN: calculate the final cumulative value r i ′=r i = l i -cd i , send the calculation result to the parent node, where i∈{1,...,n}, d i is the private key of the node;

[0079] If the MeN is a non-leaf node type MeN: calculate r i = l i -cd i , calculate r i ′=r i +r son ′, send the calculation result to the parent node, where i∈{1,...,n}, d i is the private key of the node, rso n ′ is the message received from its child nodes;

[0080] If the node is the leader node LN: calculate r0 = l0-cd o , calculate r0′=r0+r sonl ′+r son2 ′, where r son1 ′ and r son2 ′ is the message received from its child node, and d0 is the private key of the node;

[0081] Get the complete aggregate signature message (c, r0′).

[0082] Preferably, step 5 comprises:

[0083] LN calculation And calculate c′=H s(L0″||S), where P i is the public key set of Group members, i∈{0, 1, ..., n};

[0084] Determine whether c′ is equal to c. If they are equal, the signature verification is successful, proving that the consensus committee has completed this consensus. LN generates a new block on the alliance chain it manages and writes the consensus message S into the new block. Otherwise, the signature verification fails, proving that the consensus has failed, and the chain operation is not performed.

[0085] This embodiment is based on a cross-domain communication system with a tree structure in a trusted environment, and provides a leadership node selection algorithm based on the characteristic relationship between the positions of the two parties to the transaction. It can dynamically select on-chain information, and can reasonably publish transaction negotiation information on different alliance chains. The method of selective information submission is convenient for hierarchical management of content; the consensus committee composition algorithm of this embodiment dynamically selects consensus members, balances the task load and resource consumption of each node, and improves the overall concurrency; the consensus strategy based on aggregate signatures can exponentially reduce the communication complexity in traditional consensus strategies, reduce network congestion during system operation and communication interruption problems in asynchronous network environments, and meet the system in cross-domain massive transaction scenarios. Reliable operation with low energy consumption has broad application prospects.

[0086] In order to more fully understand the technical solution of the present invention, a more specific implementation method is given below in combination with the application scenario of cross-domain data flow.

[0087] See also Figure 2 The tree-structured cross-domain communication system of this embodiment includes two roles: trusted proxy nodes (PN) and user nodes (UN), both of which have communication, storage and computing capabilities. All trusted proxy nodes manage a consortium chain respectively, and form a trusted multi-branch tree-structured communication network based on the inclusion relationship of regional divisions in the geographical scope. UN is divided into a specific PN in the above tree structure network for management according to the location of its permanent area. Under different transaction requests, each node dynamically participates in the consensus process before the consortium chain managed by its superior node generates a new block.

[0088] In this embodiment, the method is applied to the cross-domain data flow that is currently of concern as an example for illustration.

[0089] See also Figure 3In the specific implementation process, a certain area C is divided into three layers: the third layer is the highest layer, which includes the entire area C, and the corresponding node number is 0; the second layer is the middle layer, which divides area C into three parts, and the corresponding node numbers are 1, 5, and 9 respectively; the first layer is the lowest layer, which divides the areas corresponding to node numbers 1, 5, and 9 into three parts respectively, and generally divides area C into nine parts, among which node number 1 corresponds to area division node numbers 2, 3, and 4, node number 5 corresponds to area division node numbers 6, 7, and 8, and node number 9 corresponds to area division node numbers 10, 11, and 12.

[0090] In this example, Company A is the initiator of a data transaction, with a user node number of 13, and the corresponding management node number of its user group is 2; Company B is the recipient of the data transaction, with a user node number of 14, and the corresponding management node number of its user group is 12. Figure 4 , the following is the specific implementation process of the cross-domain transaction consensus method in this embodiment:

[0091] Step 1 is as follows:

[0092] System call system initialization algorithm pp←Setup(1 λ ): Input security parameter λ, select cyclic groups G1 and G of prime order q T and the integer group e represents the bilinear map G1×G1→G T , generator g∈G1, generator Z=e(g,g)∈G T , assuming that G1 and G T The discrete logarithm problem in H is difficult. s is the definition Cryptographic hash function. Output system global public parameters

[0093] Furthermore, step 2 is specifically as follows:

[0094] Step 2-1: Based on the pp obtained in step 1, Company A selects a random number As the private key, and calculate P a =d a G is used as the public key; Company B chooses a random number As the private key, and calculate P b =d b G is the public key.

[0095] Step 2-2: The system calculates the area of ​​​​the permanent location of Company A. A Assign it to join the user group of management node PN2, according to the permanent location information of company B BAssign it to join the management node PN 12 in the user group.

[0096] Furthermore, step 3 specifically includes the following steps:

[0097] Step 3-1: From the two nodes PN2 and PN belonging to Company A and Company B respectively 12 Start from the beginning and look upward for the same superior node PN0 of the two parties with the smallest height as the leader node.

[0098] Step 3-2: Start from PN0 to PN2 and PN 12 All nodes in the two shortest single chains between them are selected as MeN, and both parties to the transaction are also selected as MeN.

[0099] Step 3-3: Form a consensus committee Group = {PN0, PN1, PN2, PN9, PN 12 , UN 13 , UN 14}.

[0100] Furthermore, step 4 specifically includes the following steps:

[0101] Step 4-1: UN as CRIN 13 Send the consensus message S and the consensus committee Group of this round to the selected leader node PN0.

[0102] Step 4-2: PN0 to PN1, PN2, PN9, PN 12 , UN 13 , UN 14 Broadcast consensus message S.

[0103] Step 4-3: Based on the relative positions of the Group members in the tree structure network, complete the following calculations from bottom to top (at this time, both parties to the transaction are also connected to the tree structure network and are located at the leaf nodes of the two single chains):

[0104] (1) UN 13 Generate random numbers calculate Send the calculation result to PN2. Similarly, UN 14 Generate random numbers calculate Send the calculation results to PN 12 .

[0105] (2) PN2 generates random numbers calculate Calculate L2′=L2+L 13 ′, send the calculation result to PN1; PN1 generates a random number calculate Calculate L1′=L1+L2′ and send the result to PN0. 12 Generate random numbers calculate Calculate L 12 ′=L 12 +L 14 ', send the calculation result to PN9; PN9 generates a random number calculate Calculate L9′=L9+L 12 ′, send the calculation result to PN0

[0106] (3) PN0 generates random numbers calculate Calculate L0′=L0+L1′+L9′.

[0107] Step 4-4: PN0 calculates hash c=H s (L0′||S), to PN1, PN2, PN9, PN 12 , UN 13 , UN 14 Broadcast c.

[0108] Step 4-5: Based on the relative positions of the Group members in the tree structure network, complete the following calculations from bottom to top (at this time, both parties to the transaction are also connected to the tree structure network and are located at the leaf nodes of the two single chains):

[0109] (1) UN 13 (The private key is d 13 ) Calculate r 13 ′=r 13 = l 13 -cd 13 , and send the calculation results to PN2. Similarly, UN 14 (The private key is d 14 ) Calculate r 14 ′=r 14 = l 14 -cd 14 , send the calculation results to PN 12 .

[0110] (2) PN2 (private key is d2) calculates r2 = l2 - cd2, calculates r2′ = r2 + r 13 ′, and sends the calculation result to PN1; PN1 (private key is d1) calculates r1=l1-cd1, calculates r1′=r1+r2′, and sends the calculation result to PN0. 12 (The private key is d 12 ) Calculate r 12 = l 12 -cd 12, calculate r 12 ′=r 12 +r 14 ′, and sends the calculation result to PN9; PN9 (private key is d9) calculates r9=l9-cd9, and calculates r9′=r9+r 12 ′, and send the calculation result to PN0.

[0111] (3) PN0 (private key is d0) calculates r0=l0-cd0, and calculates r0′=r0+r1′+r9′.

[0112] (4) Obtain the complete aggregate signature message (c, r0′).

[0113] Furthermore, step 5 specifically includes the following steps:

[0114] Assume that the public key set of Group members is P.

[0115] Step 5-1: Calculation

[0116]

[0117] Further calculation c′=H s (L0″||S), the above calculation is completed by PN0.

[0118] Step 5-2: Because L0″ is equal to L0′, c′ is equal to c, the signature verification is successful, and the consensus committee completes this consensus. PN0 generates a new block on the alliance chain it manages and writes the data transaction agreement S between Company A and Company B into the new block.

[0119] See also Figure 5 , using the method proposed in this invention, 2*10 6 The simulation experiment of transactions showed that the number of consensus tasks allocated to the three layers were 723395, 659998 and 616607 respectively, which was basically evenly distributed.

[0120] Example 2

[0121] This embodiment provides a computer-readable storage medium, which stores computer-executable instructions. When the computer-executable instructions are executed by a processor, the method steps in Embodiment 1 are implemented.

[0122] The specific implementation process can refer to the implementation process of the method steps in Example 1, which will not be repeated here.

[0123] It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0124] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0125] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0126] The above description is only a preferred embodiment of the present invention, and does not limit the patent scope of the present invention. All equivalent structural changes made by using the contents of the present invention specification and drawings under the concept of the present invention, or directly / indirectly applied in other related technical fields are included in the patent protection scope of the present invention.

Claims

1. A cross-domain transaction consensus method based on a trusted proxy tree with digital signatures, characterized in that: The method comprises the following steps: Step 1: Input security parameters to initialize the system, calculate and disclose system public parameters; Step 2: The user node calls an asymmetric encryption algorithm to generate a key pair based on the system public parameters; the system assigns a proxy node in the tree structure network as its management node based on the permanent location information of the user node; Step 3: The transaction initiating node calculates and selects the leader node based on the location information of the transaction parties, determines the other member nodes of the consensus committee, and forms a consensus committee; Step 4: The transaction initiating node acts as the consensus request initiating node and sends the consensus request message and consensus committee information to the leading node. The leading node broadcasts the consensus request message; the consensus committee members and the leading node calculate the aggregate signature; Step 5: The leader node verifies whether the aggregate signature is valid. If the verification is successful, the consensus is successful. The leader node generates a new block on the alliance chain it manages and writes the consensus request message into the new block. Otherwise, the consensus fails. The step 1 comprises: Call the system initialization algorithm pp←Setup(1 λ ): Input security parameter λ, select cyclic groups G1 and G of prime order q T and the integer group e represents the bilinear map G1×G1→G T , generator g∈G1, generator Z=e(g,g)∈G T , H s is the definition Cryptographic hash function; output and disclose system public parameters ; The step 2 comprises: User node i uses the system public parameters to generate an asymmetric key pair: select a random number As the private key, and obtain the corresponding public key P through group operation i ; The system assigns a proxy node as the management node MaN of user node i according to the permanent location information of user node i; The step 3 comprises: From the two management nodes MaN to which the two user nodes belong respectively A and MaN B At the beginning, the same upper node with the smallest height between the two parties of the transaction is searched upward as the leader node LN, wherein the same upper node with the smallest height represents the common parent node with the lowest relative level in the tree structure network found from the two management nodes; Will depart from LN to MaN A and MaN B All nodes in the two shortest single chains between them and the nodes of both parties of the transaction are determined as the member nodes MeN of the consensus committee; the consensus committee Group = {LN, MeN1, MeN2, …, MeN n }; The step 4 comprises: In the first stage, the transaction initiating node acts as the consensus request initiating node CRIN and sends the consensus request message S and the consensus committee information to LN. LN sends the consensus request message S to MeN1, MeN2, …, MeN n Broadcast consensus request message S; In the second stage, the consensus committee members MeN in the tree structure network calculate the initial cumulative value of the aggregated signature from bottom to top; In the third stage, LN combines the initial cumulative value and the consensus request message S to calculate the hash value and broadcasts the calculation result; In the fourth stage, the consensus committee members MeN in the tree structure network calculate the final cumulative value of the aggregate signature from bottom to top, where bottom to top means completing the logical order of related calculations from the lowest level of the tree structure network layer by layer upward; the calculation results of the third and fourth stages form a complete aggregate signature; The second stage specifically includes: If the MeN is a leaf node type MeN: Generate a random number Calculate the initial cumulative value Send the calculation result to the parent node corresponding to the leaf node, where i∈{1,…,n}; If the MeN is a non-leaf node type MeN: Generate a random number Calculate the initial cumulative value L i ′=L i +L son ′, and send the calculation result to the parent node corresponding to the non-leaf node, where i∈{1,…,n}, L son ' is the message sent by the child node of the non-leaf node; If the node is a leader node LN: Generate a random number Calculate the initial cumulative value L0′=L0+L son1 ′+L son2 ′, where L son1 ′ and L son2 ' is the message received from the child node of the leader node; The third stage specifically includes: LN calculates the hash value c = H s (L0′||S), to MeN1,MeN2,…,MeN n Broadcast c, where "||" means concatenating two strings; The fourth stage specifically includes: If MeN is a leaf node type MeN: calculate the final cumulative value r i ′=r i = l i -cd i , send the calculation result to the parent node corresponding to the leaf node, where i∈{1,…,n}, d i is the private key of the leaf node; If MeN is a non-leaf node type MeN: calculate the final cumulative value r i = l i -cd i , r i ′=r i +r son ′, and send the calculation result to the parent node corresponding to the non-leaf node, where i∈{1,…,n}, d i is the private key of the non-leaf node, r son ′ is the message received from the child node of the non-leaf node; If the node is the leader node LN: calculate the final cumulative value r0 = l0-cd0, r0′ = r0+r son1 ′+r son2 ′, where r son1 ′ and r son2 ' is the message received from the child node of the leader node, and d0 is the private key of the leader node; Get the complete aggregate signature message (c, r0′).

2. The method according to claim 1, characterized in that The step 5 comprises: LN calculation And calculate c′=H s (L0″||S), where P i is the public key set of Group members, i∈{0,1,…,n}; Determine whether c′ is equal to c. If they are equal, the signature verification is successful, proving that the consensus committee has completed this consensus. LN generates a new block on the alliance chain it manages and writes the consensus request message S into the new block. Otherwise, the signature verification fails, proving that the consensus has failed, and the chain operation is not performed.

3. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, the method according to any one of claims 1 to 2 is implemented.

Images