Signatureless communication system across consensus reliable broadcast method and apparatus

Abstract

The application discloses a cross-consensus reliable broadcast method and device of a signature-free communication system, the communication system comprising a first set and a second set, the first set deploying a consensus protocol, the method being applied to any node in the first set and the second set, the method comprising: if the node belongs to the first set, sending a cross message to all nodes in the second set, the cross message comprising a cross-consensus message broadcast by the node across the consensus; if the node belongs to the second set and the second set does not deploy the consensus protocol, after receiving a first number of cross messages, entering a reliable broadcast consensus protocol instance through a proposal message of reliable consensus, and after the reliable broadcast consensus protocol instance outputs the cross-consensus message, delivering the cross-consensus message across the consensus, the reliable broadcast consensus protocol instance being run by all nodes in the second set, and the proposal message comprising the cross-consensus message. The cross-consensus reliable broadcast communication has low complexity and high efficiency.

Description

Technical Field

[0001] This invention relates to the fields of blockchain and cloud service technology, and in particular to a method and apparatus for reliable cross-consensus broadcasting in a signature-free communication system. Background Technology

[0002] This section is intended to provide background or context for the embodiments of the invention set forth in the claims. The description herein is not an admission that it is prior art simply because it is included in this section.

[0003] Communication systems (such as blockchain and cloud services) require cross-consensus communication, which is communication between two groups of nodes. At least one group of nodes runs a consensus protocol internally, communicates across groups, and ensures consistency of communication results within the group. Such reliable communication is called cross-consensus reliable broadcast.

[0004] Cross-consensus reliable broadcasting has wide applications in distributed clouds or distributed databases, sharded blockchain consensus, and cross-chain blockchains.

[0005] Current consensus-based communication solutions for communication nodes generally suffer from high communication complexity and low consensus efficiency. Summary of the Invention

[0006] This invention provides a signature-free cross-consensus reliable broadcasting method for communication systems, enabling low-community-comprehension and high-efficiency cross-consensus reliable broadcasting. The communication system includes a first set and a second set, wherein the first set deploys a consensus protocol. The method is applied to any node in the first set and the second set, and the method includes:

[0007] If the node belongs to the first set, send a cross message to all nodes in the second set, the cross message including the cross consensus message broadcast by the node across consensus;

[0008] If the node belongs to the second set and the second set has not deployed a consensus protocol, after receiving the first number of cross messages, it enters the reliable broadcast consensus protocol instance through the reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

[0009] This invention also provides a signature-free communication system cross-consensus reliable broadcasting device, which can achieve low communication complexity and high efficiency cross-consensus reliable broadcasting. The communication system includes a first set and a second set, wherein the first set deploys a consensus protocol, and the device is applied to any node in the first set and the second set. The device includes:

[0010] A cross-message sending module is used to send a cross message to all nodes in the second set if the node belongs to the first set. The cross message includes cross-consensus messages broadcast by the node across consensus.

[0011] A reliable consensus module is used to, if the node belongs to the second set and the second set has not deployed a consensus protocol, enter the reliable broadcast consensus protocol instance through a reliable consensus proposal message after receiving a first number of cross messages. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

[0012] This invention also provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the above-described method for reliable cross-consensus broadcasting in a signature-free communication system.

[0013] This invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method for reliable cross-consensus broadcasting in a signature-free communication system.

[0014] This invention also provides a computer program product, which includes a computer program that, when executed by a processor, implements the above-described unsigned communication system cross-consensus reliable broadcast method.

[0015] In this embodiment of the invention, a consensus protocol is deployed in the first set. The method is applied to any node in the first set and the second set. If the node belongs to the first set, a cross-consensus message is sent to all nodes in the second set. The cross-consensus message includes the node's cross-consensus broadcast message. If the node belongs to the second set, and the second set has not deployed a consensus protocol, after receiving a first number of cross-consensus messages, it enters a reliable broadcast consensus protocol instance through a reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross-consensus message, the cross-consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross-consensus message. In the above steps, entering the reliable broadcast consensus protocol instance through a reliable consensus proposal message enables the first set, which has deployed a consensus protocol, to send a cross-consensus message including the node's cross-consensus broadcast message, and then enters the reliable broadcast consensus protocol instance within the second set, achieving the security goal of reliable cross-consensus broadcast. Attached Figure Description

[0016] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort. In the drawings:

[0017] Figure 1 This is a flowchart of a signature-free communication system cross-consensus reliable broadcasting method in an embodiment of the present invention;

[0018] Figure 2 This is a flowchart illustrating the execution steps of a reliable broadcast consensus protocol instance in this invention.

[0019] Figure 3 This is another flowchart of a signature-free communication system for reliable broadcasting across consensus in an embodiment of the present invention;

[0020] Figure 4 This is a schematic diagram of the structure of a signature-free communication system cross-consensus reliable broadcast device in an embodiment of the present invention;

[0021] Figure 5 This is a schematic diagram of a computer device in an embodiment of the present invention. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the embodiments of the present invention will be further described in detail below with reference to the accompanying drawings. Here, the illustrative embodiments of the present invention and their descriptions are used to explain the present invention, but are not intended to limit the present invention.

[0023] First, the terminology involved in this invention will be explained.

[0024] Hash: Calculate a hash digest of a message. This embodiment of the invention assumes that a collision-free hash function is implemented.

[0025] Figure 1 This is a flowchart of a signature-free communication system cross-consensus reliable broadcast method according to an embodiment of the present invention. The communication system includes a first set and a second set, wherein the first set deploys a consensus protocol, and the method is applied to any node in the first set and the second set. The method includes:

[0026] Step 101: If the node belongs to the first set, send a cross message to all nodes in the second set. The cross message includes the cross consensus message broadcast by the node across consensus.

[0027] Step 102: If the node belongs to the second set and the second set has not deployed a consensus protocol, after receiving the first number of cross messages, it enters the reliable broadcast consensus protocol instance through the reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

[0028] In the above steps, the reliable consensus proposal message enters the reliable broadcast consensus protocol instance, enabling the first set of consensus protocols to send cross-consensus messages including the cross-consensus broadcast of the nodes, and then enters the reliable broadcast consensus protocol instance in the second set, thereby achieving the security goal of cross-consensus reliable broadcast.

[0029] The following is a detailed description. In this embodiment of the invention, the communication system can be a system such as a blockchain or cloud service that involves multiple nodes that need to communicate. The first set has t+1 nodes, the second set has nf nodes, and the third set has f+1 nodes; the first set has m nodes, t of which are erroneous, and m>=3t+1; the second set has n nodes, f of which are erroneous, and n>=3f+1.

[0030] Cross-consensus reliable broadcast assumes two sets: set A and set B. The most basic model assumes that set A runs a single blockchain consensus. In cross-consensus reliable broadcast, nodes in set A initiate a cross-consensus protocol and broadcast the message (denoted by x-broadcast). All nodes in set B then deliver these cross-consensus messages (denoted by x-deliver). The security objectives of cross-consensus reliable broadcast are as follows:

[0031] Security: If any honest node in the second set B delivers message v first and then delivers message v', then all other honest nodes in B will deliver v' first and then deliver v.

[0032] Termination: If all honest nodes in the first set A broadcast v x-, then any node in the second set B will eventually deliver v x-.

[0033] Completeness: All honest nodes in the second set B will only x-deliver once. If an honest node x-delivers v, then a node in the first set A must have x-broadcast v.

[0034] In this embodiment of the invention, both reliable broadcasting and atomic broadcasting are used.

[0035] Reliable broadcasting: A protocol that achieves reliable communication within a set, with the following specific properties:

[0036] Consistency: If any two correct nodes accept the proposal value (corresponding to the subsequent cross-consensus message) v and v' broadcast by node Pi via RBC, then v = v'.

[0037] Liveness: If any correct node pi initiates an RBC broadcast of the proposed value v, then eventually all correct nodes will accept (i.e., RBC-deliver) the same proposed value v.

[0038] Validity: If any correct node accepts the proposed value v broadcast by node pi, then eventually all correct nodes will accept the same proposed value v.

[0039] Reliable consensus: A version of reliable broadcast consensus where each node holds an input and r-proposes that value, v. Ultimately, each node decides on a value, marked as the decision event r-decide. The reliable consensus is defined as follows:

[0040] Negotiability: If an honest node r-decides v, then any honest node will eventually r-decide v.

[0041] Validity: If all honest nodes r-propose v, then all honest nodes eventually r-decide v.

[0042] Completeness: If an honest node r-decide v, then at least n-2f honest nodes r-propose v.

[0043] Atomic broadcasting: A blockchain consensus model that assumes there is no consensus in either the first set A or the second set B. The security definition of atomic broadcasting is as follows:

[0044] Security: If an honest node atomically delivers message v first and then atomically delivers v', then no honest node will atomically deliver v' first and then atomically deliver v.

[0045] Liveness: If an honest node atomically broadcasts a message v, then eventually the honest node will be able to atomically deliver the message v.

[0046] In step 101, if the node belongs to the first set, a cross message is sent to all nodes in the second set, and the cross message includes the cross consensus message broadcast by the node across consensus.

[0047] Cross-consensus messages can be represented as (CROSS, r, v), where CROSS is the identifier, r is the current round, and v is the cross-consensus message. If it is sent by node PiA in the first set, the cross-consensus message can be represented as vi, while subsequent cross-consensus messages can be uniformly represented as v.

[0048] In step 102, if the node belongs to the second set and the second set has not deployed a consensus protocol, after receiving the first number of cross messages, it enters the reliable broadcast consensus protocol instance through the reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

[0049] Specifically, this embodiment of the invention proposes two schemes: first, the second set does not deploy a consensus protocol; second, the second set deploys a consensus protocol. Step 102 is for the first scheme.

[0050] In one embodiment, after receiving a first number of cross messages, a reliable broadcast consensus protocol instance is entered via a reliable consensus proposal message, including:

[0051] Upon receiving the first number of cross messages and confirming that the cross-consensus messages in the first number of cross messages are consistent, the reliable broadcast consensus protocol instance is entered through the reliable consensus proposal message.

[0052] The first quantity is t+1; for example, any node PiB in the second B, after receiving t+1 consistent (CROSS, r, v) messages from the first set A, enters the reliable broadcast consensus protocol instance (RA_{r, B}) through the proposal message (denoted by r-propose) in the reliable consensus. This instance is run by all nodes in B.

[0053] See Figure 2 This is a flowchart illustrating the execution steps of a reliable broadcast consensus protocol instance according to an embodiment of the present invention. In one embodiment, the execution steps of the reliable broadcast consensus protocol instance include:

[0054] Step 201: If the node belongs to the second set, after receiving the proposal message, send a backtracking message to all nodes in the second set; the proposal message can be represented as (PROPOSE, v), where PROPOSE is a symbol, and sending the proposal message is represented by r-propose v; the backtracking message can be represented as (ECHO, v), and sending the backtracking message is represented by r-echo v.

[0055] Step 202: When the second number of backtrack messages are received and the cross-consensus messages in the backtrack messages are consistent, a preparation message is sent to all nodes in the second set; the second number is nf, the preparation message can be represented as (READY, v), and sending the preparation message can be represented as r-ready v;

[0056] Step 203: After receiving the second number of preparation messages and ensuring that the cross-consensus messages in the preparation messages are consistent, determine the cross-consensus message and output the cross-consensus message.

[0057] The decision-making cross-consensus message can be represented as r-decide v.

[0058] See Figure 2 In one embodiment, the method further includes:

[0059] Step 204: Upon receiving the third number of preparation messages and finding that the cross-consensus messages in the preparation messages are consistent, if the node has never sent a preparation message before, it sends a preparation message to all nodes in the second set.

[0060] Figure 3 This is another flowchart of a signature-free communication system for reliable broadcasting across consensus in an embodiment of the present invention. Corresponding to the second scheme, i.e., the second set deploys the consensus protocol, then after step 101, it proceeds to step 301.

[0061] In one embodiment, it further includes:

[0062] Step 301: If the node belongs to the second set and the second set has deployed a consensus protocol, after receiving the first number of consistent cross messages, run an atomic broadcast consensus instance among the nodes of the second set to reach an agreement on the rounds and cross-consensus messages in the cross messages; wait until the cross-consensus message is atomically delivered, and then deliver the cross-consensus message across consensus.

[0063] For example, after any node PiB in the second set B receives t+1 cross messages (Cross, r, v) from the first set A and r and v are consistent, it runs the atomic broadcast consensus instance originally used in the second set B to reach a consensus on r and v.

[0064] The atomic broadcast consensus instance originally used by the second set B had the following conditions: after each node receives an atomic broadcast message v from another node, it only considers v to be a valid broadcast message and continues the original consensus process after receiving t+1 cross messages (CROSS, r, v) from the first set A and confirming that r and v are consistent.

[0065] Only after the second set B consensus is completed, i.e., after atomic delivery a-deliver v, will cross-consensus delivery x-deliverv take place.

[0066] This invention also proposes a signature-free communication system cross-consensus reliable broadcasting device, the principle of which is similar to the signature-free communication system cross-consensus reliable broadcasting method, and will not be described in detail here.

[0067] Figure 4 This is a schematic diagram of the structure of a reliable cross-consensus broadcasting device for a signature-free communication system according to an embodiment of the present invention. The reliable cross-consensus broadcasting device for a signature-free communication system according to an embodiment of the present invention includes:

[0068] The cross message sending module 401 is used to send a cross message to all nodes in the second set if the node belongs to the first set. The cross message includes the cross consensus message broadcast by the node across consensus.

[0069] The reliable consensus module 402 is used to, if the node belongs to the second set and the second set has not deployed a consensus protocol, enter the reliable broadcast consensus protocol instance through the reliable consensus proposal message after receiving a first number of cross messages. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

[0070] In one embodiment, the reliable consensus module is used for:

[0071] Upon receiving the first number of cross messages and confirming that the cross-consensus messages in the first number of cross messages are consistent, the reliable broadcast consensus protocol instance is entered through the reliable consensus proposal message.

[0072] In one embodiment, the reliable formula module is further configured to:

[0073] If the node belongs to the second set and the second set has deployed a consensus protocol, after receiving the first number of consistent cross messages, an atomic broadcast consensus instance is run among the nodes of the second set to reach an agreement on the rounds and cross-consensus messages in the cross messages;

[0074] Wait until the cross-consensus message is atomically delivered before the cross-consensus message is delivered.

[0075] In summary, in the method and apparatus proposed in this embodiment of the invention, a consensus protocol is deployed in the first set. The method is applied to any node in the first set and the second set. If the node belongs to the first set, a cross-consensus message is sent to all nodes in the second set. The cross-consensus message includes the node's cross-consensus broadcast message. If the node belongs to the second set and the second set has not deployed a consensus protocol, after receiving a first number of cross-consensus messages, it enters a reliable broadcast consensus protocol instance through a reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross-consensus message, the cross-consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross-consensus message. In the above steps, entering the reliable broadcast consensus protocol instance through a reliable consensus proposal message enables the first set, which has deployed a consensus protocol, to send a cross-consensus message including the node's cross-consensus broadcast message, and then enters the reliable broadcast consensus protocol instance within the second set, achieving the security goal of reliable cross-consensus broadcast.

[0076] This invention also provides a computer device. Figure 5 This is a schematic diagram of a computer device in an embodiment of the present invention. The computer device 500 includes a memory 510, a processor 520, and a computer program 530 stored in the memory 510 and executable on the processor 520. When the processor 520 executes the computer program 530, it implements the above-mentioned unsigned communication system cross-consensus reliable broadcast method.

[0077] This invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method for reliable cross-consensus broadcasting in a signature-free communication system.

[0078] This invention also provides a computer program product, which includes a computer program that, when executed by a processor, implements the above-described unsigned communication system cross-consensus reliable broadcast method.

[0079] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can 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, etc.) containing computer-usable program code.

[0080] This 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 block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can 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, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0081] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0082] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0083] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of the present invention. It should be understood that the above descriptions are merely specific embodiments of the present invention and are not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for reliable cross-consensus broadcasting in a signature-free communication system, characterized in that, The communication system includes a first set and a second set, wherein the first set deploys a consensus protocol, and the method is applied to any node in the first set and the second set, the method comprising: If the node belongs to the first set, send a cross message to all nodes in the second set, the cross message including the cross consensus message broadcast by the node across consensus; If the node belongs to the second set and the second set has not deployed a consensus protocol, after receiving the first number of cross messages, it enters the reliable broadcast consensus protocol instance through the reliable consensus proposal message. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

2. The method as described in claim 1, characterized in that, After receiving the first number of cross messages, the reliable broadcast consensus protocol instance is entered through the reliable consensus proposal message, including: Upon receiving the first number of cross messages and confirming that the cross-consensus messages in the first number of cross messages are consistent, the reliable broadcast consensus protocol instance is entered through the reliable consensus proposal message.

3. The method as described in claim 2, characterized in that, The execution steps of the reliable broadcast consensus protocol instance include: If the node belongs to the second set, after receiving the proposal message, a backtracking message is sent to all nodes in the second set; Upon receiving the second number of backtrack messages and finding that the cross-consensus messages in the backtrack messages are consistent, a preparation message is sent to all nodes in the second set. After receiving the second number of preparation messages and ensuring that the cross-consensus messages in the preparation messages are consistent, the cross-consensus message is determined and then output.

4. The method as described in claim 3, characterized in that, Also includes: Upon receiving the third set of preparation messages and finding that the cross-consensus messages in the preparation messages are consistent, if the node has never sent a preparation message before, it sends a preparation message to all nodes in the second set.

5. The method as described in claim 1, characterized in that, Also includes: If the node belongs to the second set and the second set has deployed a consensus protocol, after receiving the first number of consistent cross messages, an atomic broadcast consensus instance is run among the nodes of the second set to reach an agreement on the rounds and cross-consensus messages in the cross messages; Wait until the cross-consensus message is atomically delivered before the cross-consensus message is delivered.

6. The method as described in claim 4, characterized in that, The first quantity is t+1, the second quantity is nf, and the third quantity is f+1; The first set has m nodes, t of which are incorrect, and m >= 3t + 1; The second set has n nodes, f of which are incorrect, and n>=3f+1.

7. A signature-free communication system cross-consensus reliable broadcasting device, characterized in that, The communication system includes a first set and a second set, wherein the first set deploys a consensus protocol, and the device is applied to any node in the first set and the second set, the device comprising: A cross-message sending module is used to send a cross message to all nodes in the second set if the node belongs to the first set. The cross message includes cross-consensus messages broadcast by the node across consensus. A reliable consensus module is used to, if the node belongs to the second set and the second set has not deployed a consensus protocol, enter the reliable broadcast consensus protocol instance through a reliable consensus proposal message after receiving a first number of cross messages. When the reliable broadcast consensus protocol instance outputs a cross consensus message, the cross consensus message is delivered across consensus. The reliable broadcast consensus protocol instance is run by all nodes in the second set, and the proposal message includes the cross consensus message.

8. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method of any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the method of any one of claims 1 to 6.

10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the method of any one of claims 1 to 6.

Images