CN114362996B - Dynamic cross-link message forwarding method and system - Google Patents
Dynamic cross-link message forwarding method and system Download PDFInfo
- Publication number
- CN114362996B CN114362996B CN202111454156.3A CN202111454156A CN114362996B CN 114362996 B CN114362996 B CN 114362996B CN 202111454156 A CN202111454156 A CN 202111454156A CN 114362996 B CN114362996 B CN 114362996B
- Authority
- CN
- China
- Prior art keywords
- nodes
- node
- message
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000002776 aggregation Effects 0.000 claims abstract description 25
- 238000004220 aggregation Methods 0.000 claims abstract description 25
- 230000000977 initiatory effect Effects 0.000 claims abstract description 20
- 230000004931 aggregating effect Effects 0.000 claims abstract description 4
- 230000008569 process Effects 0.000 claims description 10
- 230000002457 bidirectional effect Effects 0.000 claims description 7
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 13
- 230000005540 biological transmission Effects 0.000 description 12
- 238000012795 verification Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 206010061619 Deformity Diseases 0.000 description 3
- 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
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Abstract
The invention provides a dynamic cross-link message forwarding method and a system, wherein each node of a message initiating chain sends a cross-link message to a relay chain node according to the corresponding relation of the nodes between the links; the relay link node verifies the correctness of the cross-link message and signs the verified message; the relay chain nodes divide groups based on the negotiated dynamic factors, and a corresponding relation of the nodes between the groups for sending messages is established; the relay chain node performs broadcast aggregation of the node signatures in the group, and when the number of the signatures reaches a set threshold, the relay chain node performs broadcast aggregation of the node signatures among the groups until the total signature reaches a preset threshold; the relay chain node sends a message carrying an aggregate signature reaching a preset threshold to a node of a target chain according to the corresponding relation of the nodes among the chains, and the node of the target chain verifies the correctness of the message and the aggregate signature; the invention can ensure that the true and reliable message is not tampered and is reliably transmitted; and the efficiency of verifying the message and aggregating the signature by the relay link point can be improved.
Description
Technical Field
The invention belongs to the technical field of blockchain, 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 the different blockchains communicate messages with each other, if a mode of directly broadcasting the messages with each other is adopted, each chain needs to be respectively modified to support the broadcast receiving and verification processing of the messages of the different chains. And the relay chain is used for forwarding the cross-link message, so that the transformation of block chains of both sides of the cross-link message can be reduced, the difficulty in realizing the cross-link message transmission is reduced, the workload is reduced, and the ductility is improved.
At present, the cross-link message is forwarded through a relay link, and part of the method is to transmit the cross-link message through a small part of nodes of each link. If a node fault or node disfigurement exists in the nodes participating in the transmission of the cross-link message, potential safety hazards such as tampering and interception of the message may exist.
Disclosure of Invention
The invention provides a dynamic cross-link message forwarding method and a system for solving the safety problem and the efficiency problem of forwarding the cross-link message based on a relay link; and dynamically group-dividing the relay chain nodes to improve the efficiency of the relay chain nodes to verify messages and aggregate signatures.
According to some embodiments, the present invention employs the following technical solutions:
a dynamic cross-link message forwarding method, performed by a node of a relay link, comprising the steps of:
receiving a cross-link message sent by each node of a message initiating chain according to the corresponding relation of the nodes between the chains;
verifying the correctness of the cross-link message, and signing the verified message;
dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of the nodes between the groups for sending messages;
performing broadcast aggregation of node signatures inside the group, and performing broadcast aggregation of node signatures among the groups when the number of the signatures reaches a set threshold value until the total signature reaches a preset threshold value;
and sending the message carrying the aggregate signature reaching a preset threshold to the node of the target chain according to the corresponding relation of the nodes between the chains, so that the correctness of the message and the aggregate signature is verified.
A dynamic cross-link message forwarding method comprising the steps of:
each node of the message initiating chain sends a cross-link message to the relay chain node according to the corresponding relation of the nodes between the links;
the relay link node verifies the correctness of the cross-link message and signs the verified message;
the relay chain nodes divide groups based on the negotiated dynamic factors, and a corresponding relation of the nodes between the groups for sending messages is established;
the relay chain node performs broadcast aggregation of the node signatures in the group, and when the number of the signatures reaches a set threshold, the relay chain node performs broadcast aggregation of the node signatures among the groups until the total signature reaches a preset threshold;
the relay chain node sends a message carrying an aggregate signature reaching a preset threshold to a node of a target chain according to the corresponding relation of the inter-chain nodes;
and after any node receives and passes the verification, the forwarding of the cross-link message is completed.
As an alternative implementation manner, the corresponding relation of the nodes between the chains is constructed by a bidirectional minimum coverage principle, namely, each node of the message initiating chain at least needs to send a message to one node, at least one node of the receiving chain sends the message to the node, and the number of receiving nodes corresponding to each sending chain link point is as small as possible and balanced as possible.
As an alternative implementation manner, the dynamic factor negotiates a consistent random number for each node of the relay chain as the dynamic factor, and as a further limitation, the hash value of the cross-chain message is taken as the dynamic factor.
As an alternative embodiment, the specific process of grouping groups based on negotiated dynamic factors includes:
determining the number of groups;
based on the dynamic factors, numbering the nodes, so that the numbers of the nodes under different cross-link messages are different;
and dividing the relay chain nodes into a plurality of groups according to the numbers and the group numbers in a redundant mode, and establishing the corresponding relation of the nodes among the groups.
As a further limitation, the number of relay chain nodes is divided by square and then is rounded down to obtain an integer n as the number of groups.
As a further limitation, when numbering the nodes based on the dynamic factor, the hash values of the node ID and the cross-link message are combined and then the hash values are calculated, and the nodes are sequentially numbered after being ordered according to the calculated hash value results.
As a further limitation, in the concrete process of dividing the groups by the remainder, the groups are divided by taking the nodes having the same remainder as the remainder as a group according to the node number and the number of groups.
As an alternative embodiment, the specific step of establishing a correspondence between the group nodes sending messages includes: and forming an ordered list of the nodes in the group according to the sequence of the sequence numbers from small to large, and establishing a corresponding relation of the messages to be sent between the nodes and the nodes with the same position in the list as the nodes in other groups, wherein the nodes with the last position in the list simultaneously establish the corresponding relation of the messages to be sent with the nodes which are more rear than the nodes in other groups.
Alternatively, when the number of signatures reaches a set threshold, the specific process of broadcast aggregation of the inter-group node signatures includes:
after the number of the aggregated signatures in the group is enough to threshold, the relay chain node broadcasts the aggregated signatures of the group to the corresponding nodes of other groups, and the nodes receive the aggregated signatures of the other groups and aggregate again.
A dynamic cross-chain message forwarding system comprising:
the message initiating chain comprises a plurality of block chain nodes and is used for sending a cross-chain message to the relay chain nodes according to the corresponding relation of the nodes between the chains;
the relay chain comprises a plurality of blockchain 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 the nodes between the groups for sending messages; performing broadcast aggregation of node signatures inside the group, and performing broadcast aggregation of node signatures among the groups when the number of the 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 an aggregate signature reaching a preset threshold to the node of the target chain;
the target chain comprises a plurality of blockchain nodes and is used for receiving a cross-chain message with an aggregate signature sent by the relay chain node and verifying the correctness of the message and the aggregate signature.
Compared with the prior art, the invention has the beneficial effects that:
according to the invention, all nodes of the block chains of both sides of the cross-chain transmission of the message participate in the transmission of the cross-chain message, so that malicious tampering interception of the message caused by the disfigurement or faults of part of the nodes in the transmission process of the cross-chain message is prevented, and the safety and the non-tamper property of the message are ensured.
When the relay chain performs message consensus verification and signature aggregation, the method reduces the communication complexity of node message broadcasting in the relay chain, reduces the communication traffic, improves the broadcasting communication efficiency, reduces the resource loss and improves the performance of the relay chain by dynamically dividing groups to perform signature aggregation. The dynamic performance of group division can prevent the security risk brought by group fixation and prevent malicious control groups from being wrongly controlled.
In order to make the above objects, features and advantages of the present invention more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention.
FIG. 1 is a schematic diagram of a dynamic cross-chain message forwarding system architecture in accordance with at least one embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating a message correspondence generation for inter-chain nodes according to at least one embodiment of the present invention;
FIG. 3 is a schematic diagram of a dynamic cross-link message forwarding flow in accordance with at least one embodiment of the present invention;
fig. 4 is a schematic diagram illustrating a relay chain group division according to at least one embodiment of the present invention;
FIG. 5 is a schematic diagram illustrating the establishment of a node correspondence between groups of the partition of FIG. 4;
fig. 6 is a schematic diagram of a broadcast signature of the correspondence relationship between the nodes in the group established in fig. 5.
The specific embodiment is as follows:
the invention will be further described with reference to the drawings and examples.
It should be noted that the following detailed description is illustrative and is intended to provide further explanation of the invention. 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 present invention. As used herein, the singular is also intended to include the plural unless the context clearly indicates otherwise, and furthermore, it is to be understood that the terms "comprises" and/or "comprising" when used in this specification are taken to specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.
The invention provides a dynamic cross-link message forwarding method and a 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 a cross-chain message to the relay chain nodes according to the corresponding relation of the nodes between the chains;
the relay chain comprises a plurality of blockchain 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 the nodes between the groups for sending messages; performing broadcast aggregation of node signatures inside the group, and performing broadcast aggregation of node signatures among the groups when the number of the 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 an aggregate signature reaching a preset threshold to the node of the target chain;
the target chain comprises a plurality of blockchain nodes and is used for receiving a cross-chain message with an aggregate signature sent by the relay chain node and verifying the correctness of the message and the aggregate signature.
A dynamic cross-link message forwarding method constructs node corresponding relation between links according to a bidirectional minimum coverage principle, and transmits the cross-link message according to the corresponding relation, so that all nodes of block chains of both sides participate in the transmission of the cross-link message, and the true and reliable message transmission is ensured. And dynamically group-dividing the relay chain nodes to improve the efficiency of the relay chain nodes to verify messages and aggregate signatures.
When the relay chain performs message consensus verification, the nodes with the threshold number are required to be verified and signed, and then the signatures are aggregated to ensure the safety and reliability of the message.
The invention constructs the node corresponding relation among chains by the principle of bidirectional minimum coverage, namely, each node of the message initiating chain at least needs to send a message to one node, at least one node of the receiving chain sends a message to the node, and the number of the receiving nodes corresponding to each sending chain link point is as small as possible and balanced as possible. All nodes of the block chains of both sides are guaranteed to participate in the transmission of the cross-chain message, so that the safety of the cross-chain message is guaranteed, malicious interception and modification of the message caused by node faults or node disfigurement are prevented, and the safety and the non-tamper property of the message are guaranteed.
In some embodiments, the method for establishing the correspondence between nodes in the chain meets the principle of bidirectional minimum coverage, numbers the nodes in the block chains of both sides after ordering, and establishes the correspondence between the nodes in a redundant manner according to the order 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 < R, the number k of the nodes of the receiver corresponding to the sender node with the sequence number i should meet the condition that k% S=i; when S > R, the receiver node sequence number k corresponding to the sender node with sequence number i satisfies the condition i% r=k.
The invention provides a method for broadcasting and aggregating node message signatures based on dynamic group division, which is characterized in that when a relay chain performs consensus verification and aggregates signatures, nodes are divided into a plurality of groups according to the method of dynamic group division, and corresponding relations of the nodes among different groups for sending messages are established. And each node firstly performs broadcast aggregation of the node signatures in the group, and after the aggregated signature in the node group reaches a threshold value, the node broadcasts the aggregated signature of the group to other group nodes corresponding to the node, and the signatures of the groups are aggregated to obtain the aggregated signature of which the relay chain reaches the threshold value.
The dynamic grouping mode refers to that the grouping and the node corresponding relation among the groups are reconstructed according to different information 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 transmission among the groups is established.
In some embodiments, in order to reduce the process of negotiating the dynamic factor by each node, and improve the efficiency and security of group division, a message hash value is used as the dynamic factor of each group division.
Dividing groups based on the dynamic factors, establishing node message sending corresponding relation among the groups, in some embodiments, taking the square of the number of relay chain nodes as the group number G, combining the dynamic factors and the node IDs, obtaining hash values, sorting and numbering the nodes according to the hash values obtained by the nodes, dividing the groups according to the sorting numbers and the rest of the group numbers, wherein the node numbers of the two nodes are respectively a and b, and dividing the two nodes into the same group if the condition a% G=b% G is met. After the group division is completed, the corresponding relation of node message transmission among groups is established according to the sequence positions of the node numbers in the groups.
The following describes in detail the specific implementation of the present invention with specific embodiments:
embodiment one:
a dynamic cross-link message forwarding system, as shown in fig. 1, comprises a message initiating link, a relay link and a message target link.
The message initiating chain is the initiator of the cross-chain message and comprises a plurality of blockchain nodes. The message initiating chain node is responsible for sending the cross-chain message to the relay chain node in the corresponding relationship of the inter-chain nodes.
The relay chain is a relay of the cross-chain message and comprises a plurality of blockchain 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 mode of dynamically dividing groups after signing. And after the number of the signatures aggregated by the nodes reaches a threshold value, the aggregated signatures and the messages are sent to the nodes corresponding to the target chains according to the corresponding relationship of the nodes among the links during the transmission of the messages among the links.
The message target chain is the end recipient of the cross-chain message and comprises a plurality of blockchain nodes. And the node of the message target chain receives the cross-chain message with the aggregated signature sent by the relay chain node, and verifies the message.
Inter-link node correspondence in inter-link message transfer refers to the relationship of which nodes of a message sender send messages to which nodes of a message receiver. Optionally, the nodes of the two parties are respectively numbered from 0, and the corresponding relation of the nodes among the chains is established according to the node numbers and the node number surplus mode.
In this embodiment, the nodes are numbered, ordered by node ID and the sequence numbers are marked starting from 0 according to the order.
In this embodiment, the corresponding relationship is established according to the mode of 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 < R, the number k of the nodes of the receiver corresponding to the sender with the sequence number i should meet the condition that k% S=i; when S > R, the receiver node sequence number k corresponding to the sender node with sequence number i satisfies the condition i% r=k.
Fig. 2 is an example of generation of a message correspondence for 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 number after node sequencing, the node of the receiver is Mnode_k, and k represents the number after node sequencing. As shown in the figure, after the nodes of the message sender and the receiver are ordered, the receiver node number k corresponding to the sender node with the sequence number 0 needs to satisfy the condition k% 4=0 and k <7, so the receiver nodes corresponding to snode_0 are mnode_0 and mnode_4.
Embodiment two:
a dynamic cross-chain message forwarding method, as shown in fig. 3, includes:
step 301: each node of the message initiation chain sends a cross-chain message to the relay chain node. And each node of the message initiating chain selects a relay chain node to send a cross-chain message according to the corresponding relationship of the inter-chain nodes when the message is transmitted between the chains.
Step 302: the relay link point receives the cross-link message from the initiating chain, performs message verification, and performs message signature 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 the nodes among the groups for sending messages is established.
Each node negotiates a consistent random number as a dynamic factor.
In some embodiments, the cross-chain message hash value is directly used as a dynamic factor.
The groups are divided based on the dynamic factors, and the corresponding relation of the nodes among the groups is established. In this embodiment, steps 3031, 3032, 3033 are included:
step 3031: the number of groups is determined. In this embodiment, the number of relay chain nodes is divided by square 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 numbers of the nodes under different cross-link messages are different. In this embodiment, the node ID and the hash value of the cross-link message are combined, then the hash value is calculated, and the number is counted from 0 after sorting according to the calculated hash value result.
Step 3033: and dividing the relay chain nodes into a plurality of groups according to the numbers and the group numbers in a redundant mode, and establishing the corresponding relation of the nodes among the groups.
And dividing the relay chain nodes into a plurality of groups according to the ordered numbers and the group numbers in a redundant mode, and establishing a corresponding relation of the nodes among the groups.
In the present embodiment, groups are divided by taking nodes having the same remainder after the remainder as a group according to the node number and the group number.
And establishing a corresponding relation of nodes among the groups, forming an ordered list of the nodes in the groups according to the sequence from the small sequence number to the large sequence number, establishing a corresponding relation of the transmitted message between the nodes and the nodes with the same position in the list as the nodes in other groups, and simultaneously establishing a corresponding relation of the transmitted message between the last node in the list and the nodes which are later than the node in other groups.
Fig. 4 is an example of relay chain group division, where relay chain nodes are mnodes_l, and l is a number of the relay chain nodes after sorting according to a dynamic factor. As shown in fig. 4, the number of relay links is 7, and the number of groups is rounded down in the open square to obtain the number of groups 2, mnode_0, mnode_2, mnode_4, and mnode_6, which are all 0 after the remainder of 2 is counted in the order number of the mnode_4, so that these nodes form one group.
Fig. 5 is an example of the group divided in fig. 4 to establish a node correspondence relationship between groups. And the nodes with the same positions in the respective group lists mutually establish the corresponding relationship of the transmitted messages. The last node mnode_5 in the relay chain group 2 list has a position of 2 in the list, so the mnode_5 also needs to establish a corresponding relationship of sending messages for the node mnode_6 with a position of 3 in the group 1.
Step 304: and the relay chain node performs broadcast aggregation of the group internal node signatures. Each node broadcasts the node signature to nodes in the same group, and the nodes aggregate after receiving the signature.
Step 305: and the relay chain node performs broadcast aggregation of the group signatures. And after the number of the aggregated signatures in the group is enough to be threshold, broadcasting the aggregated signatures of the group to the corresponding nodes of other groups. And the node receives the aggregation signatures of other groups and performs aggregation again. Fig. 6 is an exemplary diagram of a relay chain node broadcasting signatures according to the correspondence of the inter-group nodes established in fig. 5.
Step 306: after the signature of the relay link point aggregation reaches the threshold, selecting a node of a message target chain according to the corresponding relation of the inter-chain nodes of the inter-chain message transmission, and sending a message carrying the aggregated signature reaching the threshold.
Step 307: and the message target chain node receives the message sent by the relay chain node, verifies the correctness of the message and the aggregate signature, and completes the forwarding of the cross-chain message after any node receives and passes the verification.
It will be appreciated by those skilled in the art that 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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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.
While the foregoing description of the embodiments of the present invention has been presented in conjunction with the drawings, it should be understood that it is not intended to limit the scope of the invention, but rather, it is intended to cover all modifications or variations within the scope of the invention as defined by the claims of the present invention.
Claims (8)
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 chain according to the corresponding relation of the nodes between the chains;
the corresponding relation of the nodes between the chains is constructed by a bidirectional minimum coverage principle, namely, each node of the message initiating chain at least needs to send a message to one node, and at least one node of the receiving chain sends a message to the node;
verifying the correctness of the cross-link message, and signing the verified message;
dividing groups based on the negotiated dynamic factors, and establishing a corresponding relation of the nodes between the groups for sending messages;
performing broadcast aggregation of node signatures inside the group, and performing broadcast aggregation of node signatures among the groups when the number of the 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 an aggregate signature reaching a preset threshold to the node of the target chain, so that the correctness of the message and the aggregate signature is verified;
the specific process of grouping groups based on negotiated dynamic factors includes:
determining the number of groups;
based on the dynamic factors, numbering the nodes, so that the numbers of the nodes under different cross-link messages are different;
and dividing the relay chain nodes into a plurality of groups according to the numbers and the group numbers in a redundant mode, and establishing the corresponding relation of the nodes among the groups.
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 chain node according to the corresponding relation of the nodes between the links;
the corresponding relation of the nodes between the chains is constructed by a bidirectional minimum coverage principle, namely, each node of the message initiating chain at least needs to send a message to one node, and at least one node of the receiving chain sends a message to the node;
the relay link node verifies the correctness of the cross-link message and signs the verified message;
the relay chain nodes divide groups based on the negotiated dynamic factors, and a corresponding relation of the nodes between the groups for sending messages is established;
the relay chain node performs broadcast aggregation of the node signatures in the group, and when the number of the signatures reaches a set threshold, the relay chain node performs broadcast aggregation of the node signatures among the groups until the total signature reaches a preset threshold;
the relay chain node sends a message carrying an aggregate signature reaching a preset threshold to a node of a target chain according to the corresponding relation of the inter-chain nodes;
the node of the target chain verifies the correctness of the message and the aggregate signature, and after any node receives and verifies the message and the aggregate signature, the forwarding of the cross-chain message is completed;
the specific process of grouping groups based on negotiated dynamic factors includes:
determining the number of groups;
based on the dynamic factors, numbering the nodes, so that the numbers of the nodes under different cross-link messages are different;
and dividing the relay chain nodes into a plurality of groups according to the numbers and the group numbers in a redundant mode, and establishing the corresponding relation of the nodes among the groups.
3. A dynamic cross-link message forwarding method according to claim 1 or 2, characterized in that: the dynamic factor negotiates a consistent random number for each node of the relay chain as the dynamic factor, or directly uses the message hash value as the dynamic factor.
4. The method for forwarding dynamic cross-link messages according to claim 1, wherein: and taking the number of relay chain nodes, squaring and then rounding downwards to obtain an integer n as the number of groups.
5. The method for forwarding dynamic cross-link messages according to claim 1, wherein: when numbering the nodes based on the dynamic factors, merging the node ID and the hash value of the cross-link message, calculating the hash value, and sequencing the nodes according to the calculated hash value result;
or, in the concrete process of dividing the groups in the mode of taking the remainder, the nodes with the same remainder are taken as a group according to the node numbers and the group numbers to divide the groups.
6. A dynamic cross-link message forwarding method according to claim 1 or 2, characterized in that: the specific steps for establishing the corresponding relation of the messages sent by the nodes among the groups comprise: and forming an ordered list of the nodes in the group according to the sequence of the sequence numbers from small to large, and establishing a corresponding relation of the messages to be sent between the nodes and the nodes with the same position in the list as the nodes in other groups, wherein the nodes with the last position in the list simultaneously establish the corresponding relation of the messages to be sent with the nodes which are more rear than the nodes in other groups.
7. A dynamic cross-link message forwarding method according to claim 1 or 2, characterized in that: when the number of the signatures reaches a set threshold, the specific process of broadcasting and aggregating the signatures of the nodes among the groups comprises the following steps:
after the number of the aggregated signatures in the group is enough to threshold, the relay chain node broadcasts the aggregated signatures of the group to the corresponding nodes of other groups, and the nodes receive the aggregated signatures of the other groups and aggregate again.
8. A dynamic cross-link message forwarding system, characterized by: comprising the following steps:
the message initiating chain comprises a plurality of block chain nodes and is used for sending a cross-chain message to the relay chain nodes according to the corresponding relation of the nodes between the chains;
the corresponding relation of the nodes between the chains is constructed by a bidirectional minimum coverage principle, namely, each node of the message initiating chain at least needs to send a message to one node, and at least one node of the receiving chain sends a message to the node;
the relay chain comprises a plurality of blockchain 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 the nodes between the groups for sending messages; performing broadcast aggregation of node signatures inside the group, and performing broadcast aggregation of node signatures among the groups when the number of the 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 an aggregate signature reaching a preset threshold to the node of the target chain;
the target chain comprises a plurality of blockchain nodes and is used for receiving a cross-chain message with an aggregate signature sent by the relay chain node and verifying the correctness of the message and the aggregate signature;
the specific process of grouping groups based on negotiated dynamic factors includes:
determining the number of groups;
based on the dynamic factors, numbering the nodes, so that the numbers of the nodes under different cross-link messages are different;
and dividing the relay chain nodes into a plurality of groups according to the numbers and the group numbers in a redundant mode, and establishing the corresponding relation of the nodes among the groups.
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 CN114362996A (en) | 2022-04-15 |
| CN114362996B true 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11228439B2 (en) * | 2019-01-02 | 2022-01-18 | Jiaping Wang | Scale out blockchain with asynchronized consensus zones |
-
2021
- 2021-12-01 CN CN202111454156.3A patent/CN114362996B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|---|
| CN114362996A (en) | 2022-04-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| 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 | |
| CN111629039B (en) | Block chain consensus method, client, endorsement node and sequencing node | |
| CN110855792B (en) | Message pushing method, device, equipment and medium | |
| CN110474846A (en) | The method and device that block is propagated in a kind of block chain | |
| US7852788B2 (en) | Method of organizing nodes of a network into groupings of nodes, computer program for implementing such a method and communication device forming a node of a network of nodes | |
| CN110245956A (en) | A kind of block chain transaction confirmation method and system based on asynchronous multichain | |
| CN113347164B (en) | Block chain-based distributed consensus system, method, device and storage 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 | |
| CN106793135A (en) | Communication resource dispatching method, terminal device and base station equipment | |
| CN110458673A (en) | Bidding system, equipment and computer readable storage medium based on block chain | |
| CN113114472A (en) | Authentication method and system based on message hash chain | |
| CN112348518B (en) | Block chain transaction certification method and device | |
| JP2018148569A (en) | Radio device | |
| CN112184244A (en) | Block chain-based consensus achieving method and device and storage medium | |
| CN111008827A (en) | Cross-chain transaction signature method and device | |
| CN111464632B (en) | Block chain cross-chain forwarding method and block chain link point | |
| CN114362996B (en) | Dynamic cross-link message forwarding method and system | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| CN104869543B (en) | Base station and user terminal information transmission method and device | |
| CN109348451A (en) | The storage method and device of vehicle auxiliary transmission record | |
| CN109194593A (en) | Method for sending information, device, equipment and computer readable storage medium | |
| CN103841047A (en) | Link aggregation method and device | |
| CN110324421B (en) | Information processing method and block chain node equipment |
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 |