CN114362996A - Dynamic cross-link message forwarding method and system - Google Patents
Dynamic cross-link message forwarding method and system Download PDFInfo
- Publication number
- CN114362996A CN114362996A CN202111454156.3A CN202111454156A CN114362996A CN 114362996 A CN114362996 A CN 114362996A CN 202111454156 A CN202111454156 A CN 202111454156A CN 114362996 A CN114362996 A CN 114362996A
- Authority
- CN
- China
- Prior art keywords
- message
- node
- nodes
- chain
- groups
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000002776 aggregation Effects 0.000 claims abstract description 50
- 238000004220 aggregation Methods 0.000 claims abstract description 50
- 230000000977 initiatory effect Effects 0.000 claims abstract description 17
- 230000008569 process Effects 0.000 claims description 9
- 230000004931 aggregating effect Effects 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 15
- 230000005540 biological transmission Effects 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 238000012795 verification Methods 0.000 description 5
- 230000002457 bidirectional effect Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 206010028980 Neoplasm Diseases 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 201000011510 cancer Diseases 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 230000036210 malignancy Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a dynamic cross-link message forwarding method and a dynamic cross-link message forwarding system, wherein each node of a message initiating link sends a cross-link message to a relay link node according to a corresponding relation of nodes between links; the relay link node verifies the correctness of the cross-link message and signs the verified message; the relay link nodes divide the groups based on the negotiated dynamic factors and establish the corresponding relation of the nodes among the groups to send messages; the relay link nodes carry out broadcast aggregation of the signatures of the nodes in the group, and when the number of the signatures reaches a set threshold, the broadcast aggregation of the signatures of the nodes between the groups is carried out until the total signature reaches a preset threshold; the relay link node sends a message carrying the aggregation signature reaching a preset threshold value to a node of a target link according to the inter-link node corresponding relation, and the node of the target link verifies the correctness of the message and the aggregation signature; the invention can ensure that the message is real, credible, not tampered and reliably transmitted; and the efficiency of verifying the message and aggregating the signature by the relay link node can be improved.
Description
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a dynamic cross-chain message forwarding method and system.
Background
The statements in this section merely provide background information related to the present disclosure and may not necessarily constitute prior art.
When messages are mutually transmitted between different block chains, if a mode of directly mutually broadcasting the messages among the block chains is adopted, the various chains need to be respectively modified to support the broadcast receiving and verification processing of the messages of the different chains. And the transformation of block chains of both sides of the cross-chain message can be reduced by forwarding the cross-chain message through the relay chain, the difficulty of realizing the transmission of the cross-chain message is reduced, the workload is reduced, and the ductility is improved.
Currently, a relay chain is used to forward a cross-link message, and part of the methods is to transmit the cross-link message through a small number of nodes of each chain. If the node failure or node malicious situation exists in the nodes participating in cross-link message propagation, potential safety hazards such as message tampering and interception can exist.
Disclosure of Invention
The invention aims to solve the safety problem and the efficiency problem of forwarding a cross-link message based on a relay chain, and provides a dynamic cross-link message forwarding method and a dynamic cross-link message forwarding system, wherein the invention constructs a corresponding relation of nodes between chains, and transmits the cross-link message according to the corresponding relation, so that all nodes of block chains of two parties participate in the transmission of the cross-link message, and the message is ensured to be real and credible, not to be tampered and reliably transmitted; and dynamically group-dividing the relay link nodes to improve the efficiency of the relay link nodes in verifying messages and aggregating signatures.
According to some embodiments, the invention adopts the following technical scheme:
a dynamic cross-link message forwarding method is executed by a node of a relay link, and comprises the following steps:
receiving a cross-link message sent by each node of a message initiating link according to the corresponding relation of nodes among the links;
verifying the correctness of the cross-chain message, and signing the verified message;
dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of sending messages by nodes among the groups;
performing broadcast aggregation of node signatures in the groups, and performing broadcast aggregation of node signatures among the groups when the number of signatures reaches a set threshold value until the total signature reaches a preset threshold value;
and sending the message carrying the aggregation signature reaching the preset threshold value to the node of the target chain according to the corresponding relation of the nodes among the chains, so that the message and the aggregation signature are verified to be correct.
A dynamic cross-chain message forwarding method comprises the following steps:
each node of the message initiating chain sends a cross-link message to the relay link node according to the corresponding relation of nodes among the chains;
the relay link node verifies the correctness of the cross-link message and signs the verified message;
the relay link nodes divide the groups based on the negotiated dynamic factors and establish the corresponding relation of the nodes among the groups to send messages;
the relay link nodes carry out broadcast aggregation of the signatures of the nodes in the group, and when the number of the signatures reaches a set threshold, the broadcast aggregation of the signatures of the nodes between the groups is carried out until the total signature reaches a preset threshold;
the relay link node sends a message carrying the aggregation signature reaching a preset threshold value to a node of a target link according to the inter-link node corresponding relation;
and verifying the correctness of the message and the aggregated signature by the node of the target chain, and completing forwarding of the cross-chain message after any node receives and verifies the message and the aggregated signature.
As an alternative implementation, the inter-chain node correspondence is constructed according to the principle of bidirectional minimum coverage, that is, each node of the message initiating chain at least needs to send a message to one node, each node of the receiving chain at least has one node to send a message to the node, and the number of receiving nodes corresponding to each sending chain link is as small as possible and balanced as possible.
As an alternative implementation, the dynamic factor negotiates a consistent random number for each node of the relay chain as the dynamic factor, and as a further limitation, takes a hash value of the cross-link message as the dynamic factor.
As an alternative embodiment, the specific process of grouping based on the negotiated dynamic factors includes:
determining the number of groups;
numbering the nodes based on the dynamic factors, and enabling the numbering of the nodes under different cross-link messages to be different;
and dividing the relay link nodes into a plurality of groups according to the numbers and the number of the groups in a surplus mode, and establishing the corresponding relation of the nodes among the groups.
As a further limitation, the number of the relay link nodes is squared and then rounded down to obtain an integer n as the number of the group.
As a further limitation, when numbering the nodes based on the dynamic factors, the node IDs and the hash values of the cross-link messages are combined to calculate hash values, and the nodes are sequentially numbered after being sorted according to the calculated hash value results.
As a further limitation, in the specific process of dividing the groups in a remainder manner, the groups are divided by taking the nodes with the same remainders after the node numbers and the group numbers are remainder as a group.
As an alternative implementation, the specific step of establishing the correspondence relationship between the messages sent by the nodes between the groups includes: and forming an ordered list by the nodes in the group according to the sequence of the ordered numbers from small to large, establishing a message sending corresponding relation between the node and the node with the same position as the node in the list in other groups, and establishing a message sending corresponding relation between the node with the last position in the list and the node with the position behind the node in other groups.
As an alternative embodiment, when the number of signatures reaches the set threshold, the specific process of performing broadcast aggregation of the inter-group node signatures includes:
and after the number of the signatures aggregated in the group by the relay link node is enough to the threshold value, the aggregation signature of the group is broadcasted to the corresponding nodes of other groups, and the nodes aggregate the signatures of other groups again after receiving the aggregation signatures of other groups.
A dynamic, cross-chain message forwarding system, comprising:
the message initiating chain comprises a plurality of block chain nodes and is used for sending the cross-chain message to the relay chain node according to the corresponding relation of the nodes among the chains;
the relay chain comprises a plurality of block chain nodes and is used for verifying the correctness of the cross-chain message and signing the verified message; dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of sending messages by nodes among the groups; performing broadcast aggregation of node signatures in the groups, and performing broadcast aggregation of node signatures among the groups when the number of signatures reaches a set threshold value until the total signature reaches a preset threshold value; according to the corresponding relation of the nodes between the chains, sending a message carrying the aggregation signature reaching a preset threshold value to the node of the target chain;
and the target chain comprises a plurality of block chain nodes and is used for receiving the cross-chain message with the aggregation signature sent by the relay chain nodes and verifying the correctness of the message and the aggregation signature.
Compared with the prior art, the invention has the beneficial effects that:
the invention ensures that all nodes of the block chains of both sides of the message cross-chain transmission participate in the transmission of the cross-chain message, prevents malicious tampering interception of the message caused by the malignancy or failure of part of the nodes in the process of transmitting the cross-chain message, and ensures the safety and the non-tampering of the message.
When the relay link performs message consensus verification and signature aggregation, the invention reduces the communication complexity of node message broadcasting in the relay link, reduces the communication traffic, improves the broadcast communication efficiency, reduces the resource loss and improves the relay link performance by dynamically dividing the groups to perform signature aggregation. The dynamic property of group division can prevent the security risk brought by group fixation and prevent malicious control of the group from doing harm.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the invention and together with the description serve to explain the invention and not to limit the invention.
FIG. 1 is a schematic diagram of a dynamic cross-chain message forwarding system according to at least one embodiment of the present disclosure;
fig. 2 is a schematic diagram illustrating a correspondence relationship between messages sent by inter-link nodes according to at least one embodiment of the present disclosure;
FIG. 3 is a diagram illustrating a dynamic cross-chain message forwarding flow in accordance with at least one embodiment of the present disclosure;
fig. 4 is a schematic diagram of relay chain group division according to at least one embodiment of the present disclosure;
FIG. 5 is a schematic diagram illustrating the group division of FIG. 4 establishing the correspondence between nodes in the group;
fig. 6 is a schematic diagram of broadcast signatures of the correspondence relationship between the nodes between the groups established in fig. 5.
The specific implementation mode is as follows:
the invention is further described with reference to the following figures and examples.
It is to be understood that the following detailed description is exemplary and is intended to provide further explanation of the invention as claimed. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments according to the invention. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
The invention provides a dynamic cross-link message forwarding method and system.
A dynamic, cross-chain message forwarding system, comprising:
the message initiating chain comprises a plurality of block chain nodes and is used for sending the cross-chain message to the relay chain node according to the corresponding relation of the nodes among the chains;
the relay chain comprises a plurality of block chain nodes and is used for verifying the correctness of the cross-chain message and signing the verified message; dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of sending messages by nodes among the groups; performing broadcast aggregation of node signatures in the groups, and performing broadcast aggregation of node signatures among the groups when the number of signatures reaches a set threshold value until the total signature reaches a preset threshold value; according to the corresponding relation of the nodes between the chains, sending a message carrying the aggregation signature reaching a preset threshold value to the node of the target chain;
and the target chain comprises a plurality of block chain nodes and is used for receiving the cross-chain message with the aggregation signature sent by the relay chain nodes and verifying the correctness of the message and the aggregation signature.
A dynamic cross-chain message forwarding method constructs a corresponding relation of nodes between chains according to a bidirectional minimum coverage principle, transmits cross-chain messages according to the corresponding relation, and enables all nodes of block chains of two parties to participate in the transmission of the cross-chain messages, so that the messages are guaranteed to be real, credible, not to be tampered and reliably transmitted. And dynamically group-dividing the relay link nodes to improve the efficiency of the relay link nodes in verifying messages and aggregating signatures.
When the relay chain carries out message consensus verification, the nodes which reach the threshold number are required to verify and sign, and then the signatures are aggregated to ensure the safety and credibility of the messages.
The invention constructs the corresponding relation of nodes between chains by the principle of bidirectional minimum coverage, namely, each node of a message initiating chain at least sends a message to one node, each node of a receiving chain at least sends a message to the node, and the number of the receiving nodes corresponding to each sending chain link is as small as possible and balanced as possible. All nodes of the block chains of the two parties are ensured to participate in the transmission of the cross-chain message, so that the safety of the cross-chain message is ensured, the malicious interception and modification of the message caused by node failure or node malice are prevented, and the safety and the non-tamper property of the message are ensured.
In some embodiments, the method for establishing the inter-chain node correspondence relationship satisfying the bidirectional minimum coverage principle is to sort and number each node of the block chains of both sides, and the nodes establish the inter-node correspondence relationship in a remainder manner according to the serial numbers of both sides and the number of the nodes. The number of nodes of a message sender is S, the number of nodes of a message receiver is R, and when S is less than R, the serial number k of a receiver node corresponding to the sender node with the serial number i should meet the condition that k% of S is equal to i; when S is larger than R, the serial number k of the receiving side node corresponding to the sending side node with the serial number i meets the condition that i% R is equal to k.
The invention provides a method for broadcasting and aggregating node message signatures based on a dynamic group division mode, which is used for dividing nodes into a plurality of groups according to the dynamic group division mode and establishing a corresponding relation of nodes sending messages among different groups when a relay chain performs consensus verification and aggregates signatures. Each node firstly carries out broadcast aggregation of the signatures of the nodes in the group, after the aggregated signatures in the node group reach a threshold value, the aggregated signatures of the group are broadcasted to other group nodes corresponding to the node, and the signatures of the groups are aggregated to obtain the aggregated signatures of which the relay chain reaches the threshold value.
The dynamic grouping method means that the corresponding relationship between the divided groups and the nodes between the groups is reconstructed along with the different messages to be identified and verified. For each message to be identified and verified, each node negotiates a consistent random number as a dynamic factor, groups are divided based on the dynamic factor, and a corresponding relation of node message sending among the groups is established.
In some embodiments, in order to reduce the process of negotiating the dynamic factors by each node and improve the efficiency and security of group division, the dynamic factors are divided into groups by using message hash values.
Dividing groups based on the dynamic factors, establishing a corresponding relation of node message sending among the groups, in some embodiments, squaring the number of relay link nodes to serve as a group number G, combining the dynamic factors and node IDs to obtain hash values, sorting and numbering the nodes according to the size of the hash values obtained by the nodes, dividing the groups according to the sorting number and the group number, wherein the node numbers of the two nodes are a and b, and if the condition that a% G is b% G is met, the two nodes are divided into the same group. And after the group division is finished, establishing a corresponding relation of sending the node messages among the groups according to the sequence positions of the node numbers in the groups.
The following describes the specific implementation scheme of the present invention in detail with specific embodiments:
the first embodiment is as follows:
a dynamic cross-link message forwarding system, as shown in fig. 1, includes a message origination link, a relay link, and a message destination link.
The message initiation chain is the initiator of the cross-chain message and comprises a plurality of blockchain nodes. And the message initiating chain node is responsible for sending the cross-chain message to the relay chain node in the corresponding relation of the inter-chain nodes.
The relay chain is a transfer party of the cross-chain message and comprises a plurality of block chain nodes. The relay chain node is responsible for receiving the cross-chain message of the initiating chain node, verifying the correctness of the cross-chain message, signing the cross-chain message, and broadcasting and aggregating the signatures in a dynamic group division mode after signing. And after the signature number of the node aggregation reaches a threshold value, sending the aggregated signature and the message to a node corresponding to a target chain according to the corresponding relation of the inter-chain nodes during inter-chain message transmission.
The message target chain is a cross-chain message final receiver and comprises a plurality of blockchain nodes. And the node of the message target chain receives the cross-chain message with the aggregation signature sent by the relay chain node and verifies the message.
The inter-link node correspondence relationship during inter-link message transmission refers to a relationship in which a node of a message sender sends a message to nodes of a message receiver. Optionally, the nodes of both parties are numbered from 0, and the inter-chain node correspondence relationship is established according to the node number and the node number surplus mode.
In this embodiment, the nodes are numbered, sorted by node ID and marked with serial numbers starting from 0 in order.
In this embodiment, a corresponding relationship is established according to the node number and the node number remainder: namely, the number of nodes of a message sender is set as S, the number of nodes of a message receiver is set as R, and when S is less than R, the serial number k of the receiver node corresponding to the sender node with the serial number i should meet the condition that k% of S is equal to i; when S is larger than R, the serial number k of the receiving side node corresponding to the sending side node with the serial number i meets the condition that i% R is equal to k.
Fig. 2 is a generation example of a correspondence relationship between messages sent by inter-chain nodes. In the example, the sender has 4 nodes, the receiver has 7 nodes, the node of the sender is SNode _ i, i represents the serial number of the node after sequencing, the node of the receiver is MNode _ k, and k represents the serial number of the node after sequencing. As shown in the figure, after nodes of the message sender and the message receiver are sorted, since the serial number k of the receiver node corresponding to the sender node with serial number 0 needs to satisfy the conditions that k% 4 is 0 and k <7, the receiver nodes corresponding to SNode _0 are MNode _0 and MNode _ 4.
Example two:
a dynamic cross-chain message forwarding method, as shown in fig. 3, includes:
step 301: each node of the message initiating chain sends a cross-chain message to the relay chain node. And each node of the message initiating chain selects the relay chain node to send the cross-chain message according to the corresponding relation of the nodes between the chains when the messages are transmitted between the chains.
Step 302: and the relay link nodes receive the chain-crossing message from the initiating chain, verify the message and sign the message after the verification is passed.
Step 303: each node of the relay chain negotiates a consistent random number as a dynamic factor, groups are divided based on the dynamic factor, and a corresponding relation of sending messages by the nodes among the groups is established.
Each node negotiates a consistent random number as a dynamic factor.
In some embodiments, the cross-chain message hash value is used directly as the dynamic factor.
The groups are divided based on the dynamic factors, and the corresponding relation of nodes among the groups is established. In this embodiment, steps 3031, 3032, and 3033 are included:
step 3031: and determining the number of groups. In this embodiment, the number of relay link nodes is squared and then rounded down to obtain an integer n as the number of groups.
Step 3032: and numbering the nodes based on the dynamic factors, so that the numbering of the nodes under different cross-link messages is different. In this embodiment, the node ID and the hash value of the cross-link message are combined to calculate a hash value, and the node ID and the hash value are sorted according to the calculated hash value result and numbered from 0.
Step 3033: and dividing the relay link nodes into a plurality of groups according to the numbers and the number of the groups in a surplus mode, and establishing the corresponding relation of the nodes among the groups.
And dividing the relay link nodes into a plurality of groups according to the sorted numbers and the number of the groups in a remainder mode, and establishing the corresponding relation of the nodes among the groups.
In this embodiment, the groups are divided by taking the nodes with the same remainder after the node number and the group number are taken as one group.
And establishing a corresponding relation of nodes among the groups, forming an ordered list by the nodes in the groups according to the sequence of the sequence numbers from small to large, establishing a corresponding relation of a message to be sent between the node and the node with the same position as the node in the list in other groups, and establishing a corresponding relation of the message to be sent between the node with the last position in the list and the node with the position behind the node in other groups.
Fig. 4 is an example of dividing a relay link group, where a relay link node is MNode _ l, and l is a number of the relay link node after being sorted according to a dynamic factor. As shown in fig. 4, the relay link count is 7, and the group count is rounded up by the square-down of the group count to obtain the group counts 2, MNode _0, MNode _2, MNode _4, and MNode _6, and the remainder of 2 is 0, so these nodes form a group.
Fig. 5 is an example of establishing the node correspondence relationship between the groups divided in fig. 4. And establishing a message sending corresponding relation among the nodes with the same position in the respective group lists. The last node MNode _5 in the relay link group 2 list has a position of 2 in the list, so MNode _5 also needs to establish a message sending correspondence relationship with the node MNode _6 having a position of 3 in the group 1.
Step 304: and the relay link node performs broadcast aggregation of the node signatures in the group. Each node broadcasts the signature of the node to the nodes in the same group, and the nodes aggregate after receiving the signature.
Step 305: the relay nodes perform broadcast aggregation of the inter-group signatures. And after the number of the signatures aggregated in the group by the node is enough to the threshold value, broadcasting the aggregated signatures of the group to the corresponding nodes of other groups. And after receiving the aggregation signatures of other groups, the nodes perform aggregation again. Fig. 6 is an exemplary diagram of relay link nodes broadcasting signatures according to the correspondence of the inter-group nodes established in fig. 5.
Step 306: and after the aggregated signature of the relay link nodes reaches the threshold, selecting the nodes of the message target chain according to the corresponding relation of the inter-link nodes transmitted by the inter-link messages, and sending the message carrying the aggregated signature reaching the threshold.
Step 307: and the message target link node receives the message sent by the relay link node, verifies the correctness of the message and the aggregation signature, and completes the forwarding of the cross-link message after any node receives and verifies the message and the aggregation signature.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although the embodiments of the present invention have been described with reference to the accompanying drawings, it is not intended to limit the scope of the present invention, and it should be understood by those skilled in the art that various modifications and variations can be made without inventive efforts by those skilled in the art based on the technical solution of the present invention.
Claims (10)
1. A dynamic cross-link message forwarding method is characterized in that: the method comprises the following steps:
receiving a cross-link message sent by each node of a message initiating link according to the corresponding relation of nodes among the links;
verifying the correctness of the cross-chain message, and signing the verified message;
dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of sending messages by nodes among the groups;
performing broadcast aggregation of node signatures in the groups, and performing broadcast aggregation of node signatures among the groups when the number of signatures reaches a set threshold value until the total signature reaches a preset threshold value;
and sending the message carrying the aggregation signature reaching the preset threshold value to the node of the target chain according to the corresponding relation of the nodes among the chains, so that the message and the aggregation signature are verified to be correct.
2. A dynamic cross-link message forwarding method is characterized in that: the method comprises the following steps:
each node of the message initiating chain sends a cross-link message to the relay link node according to the corresponding relation of nodes among the chains;
the relay link node verifies the correctness of the cross-link message and signs the verified message;
the relay link nodes divide the groups based on the negotiated dynamic factors and establish the corresponding relation of the nodes among the groups to send messages;
the relay link nodes carry out broadcast aggregation of the signatures of the nodes in the group, and when the number of the signatures reaches a set threshold, the broadcast aggregation of the signatures of the nodes between the groups is carried out until the total signature reaches a preset threshold;
the relay link node sends a message carrying the aggregation signature reaching a preset threshold value to a node of a target link according to the inter-link node corresponding relation;
and verifying the correctness of the message and the aggregated signature by the node of the target chain, and completing forwarding of the cross-chain message after any node receives and verifies the message and the aggregated signature.
3. A dynamic, cross-chain message forwarding method as claimed in claim 1 or 2, wherein: the inter-chain node correspondence is constructed in a two-way minimum coverage principle, that is, each node of the message initiating chain at least needs to send a message to one node, and each node of the receiving chain at least has one node to send a message to the node.
4. A dynamic, cross-chain message forwarding method as claimed in claim 1 or 2, wherein: the dynamic factors are the dynamic factors obtained by negotiating a consistent random number for each node of the relay chain, or directly using a message hash value as the dynamic factors.
5. A dynamic, cross-chain message forwarding method as claimed in claim 1 or 2, wherein: the specific process of grouping based on the dynamic factors of negotiation comprises the following steps:
determining the number of groups;
numbering the nodes based on the dynamic factors, and enabling the numbering of the nodes under different cross-link messages to be different;
and dividing the relay link nodes into a plurality of groups according to the numbers and the number of the groups in a surplus mode, and establishing the corresponding relation of the nodes among the groups.
6. The dynamic cross-link message forwarding method of claim 5, wherein: and after the number of the relay chain nodes is squared, rounding is performed downwards to obtain an integer n as the number of the groups.
7. The dynamic cross-link message forwarding method of claim 5, wherein: when the nodes are numbered based on the dynamic factors, the node IDs and the hash values of the cross-link messages are combined to calculate the hash values, and the nodes are sequentially numbered after being sorted according to the calculated hash value results;
or, in the specific process of dividing the groups according to the remainder mode, dividing the groups according to the nodes with the same remainder after the node number and the group number are remainder as a group.
8. A dynamic, cross-chain message forwarding method as claimed in claim 1 or 2, wherein: the specific steps of establishing the corresponding relationship of the messages sent by the nodes among the groups comprise: and forming an ordered list by the nodes in the group according to the sequence of the ordered numbers from small to large, establishing a message sending corresponding relation between the node and the node with the same position as the node in the list in other groups, and establishing a message sending corresponding relation between the node with the last position in the list and the node with the position behind the node in other groups.
9. A dynamic, cross-chain message forwarding method as claimed in claim 1 or 2, wherein: when the number of signatures reaches a set threshold, the specific process of performing broadcast aggregation of the node signatures among the groups includes:
and after the number of the signatures aggregated in the group by the relay link node is enough to the threshold value, the aggregation signature of the group is broadcasted to the corresponding nodes of other groups, and the nodes aggregate the signatures of other groups again after receiving the aggregation signatures of other groups.
10. A dynamic cross-chain message forwarding system is characterized in that: the method comprises the following steps:
the message initiating chain comprises a plurality of block chain nodes and is used for sending the cross-chain message to the relay chain node according to the corresponding relation of the nodes among the chains;
the relay chain comprises a plurality of block chain nodes and is used for verifying the correctness of the cross-chain message and signing the verified message; dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of sending messages by nodes among the groups; performing broadcast aggregation of node signatures in the groups, and performing broadcast aggregation of node signatures among the groups when the number of signatures reaches a set threshold value until the total signature reaches a preset threshold value; according to the corresponding relation of the nodes between the chains, sending a message carrying the aggregation signature reaching a preset threshold value to the node of the target chain;
and the target chain comprises a plurality of block chain nodes and is used for receiving the cross-chain message with the aggregation signature sent by the relay chain nodes and verifying the correctness of the message and the aggregation signature.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111454156.3A CN114362996B (en) | 2021-12-01 | 2021-12-01 | Dynamic cross-link message forwarding method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111454156.3A CN114362996B (en) | 2021-12-01 | 2021-12-01 | Dynamic cross-link message forwarding method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114362996A true CN114362996A (en) | 2022-04-15 |
| CN114362996B CN114362996B (en) | 2024-03-19 |
Family
ID=81097662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111454156.3A Active CN114362996B (en) | 2021-12-01 | 2021-12-01 | Dynamic cross-link message forwarding method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114362996B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200210451A1 (en) * | 2019-01-02 | 2020-07-02 | Jiaping Wang | Scale out blockchain with asynchronized consensus zones |
| CN112418860A (en) * | 2020-12-07 | 2021-02-26 | 苏州科技大学 | Block chain efficient management framework based on cross-chain technology and working method |
| CN112583598A (en) * | 2020-11-10 | 2021-03-30 | 周口师范学院 | Complex Internet of things alliance chain system communication mechanism |
| CN113328997A (en) * | 2021-05-10 | 2021-08-31 | 东软集团股份有限公司 | Alliance chain cross-chain system and method |
-
2021
- 2021-12-01 CN CN202111454156.3A patent/CN114362996B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200210451A1 (en) * | 2019-01-02 | 2020-07-02 | Jiaping Wang | Scale out blockchain with asynchronized consensus zones |
| CN112583598A (en) * | 2020-11-10 | 2021-03-30 | 周口师范学院 | Complex Internet of things alliance chain system communication mechanism |
| CN112418860A (en) * | 2020-12-07 | 2021-02-26 | 苏州科技大学 | Block chain efficient management framework based on cross-chain technology and working method |
| CN113328997A (en) * | 2021-05-10 | 2021-08-31 | 东软集团股份有限公司 | Alliance chain cross-chain system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114362996B (en) | 2024-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110474846B (en) | Method and device for block propagation in block chain | |
| CN108269090B (en) | Consensus method and device for block chain system based on non-negotiation random drawing | |
| US10862959B2 (en) | Consensus system and method for adding data to a blockchain | |
| CN101743716B (en) | Establishment of reliable multicast/broadcast in a wireless network | |
| CN109711192B (en) | Method and system for inter-node transaction of block chain system | |
| CN110855792B (en) | Message pushing method, device, equipment and medium | |
| RU2014108873A (en) | ASSOCIATION BASED ON THE LEVEL OF RELAXATION IN COMMUNICATIONS NETWORKS | |
| CN111899002A (en) | Method for efficiently performing cross-chain information transaction interaction in block chain | |
| CN109584595B (en) | Road condition early warning method and system based on block chain in vehicle-mounted network | |
| CN113114472A (en) | Authentication method and system based on message hash chain | |
| Nowatkowski et al. | Certificate revocation list distribution in VANETs using most pieces broadcast | |
| CN106793135A (en) | Communication resource dispatching method, terminal device and base station equipment | |
| CN110535558A (en) | A kind of data transmission method, device and storage medium | |
| CN111464632B (en) | Block chain cross-chain forwarding method and block chain link point | |
| CN113328919B (en) | CAN bus identifier, communication method and communication system | |
| CN114697279A (en) | Method for transmitting data files by multi-channel sub-packets | |
| CN114362996A (en) | Dynamic cross-link message forwarding method and system | |
| CN103841047A (en) | Link aggregation method and device | |
| CN106130695A (en) | A kind of data transmission method and system | |
| CN110324421B (en) | Information processing method and block chain node equipment | |
| CN104798388B (en) | Feedback method, sending node and the receiving node of data packet reception state | |
| CN112398934B (en) | Trusting broadcasting method based on block chain | |
| CN114338699B (en) | Block chain communication method and system based on dynamic strategy | |
| CN113162759A (en) | Safety data sharing calculation method and system based on malicious MASCOT protocol | |
| CN103944696B (en) | The receiving handling method and device of a kind of Temporary Block Flow |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |