A protocol conversion method, system and device for protocol conversion

Abstract

The embodiment of the present invention provides a protocol conversion method, system and device for protocol conversion. The method includes: when it is determined that the secure computing task meets the preset conversion conditions, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in another multi-party secure computing system, so that the computing node in the other multi-party secure computing system performs the secure computing task based on the secret sharing factor after the data conversion; wherein the first multi-party secure computing system supports the 2-4 secret sharing protocol, and the second multi-party secure computing system supports the ABY3 protocol. The embodiment of the present invention realizes the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system.

Description

Technical Field

[0001] The present invention relates to the technical field of multi-party secure computing, and in particular to a protocol conversion method, system and device for protocol conversion. Background Art

[0002] With the development of multi-party secure computing technology in recent years, the demand for interconnection and interoperability between multi-party secure computing systems has also increased. The core issue of interconnection and interoperability between multi-party secure computing systems is to solve the interconnection and interoperability of different secret sharing protocols while ensuring data security. For example, suppose there are two multi-party secure computing systems A and B, where multi-party secure computing system A follows secret sharing protocol a and multi-party secure computing system B follows secret sharing protocol b. Obviously, the secret sharing protocols followed by multi-party secure computing system A are different from those followed by multi-party secure computing system B, and the data calculated by multi-party secure computing system A cannot be applied to multi-party secure computing system B. Therefore, how to achieve data sharing between multi-party secure systems A and B that follow different secret sharing protocols has become the key to achieving interconnection and interoperability between multi-party secure systems A and B. Summary of the invention

[0003] The embodiments of the present invention provide a protocol conversion method, system and device for protocol conversion, which can realize the secure conversion of secret sharing factors between two multi-party secure computing systems supporting different protocols and realize the interconnection between the multi-party secure computing systems.

[0004] In order to solve the above problem, an embodiment of the present invention discloses a protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, and the method includes:

[0005] When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion;

[0006] The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

[0007] An embodiment of the present invention discloses another protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol. The method is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, and the four computing nodes hold a first secret sharing factor of computing data to be converted for a secure computing task. The method includes:

[0008] Any two computing nodes in the first multi-party secure computing system calculate a relational random number based on a locally generated random number, and send the relational random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively;

[0009] The any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

[0010] The embodiment of the present invention discloses another protocol conversion method, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The method is applied to the second multi-party secure computing system, and the second multi-party secure computing system includes computing nodes P1, P2, and P3. The method includes:

[0011] The computing nodes P1, P2, and P3 respectively receive a relationship random number and a second secret sharing factor sent by a computing node in the first multi-party secure computing system; the relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on a locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold;

[0012] The computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol;

[0013] The computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor they hold.

[0014] An embodiment of the present invention discloses another protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol, which is applied to the second multi-party secure computing system, wherein the second multi-party secure computing system includes computing nodes P1, P2, and P3, wherein the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted for a secure computing task, and the method includes:

[0015] The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system;

[0016] The computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

[0017] The embodiment of the present invention discloses another protocol conversion method, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The method is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, and the four computing nodes include computing nodes S1, S2, Sa, and Sb. The method includes:

[0018] The computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system;

[0019] The computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system;

[0020] Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor;

[0021] Each computing node performs secure computing tasks based on the local secret sharing factor it holds;

[0022] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0023] On the other hand, an embodiment of the present invention discloses a device for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations:

[0024] When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion;

[0025] The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

[0026] The embodiment of the present invention discloses another device for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The device is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, and the four computing nodes hold a first secret sharing factor of computing data to be converted in a secure computing task. The device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0027] Any two computing nodes in the first multi-party secure computing system calculate a relational random number based on a locally generated random number, and send the relational random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively;

[0028] The any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

[0029] The embodiment of the present invention discloses another apparatus for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The apparatus is applied to the second multi-party secure computing system, and the second multi-party secure computing system includes computing nodes P1, P2, and P3. The apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0030] The computing nodes P1, P2, and P3 respectively receive a relationship random number and a second secret sharing factor sent by a computing node in the first multi-party secure computing system; the relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on a locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold;

[0031] The computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol;

[0032] The computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor they hold.

[0033] An embodiment of the present invention provides another apparatus for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The apparatus is applied to the second multi-party secure computing system, and the second multi-party secure computing system includes computing nodes P1, P2, and P3, wherein the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted by a secure computing task, and the apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations:

[0034] The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system;

[0035] The computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

[0036] An embodiment of the present invention provides another device for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The device is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, wherein the four computing nodes include computing nodes S1, S2, Sa, and Sb. The device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0037] The computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system;

[0038] The computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system;

[0039] Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor;

[0040] Each computing node performs secure computing tasks based on the local secret sharing factor it holds;

[0041] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0042] On the other hand, an embodiment of the present invention discloses a machine-readable medium having instructions stored thereon, which, when executed by one or more processors, enables a device to perform one or more of the protocol conversion methods described above.

[0043] The embodiments of the present invention include the following advantages:

[0044] The protocol conversion method provided by the embodiment of the present invention, when the security computing task to be executed meets the preset conditions, that is, when there is a computing node in one and only one of the first multi-party secure computing system and the second multi-party secure computing system holds the secret sharing factor of the computing data to be converted in the security computing task, the computing node in the multi-party secure computing system holding the secret sharing factor performs data conversion on the secret sharing factor, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, and the computing node in the other multi-party secure computing system can execute the security computing task based on the received secret sharing factor, thereby realizing the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments of the present invention will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative labor.

[0046] Figure 1 It is a flowchart of a protocol conversion method embodiment of the present invention;

[0047] Figure 2 is a secret sharing schematic diagram of a first multi-party secure computing system of the present invention;

[0048] Figure 3 is a secret sharing schematic diagram of a second multi-party secure computing system of the present invention;

[0049] Figure 4 It is a flow chart of steps of a protocol conversion method of the present invention;

[0050] Figure 5 is a flow chart of steps of another protocol conversion method of the present invention;

[0051] Figure 6 It is a flowchart of steps of another protocol conversion method of the present invention;

[0052] Figure 7 It is a flowchart of steps of another protocol conversion method of the present invention;

[0053] Figure 8 is a flow chart of steps of another protocol conversion method of the present invention;

[0054] Fig. 9 It is a flowchart of steps of another protocol conversion method of the present invention;

[0055] Fig.10 It is a structural block diagram of a protocol conversion system of the present invention;

[0056] Fig.11 is a block diagram of an apparatus 800 for protocol conversion of the present invention;

[0057] Fig.12 It is a schematic diagram of the structure of the server in some embodiments of the present invention. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] Method Embodiment

[0060] Reference Figure 1 , shows a flowchart of a protocol conversion method embodiment of the present invention, the method is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supports a 2-4 (2-out-of-4) secret sharing protocol, and the second multi-party secure computing system supports an ABY3 (Arithmetic-Binary-Yao-3, secure three-party computing) protocol, and the method may specifically include the following steps:

[0061] Step 101: When it is determined that a secure computing task satisfies a preset conversion condition, a computing node in a first multi-party secure computing system or a computing node in a second multi-party secure computing system performs data conversion on a secret sharing factor of computing data to be converted of the secure computing task.

[0062] Step 102: Send the secret sharing factor after data conversion to a computing node in another multi-party secure computing system, so that the computing node in the other multi-party secure computing system performs the secure computing task based on the secret sharing factor after data conversion.

[0063] The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

[0064] It should be noted that the protocol conversion method provided in the embodiment of the present invention can be applied to a multi-party secure computing system, specifically a first multi-party secure computing system supporting a 2-4 secret sharing protocol and a second multi-party secure computing system supporting an ABY3 protocol. The first multi-party secure computing system and the second multi-party secure computing system in the present invention are both computing systems for protecting data privacy and security, and include multiple participants. Multiple participants can use multi-party secure computing technology to perform collaborative computing without leaking their own data to obtain computing results, and the data, intermediate results, and final results involved in the computing can be guaranteed not to be leaked. The participants in the multi-party secure computing can include task control nodes and computing nodes, wherein the task control nodes are used to schedule computing nodes to perform secure computing tasks, and the computing nodes perform collaborative computing based on the secret sharing factors they hold to complete the secure computing tasks.

[0065] Furthermore, the multi-party secure computing system may also include data nodes for providing services such as data storage, data provision, and computing result storage. The multi-party secure computing system may also include a result acquirer for acquiring computing results from the computing nodes, and the result acquirer may be a designated data node or nodes.

[0066] The secure computing tasks performed by each computing node in the multi-party secure computing system can be computer program codes implemented in a preset programming language, and the multi-party secure computing system can implement corresponding computing functions by executing the computer program codes. The secure computing tasks include but are not limited to: data-related operations such as computing, cleaning, analyzing, model training, storage, and database query based on ciphertext. It can be understood that the embodiments of the present invention do not limit the specific types of secure computing tasks.

[0067] A secure computing task may include any type of mathematical calculations, such as arithmetic operations (such as addition, subtraction, multiplication, and division), logical calculations (such as AND, OR, XOR, etc.).

[0068] It can be understood that in the embodiments of the present invention, the computing data of the secure computing task can be any data that is not convenient to disclose publicly, and can include but is not limited to data representing user personal information, business secrets, model parameters of a neural network model, and the like.

[0069] It should be noted that the first multi-party secure computing system in the present invention supports the 2-4 secret sharing protocol, and the second multi-party secure computing system supports the ABY3 protocol.

[0070] The first multi-party secure computing system includes four computing nodes, namely computing nodes S1, S2, Sa and Sb. Figure 2 , shows a schematic diagram of secret sharing in a first multi-party secure computing system provided by an embodiment of the present invention. Figure 2 As shown, in the first multi-party secure computing system, it is assumed that the data party holds data X. The data party performs a secret sharing on data X and obtains two secret sharing factors x1 and x2, X=x1+x2. The data party sends the secret sharing factor x1 to computing nodes S1 and S2. Computing nodes S1 and S2 perform a second secret analysis operation respectively. Specifically, computing nodes S1 and S2 generate random numbers r_s1 and r_s2 respectively based on the held seed r_12 and the pseudo-random number function, r_s1=r_s2. Then, computing nodes S1 and S2 use the locally generated random numbers to perform secret sharing on the held secret sharing factors respectively, wherein computing node S1 obtains the secret sharing factor x1_, x1_=x1-r_s1, and computing node S2 obtains the secret sharing factor x2_, x2_=x2+r_s2. Computing node S1 sends the secret sharing factor x1_ to computing node Sa, and sends the secret sharing factor x1 to computing node Sb; computing node S2 sends the secret sharing factor x2 to computing node Sa, and sends the secret sharing factor x2_ to computing node Sb. After receiving the secret sharing factors sent by computing nodes S1 and S2, computing nodes Sa and Sb perform local settings. Exemplarily, computing node S2 sets xa=x2, xa_=x1_; computing node Sb sets xb=x1, xb_=x2_. After the above processing, computing node S1 holds secret sharing factors x1 and x1_, computing node S2 holds secret sharing factors x2 and x2_, computing node Sa holds secret sharing factors x2 and x1_, and computing node Sb holds secret sharing factors x1 and x2_. Any two of the four computing nodes can restore the original data X based on the secret sharing factors they hold. When each computing node in the first multi-party secure computing system performs a secure computing task based on the random number and secret sharing factor it holds, the calculation is performed in accordance with the 2-4 secret sharing protocol. The calculation results obtained after each round of calculation are also stored in each computing node in accordance with the 2-4 secret sharing protocol.

[0071] The second multi-party secure computing system includes three computing nodes, namely computing nodes P1, P2 and P3. Figure 3 , shows a schematic diagram of secret sharing in a second multi-party secure computing system provided by an embodiment of the present invention. Figure 3 As shown, in the second multi-party secure computing system, it is assumed that the data party holds data Y and holds relational random numbers v1, v2 and v3, v1+v2+v3=0. The data party uses the relational random numbers to perform secret sharing on data Y and obtains secret sharing factors y1, y2 and y3, where y1=v3-Y, y2=v1-Y, y3=v2-Y. Then, the data party sends the relational random numbers v1, v2 and v3 and the secret sharing factors y1, y2 and y3 to the computing nodes P1, P2 and P3. After the above secret sharing operation, the computing node P1 holds the relational random number v1 and the secret sharing factor y1, the computing node P2 holds the relational random number v2 and the secret sharing factor y2, and the computing node P3 holds the relational random number v3 and the secret sharing factor y3. When each computing node in the second multi-party secure computing system performs a secure computing task based on the relational random numbers and secret sharing factors held, it performs the calculation according to the ABY3 protocol, and the calculation results obtained after each round of calculation are also stored in each computing node according to the ABY3 protocol.

[0072] Since the first multi-party secure computing system and the second multi-party secure computing system each support different protocols and hold different forms of secret sharing of data, the two systems cannot directly share data and cannot interconnect. In order to solve this problem and achieve interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system, an embodiment of the present invention provides a protocol conversion method, which performs protocol conversion on encrypted data between the two systems, so that one system can use the encrypted data provided by the other system to perform secure computing tasks.

[0073] Specifically, when the security computing task to be executed meets the preset conditions, that is, there is one and only one computing node in the first multi-party secure computing system and the second multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the security computing task, the computing node in the multi-party secure computing system holding the secret sharing factor performs data conversion on the locally generated random number and the secret sharing factor, and sends the random number and secret sharing factor after data conversion to the computing node in another multi-party secure computing system. The computing node in the other multi-party secure computing system can execute the security computing task based on the received random number and secret sharing factor, thereby realizing the interconnection between the first multi-party secure computing system and the second multi-party secure computing system.

[0074] It can be understood that the computational data to be converted in the secure computing task in the present invention is determined based on the secret sharing factors held by the two systems and the multi-party secure computing system that performs the secure computing task. For example, assuming that the first multi-party secure computing system holds the secret sharing factor of the computational data X of the secure computing task, and the second multi-party secure computing system holds the secret sharing factor of the computational data Y of the secure computing task, if the secure computing task is performed in the first multi-party secure computing system, the computational data to be converted is Y, and if the secure computing task is performed in the second multi-party secure computing system, the computational data to be converted is X.

[0075] As an example, if the computing nodes in the first multi-party secure computing system hold the first secret sharing factor of the computing data to be converted for the secure computing task, the random number and the first secret sharing factor held by the computing nodes in the first multi-party secure computing system can be converted into the relational random number and the third secret sharing factor that conform to the ABY3 protocol by performing data conversion processing on the random number and the first secret sharing factor, so that the second multi-party secure computing system can perform the secure computing task based on the relational random number and the third secret sharing factor. The protocol conversion method provided in the embodiment of the present invention can realize data sharing between the first multi-party secure computing system supporting different protocols and the second multi-party secure computing system, and realize the interconnection and interoperability of the two systems.

[0076] Reference Figure 4 , shows a flowchart of the steps of a protocol conversion method of the present invention, the method is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol, the method may specifically include the following steps:

[0077] Step 201: Any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on a locally generated random number, and send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively.

[0078] Step 202: Any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor of the computing data of the secure computing task to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively.

[0079] Step 203 : The computing nodes P1 , P2 , and P3 respectively receive the relationship random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system.

[0080] Step 204: The computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol;

[0081] Step 205: The computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor.

[0082] In the embodiment of the present invention, since any two computing nodes in the first multi-party secure computing system can restore the original data based on the secret sharing factor they hold, if the random number and the first secret sharing factor held by the computing nodes in the first multi-party secure computing system are converted into a relational random number and a second secret sharing factor that conforms to the ABY3 protocol, it is only necessary to perform data conversion on the random number and the first secret sharing factor of any two computing nodes in the first multi-party secure computing system. For example, data conversion is performed on the random number and the first secret sharing factor of computing nodes S1 and S2, or data conversion is performed on the random number and the first secret sharing factor of computing nodes S1 and Sa, etc. The embodiment of the present invention does not specifically limit the combination of any two computing nodes in the first multi-party secure computing system.

[0083] Any two computing nodes in the first multi-party secure computing system calculate the relationship random numbers v1, v2 and v3 according to the locally generated random numbers, and send the obtained relationship random numbers to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively. It should be noted that the embodiment of the present invention does not limit the specific calculation method of the computing nodes in the first multi-party secure computing system to calculate the relationship random numbers, as long as the obtained relationship random numbers satisfy the ABY3 protocol, that is, v1+v2+v3=0.

[0084] Then, the two computing nodes that generate the relational random numbers mentioned above respectively use the locally generated random numbers to perform data conversion on the first secret sharing factor they hold to obtain the second secret sharing factor, and respectively send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system.

[0085] After receiving the relational random number and secret sharing factor sent by the computing node in the first multi-party secure computing system, each computing node in the second multi-party secure computing system performs local addition calculation on the received second secret sharing factor to obtain a third secret sharing factor. Among them, computing node P1 obtains the third secret sharing factor x1_aby3, computing node P2 obtains the third secret sharing factor x2_aby3, and computing node P3 obtains x3_aby3; the third secret sharing factors obtained by computing nodes P1, P2 and P3 satisfy the ABY3 protocol.

[0086] Finally, the computing nodes P1, P2, and P3 in the second multi-party secure computing system perform the secure computing task based on the held relational random number and the third secret sharing factor.

[0087] After the above steps, the embodiment of the present invention converts the random number and the first secret sharing factor that satisfy the 2-4 secret sharing protocol held by any two computing nodes in the first multi-party secure computing system into a relational random number and a third secret sharing factor that satisfy the ABY3 protocol, thereby realizing the interconnection between the first multi-party secure computing system and the second multi-party secure computing system.

[0088] Reference Figure 5 , showing a flowchart of the steps of another protocol conversion method provided by an embodiment of the present invention. The method is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports the 2-4 secret sharing protocol and the second multi-party secure computing system supports the ABY3 protocol. The method is applied to a first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, wherein the four computing nodes hold the first secret sharing factor of the computing data to be converted by the secure computing task, and the method may specifically include the following steps:

[0089] Step 301: Any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on a locally generated random number, and send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively.

[0090] Step 302: Any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

[0091] The protocol conversion method provided in the embodiment of the present invention is used to convert the encrypted data satisfying the 2-4 secret sharing protocol in the first multi-party secure computing system into the encrypted data satisfying the ABY3 protocol in the second multi-party secure computing system. Among them, the four computing nodes of the first multi-party secure computing system all hold the first secret sharing factor of the computing data to be converted in the secure computing task. Since any two computing nodes in the first multi-party secure computing system can restore the original data based on the secret sharing factor held, when performing the protocol conversion, only the random numbers and the first secret sharing factors of any two computing nodes in the first multi-party secure computing system need to be converted. It should be noted that the embodiment of the present invention does not specifically limit the combination of any two computing nodes in the first multi-party secure computing system. For example, the any two computing nodes can be computing nodes S1 and S2, or computing nodes S1 and Sa, computing nodes Sa and Sb, and so on.

[0092] Any two computing nodes in the first multi-party secure computing system calculate the relationship random numbers v1, v2 and v3 according to the locally generated random numbers, and send the obtained relationship random numbers to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively. It should be noted that the embodiment of the present invention does not limit the specific calculation method of the relationship random numbers, as long as the obtained relationship random numbers satisfy the ABY3 protocol, that is, v1+v2+v3=0.

[0093] Then, the two computing nodes that generate the relational random numbers mentioned above respectively use the locally generated random numbers to perform data conversion on the first secret sharing factor they hold to obtain the second secret sharing factor, and respectively send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform secure computing tasks based on the received relational random numbers and the second secret sharing factor.

[0094] The following takes computing nodes S1 and S2 in the first multi-party secure computing system as an example to illustrate the specific processing process of data conversion between random numbers and first secret sharing factors held by any two computing nodes in the first multi-party secure computing system.

[0095] In an optional embodiment of the present invention, the arbitrary two computing nodes include computing node S1 and computing node S2, and step 301, any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on a locally generated random number, and respectively send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, including:

[0096] Step S11, computing node S1 sends the random number r_s1 to computing node P1, computing node S2 sends the random number r_s2 to computing node P2, so that computing node P1 holds the relationship random number v1, v1 = r_s1, computing node P2 holds the relationship random number v2, v2 = r_s2;

[0097] Step S12, computing nodes S1 and S2 use random numbers r_s1 and r_s2 to calculate a relational random number v3, v3 = -r_s1 - r_s2;

[0098] Step S13: The computing node S1 or the computing node S2 sends the relationship random number v3 to the computing node P3, so that the computing node P3 holds the relationship random number v3.

[0099] In the embodiment of the present invention, it is assumed that the random number locally generated by the computing node S1 based on the seed r_12 held and the pseudo-random function is r_s1, and the random number locally generated by the computing node S2 based on the seed r_12 held and the pseudo-random function is r_s2, r_s1 = r_s2. Among them, the computing node S1 sends the random number r_s1 to the computing node P1 in the second multi-party secure computing system, and the computing node S2 sends the random number r_s2 to the computing node P2 in the second multi-party secure computing system. The computing nodes P1 and P2 set the received random number as the local relationship random number. Assuming that the relationship random number of the computing node P1 is v1 and the relationship random number of the computing node P2 is v2, then v1 = r_s1, v2 = r_s2.

[0100] The computing nodes S1 and S2 calculate the relation random number v3 using the random numbers r_s1 and r_s2, and the computing node S1 or the computing node S2 sends the relation random number v3 to the computing node P3 in the second multi-party secure computing system, v3 = -r_s1 - r_s2.

[0101] It should be noted that, in the embodiment of the present invention, the relationship between the relational random numbers v1, v2, v3 and the random numbers r_s1, r_s2 generated locally by the computing nodes S1 and S2 is not limited to the relationship equations listed in the above steps S11 to S13, as long as the relational random numbers v1, v2, v3 satisfy the ABY3 protocol, that is, v1+v2+v3=0.

[0102] In an optional embodiment of the present invention, computing node S1 holds a first secret sharing factor x1_t0 of computing data X of a secure computing task, computing node S2 holds a first secret sharing factor x2_t0 of computing data X of a secure computing task, X=x1_t0+x2_t0, and in step 302, any two computing nodes perform data conversion on the first secret sharing factor using a locally generated random number to obtain a second secret sharing factor, and respectively send the second secret sharing factor to computing nodes P1, P2, and P3 in the second multi-party secure computing system, including:

[0103] Step S21, computing nodes S1 and S2 respectively use the random numbers they hold to secretly share the first secret sharing factor x1_t0 or x2_t0, so that computing node S1 obtains the second secret sharing factors x1_t1 and x1_t2, and computing node S2 obtains the second secret sharing factors x2_t1 and x2_t2;

[0104] Step S22, computing node S1 sends the second secret sharing factor x1_t1 to computing node P1, and sends the second secret sharing factor x1_t2 to computing node P2;

[0105] Step S23, computing node S2 sends the second secret sharing factor x2_t1 to computing node P1, and sends the second secret sharing factor x2_t2 to computing node P3;

[0106] Step S24, computing nodes S1 and S2 respectively calculate the inverse of the first secret sharing factor, so that computing node S1 obtains the second secret sharing factor x1_t3, and computing node S2 obtains the second secret sharing factor x2_t3;

[0107] Step S25, computing node S1 sends the second secret sharing factor x1_t3 to computing node P3;

[0108] Step S26: The computing node S2 sends the second secret sharing factor x2_t3 to the computing node P2.

[0109] When performing data conversion on the first secret sharing factor, computing node S1 uses random number r_s1 to perform secret sharing on the first secret sharing factor x1_t0, and obtains second secret sharing factors x1_t1 and x1_t2. In addition, computing node S1 inverts the first secret sharing factor x1_t0, and the second secret sharing factor x1_t3, x1_t3 is the inverse of x1_t0. Optionally, the second secret sharing factor x1_t1=-r_s1-x1_t0, x1_t2=r_s1-x1_t0, x1_t3=-x1_t0 obtained by computing node S1. Computing node S1 sends the second secret sharing factor x1_t1 to computing node P1, sends the second secret sharing factor x1_t2 to computing node P2, and sends the second secret sharing factor x1_t3 to computing node P3.

[0110] The computing node S2 uses the random number r_s2 to perform secret sharing on the first secret sharing factor x2_t0, and obtains the second secret sharing factors x2_t1 and x2_t2. In addition, the computing node S2 inverts the first secret sharing factor x2_t0, and the second secret sharing factor x2_t3, x2_t3 is the inverse of x2_t0. Optionally, the second secret sharing factor x2_t1=-r_s2-x2_t0, x2_t2=r_s2-x2_t0, x2_t3=-x2_t0 obtained by the computing node S2. The computing node S2 sends the second secret sharing factor x2_t1 to the computing node P1, sends the second secret sharing factor x2_t2 to the computing node P3, and sends the second secret sharing factor x2_t3 to the computing node P2.

[0111] It should be noted that the second secret sharing factor obtained by the computing nodes S1 and S2 in the first multi-party secure computing system after the above processing does not satisfy the ABY3 protocol, and each computing node in the second multi-party secure computing system is required to perform local processing on the received second secret sharing factor.

[0112] Reference Figure 6 , shows a flowchart of the steps of another protocol conversion method provided by an embodiment of the present invention. The method is used for the secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supports the 2-4 secret sharing protocol, and the second multi-party secure computing system supports the ABY3 protocol. The method is applied to the second multi-party secure computing system, the second multi-party secure computing system includes computing nodes P1, P2 and P3, and the method may specifically include the following steps:

[0113] Step 401: computing nodes P1, P2, and P3 respectively receive a relational random number and a second secret sharing factor sent by a computing node in a first multi-party secure computing system.

[0114] Step 402, computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that computing node P1 obtains the third secret sharing factor x1_aby3, computing node P2 obtains the third secret sharing factor x2_aby3, and computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol.

[0115] Step 403: The computing nodes P1, P2 and P3 perform a secure computing task based on the relationship random number and the third secret sharing factor.

[0116] The protocol conversion method provided in the embodiment of the present invention is used to convert encrypted data satisfying the 2-4 secret sharing protocol in a first multi-party secure computing system into encrypted data satisfying the ABY3 protocol in a second multi-party secure computing system.

[0117] Each computing node in the second multi-party secure computing system receives the relationship random number and the second secret sharing factor sent by the computing node in the first multi-party secure computing system, respectively. The relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on the locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold.

[0118] Next, computing nodes P1, P2, and P3 in the second multi-party secure computing system respectively perform local addition calculations using the received second secret sharing factors to obtain third secret sharing factors. It should be noted that the third secret sharing factors obtained by computing nodes P1, P2, and P3 satisfy the ABY3 protocol.

[0119] Finally, computing nodes P1, P2, and P3 perform secure computing tasks based on the relationship random numbers and the third secret sharing factor they hold. It should be noted that when each computing node in the second multi-party secure computing system performs secure computing tasks based on the relationship random numbers and secret sharing factors they hold, they perform calculations in accordance with the ABY3 protocol, and the calculation results obtained after each round of calculations are also stored in each computing node in accordance with the ABY3 protocol.

[0120] The following takes the example of computing nodes S1 and S2 in the first multi-party secure computing system sending relational random numbers and second secret sharing factors to computing nodes in the second multi-party secure computing system to illustrate specific operations performed by computing nodes in the second multi-party secure computing system.

[0121] In an optional embodiment of the present invention, any two computing nodes in the first multi-party secure computing system include computing node S1 and computing node S2, the random number locally generated by computing node S1 is r_s1, and the random number locally generated by computing node S2 is r_s2. In step 401, computing nodes P1, P2, and P3 respectively receive the relationship random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including:

[0122] Step S31, computing node P1 receives the relation random number v1 sent by computing node S1, where v1=r_s1;

[0123] Step S32, computing node P2 receives the relation random number v2 sent by computing node S2, where v2=r_s2;

[0124] Step S33: The computing node P3 receives the relation random number v3 sent by the computing node S1 or the computing node S2, where v3 = -r_s1 - r_s2.

[0125] In the second multi-party secure computing system, when receiving the relationship random number sent from the computing node in the first multi-party secure computing system, computing node P1 is used to receive the relationship random number v1 sent by computing node S1, computing node P2 is used to receive the relationship random number v2 sent by computing node S2, and computing node P3 is used to receive the relationship random number v3 sent by computing node S1 or S2. Optionally, v1 = r_s1, v2 = r_s2, v3 = -r_s1-r_s2.

[0126] In an optional embodiment of the invention, the computing node S1 holds the first secret sharing factor x1_t0 of the computing data X of the secure computing task, and the computing node S2 holds the first secret sharing factor x2_t0 of the computing data X of the secure computing task, X=x1_t0+x2_t0, and step 401 wherein the computing nodes P1, P2, and P3 respectively receive the relational random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including:

[0127] Step S41, computing node P1 receives the second secret sharing factor x1_t1 sent by computing node S1 and the second secret sharing factor x2_t1 sent by computing node S2, x1_t1 = -r_s1 - x1_t0, x2_t1 = -r_s2 - x2_t0;

[0128] Step S42, computing node P2 receives the second secret sharing factor x1_t2 sent by computing node S1 and the second secret sharing factor x2_t3 sent by computing node S2, x1_t2=r_s1-x1_t0, x2_t3=-x2_t0;

[0129] Step S43: The computing node P3 receives the second secret sharing factor x1_t3 sent by the computing node S1 and the second secret sharing factor x2_t2 sent by the computing node S2, where x1_t3=-x1_t0 and x2_t2=r_s2-x2_t0.

[0130] In the second multi-party secure computing system, computing node P2 is used to receive the second secret sharing factor x1_t1 sent by computing node S1 and the second secret sharing factor x2_t1 sent by computing node S2, computing node P2 is used to receive the second secret sharing factor x1_t2 sent by computing node S1 and the second secret sharing factor x2_t3 sent by computing node S2, and computing node P3 is used to receive the second secret sharing factor x1_t3 sent by computing node S1 and the second secret sharing factor x2_t2 sent by computing node S2. Optionally, x1_t1=-r_s1-x1_t0, x2_t1=-r_s2-x2_t0, x1_t2=r_s1-x1_t0, x2_t3=-x2_t0, x1_t3=-x1_t0, x2_t2=r_s2-x2_t0.

[0131] After the above processing, the computing node P1 in the second multi-party secure computing system holds the relationship random number v1 and the second secret sharing factors x1_t1, x2_t1, the computing node P2 holds the relationship random number v2 and the second secret sharing factors x1_t2, x2_t3, and the computing node P3 holds the relationship random number v3 and the second secret sharing factors x2_t2, x1_t3.

[0132] Next, the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform local addition calculation based on the second secret sharing factor they hold to obtain a third secret sharing factor that satisfies the ABY3 protocol.

[0133] Assuming that the third secret sharing factor obtained by computing node P1 is x1_aby3, the third secret sharing factor obtained by computing node P2 is x2_aby3, and the third secret sharing factor obtained by computing node P3 is x3_aby3, then each third secret sharing factor can satisfy the following conditions: the third secret sharing factor x1_aby3 obtained by the computing node P1 is -r_s1-x1_t0+r_s2-x2_t0; the third secret sharing factor x2_aby3 obtained by the computing node P2 is r_s1-x1_t0-x2_t0; the third secret sharing factor x3_aby3 obtained by the computing node P3 is -x1_t0+r_s2-x2_t0.

[0134] To summarize, the protocol conversion method provided in the embodiment of the present invention converts the random number and the first secret sharing factor that satisfy the 2-4 secret sharing protocol held by any two computing nodes in the first multi-party secure computing system into a relational random number and a third secret sharing factor that satisfy the ABY3 protocol, thereby realizing the interconnection between the first multi-party secure computing system and the second multi-party secure computing system.

[0135] The protocol conversion method provided by the present invention can not only convert the random number and the first secret sharing factor that conform to the 2-4 secret sharing protocol into the relational random number and the third secret sharing factor that conform to the ABY3 protocol, but also convert the relational random number and the secret sharing factor that conform to the ABY3 protocol into the random number and the secret sharing factor that conform to the 2-4 secret sharing protocol.

[0136] Reference Figure 7 , shows a flowchart of the steps of another protocol conversion method provided by an embodiment of the present invention. The method is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supports the 2-4 secret sharing protocol, and the second multi-party secure computing system supports the ABY3 protocol. The method may specifically include the following steps:

[0137] Step 501: The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system.

[0138] Step 502: The computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system.

[0139] Step 503: The computing nodes S2, Sa, and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system.

[0140] Step 504 : The computing nodes S1 , Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system.

[0141] Step 505: Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor.

[0142] Step 506: Each computing node performs a secure computing task based on the local secret sharing factor it holds.

[0143] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0144] In an embodiment of the present invention, the first multi-party secure computing system includes computing nodes S1, S2, Sa and Sb, and the second multi-party secure computing system includes computing nodes P1, P2 and P3, and computing nodes P1, P2 and P3 hold relationship random numbers and secret sharing factors of computing data to be converted by the secure computing task. Among them, computing nodes P1 and P3 respectively send the relationship random numbers they hold to the designated computing nodes in the first multi-party secure computing system, and computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system. Exemplarily, computing node P1 sends the relationship random numbers it holds to computing nodes S2 and Sb in the first multi-party secure computing system, and computing node P3 sends the relationship random numbers it holds to computing nodes S2 and Sa in the first multi-party secure computing system; computing node P1 sends the secret sharing factors it holds to computing nodes S1 and Sb, and computing node P2 sends the secret sharing factors it holds to computing nodes S1 and Sa.

[0145] For each computing node in the first multi-party secure computing system, computing nodes S2, Sa and Sb are used to receive the relationship random number sent by computing node P1 or P3 in the second multi-party secure computing system; computing nodes S1, Sa and Sb are used to receive the secret sharing factor sent by computing node P1 or P2 in the second multi-party secure computing system. Then, each computing node in the first multi-party secure computing system sets the received relationship random number and secret sharing factor respectively, obtains a local secret sharing factor that satisfies the 2-4 secret sharing protocol, and performs a secure computing task based on the local secret sharing factor held.

[0146] After the above steps, the embodiment of the present invention converts the relational random numbers and secret sharing factors held by each computing node in the second multi-party secure computing system that satisfy the ABY3 protocol into random numbers and local secret sharing factors that satisfy the 2-4 secret sharing protocol in the first multi-party secure computing system, thereby realizing the interconnection between the first multi-party secure computing system and the second multi-party secure computing system.

[0147] Reference Figure 8 , shows a flowchart of another protocol conversion method provided by an embodiment of the present invention. The method is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports the 2-4 secret sharing protocol and the second multi-party secure computing system supports the ABY3 protocol. The method is applied to the second multi-party secure computing system, and the method may specifically include the following steps:

[0148] Step 601: The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the designated computing nodes in the first multi-party secure computing system.

[0149] Step 602: computing nodes P1 and P2 respectively send the secret sharing factors they hold to designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs a secure computing task based on the received relational random number and secret sharing factor.

[0150] The protocol conversion method provided in an embodiment of the present invention is used to convert encrypted data that satisfies the ABY3 protocol in a second multi-party secure computing system into encrypted data that satisfies the 2-4 secret sharing protocol in a first multi-party secure computing system. The first multi-party secure computing system includes computing nodes S1, S2, Sa, and Sb. The second multi-party secure computing system includes computing nodes P1, P2, and P3, and the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted by a secure computing task and satisfy the ABY3 protocol.

[0151] Optionally, it is assumed that the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0152] The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the designated computing nodes in the first multi-party secure computing system, and the computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system.

[0153] As an example, the computing node P1 sends the relationship random number v1 it holds to the computing nodes S2 and Sb in the first multi-party secure computing system, so that the computing node S2 sets the local secret sharing factor x2_ according to the relationship random number v1, and the computing node Sb sets the local secret sharing factor xb_ according to the relationship random number v1; the computing node P3 sends the relationship random number v3 it holds to the computing nodes S2 and Sa in the first multi-party secure computing system, so that the computing node S2 sets the local secret sharing factor x2 according to the relationship random number v3, and the computing node Sa sets the local secret sharing factor xa according to the relationship random number v3.

[0154] The computing node P1 sends the secret sharing factor x1_aby3 to the computing nodes S1 and Sb of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1 according to the secret sharing factor x1_aby3, and the computing node Sb sets the local secret sharing factor xb according to the secret sharing factor x1_aby3; the computing node P2 sends the secret sharing factor x2_aby3 to the computing nodes S1 and Sa of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1_ according to the secret sharing factor x2_aby3, and the computing node Sa sets the local secret sharing factor xa_ according to the secret sharing factor x2_aby3.

[0155] It should be noted that the local secret sharing factors set by the computing nodes S1, S2, Sa and Sb in the first multi-party secure computing system satisfy the 2-4 secret sharing protocol, and any two computing nodes can restore the original data X based on the local secret sharing factors they hold.

[0156] Optionally, the local secret sharing factor of computing node S1 satisfies: x1=-x1_aby3, x1_=-x2_aby3; the local secret sharing factor of computing node S2 satisfies: x2=v3, x2_=v1; the local secret sharing factor of computing node Sa satisfies: xa=v3, xa_=-x2_aby3; the local secret sharing factor of computing node Sb satisfies xb=-x1_aby3, xb_=v1.

[0157] Reference Fig. 9 , shows a flowchart of the steps of another protocol conversion method provided by an embodiment of the present invention. The method is used for the secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supports the 2-4 secret sharing protocol, and the second multi-party secure computing system supports the ABY3 protocol. The method is applied to a first multi-party secure computing system, the first multi-party secure computing system includes four computing nodes, the four computing nodes include computing nodes S1, S2, Sa and Sb, and the method may specifically include the following steps:

[0158] Step 701: computing nodes S2, Sa and Sb respectively receive a relational random number sent by computing node P1 or P3 in a second multi-party secure computing system.

[0159] Step 702: The computing nodes S1, Sa, and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system.

[0160] Step 703: Each computing node sets a local secret sharing factor based on the received relationship random number and the secret sharing factor.

[0161] Step 704: Each computing node performs a secure computing task based on the local secret sharing factor it holds.

[0162] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0163] The protocol conversion method provided in the embodiment of the present invention is used to convert encrypted data satisfying the 2-4 secret sharing protocol in a first multi-party secure computing system into encrypted data satisfying the ABY3 protocol in a second multi-party secure computing system.

[0164] The computing nodes P1, P2, and P3 in the second multi-party secure computing system hold the relationship random number and the secret sharing factor of the secure computing task, and satisfy the ABY3 protocol. Optionally, assuming that the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task, then the relationship random numbers and secret sharing factors held by the computing nodes P1, P2, and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0165] Each computing node in the first multi-party secure computing system receives a relationship random number and a secret sharing factor sent by a computing node in the second multi-party secure computing system. Specifically, computing nodes S2, Sa, and Sb respectively receive a relationship random number sent by computing node P1 or P3 in the second multi-party secure computing system, and computing nodes S1, Sa, and Sb respectively receive a secret sharing factor sent by computing node P1 or P2 in the second multi-party secure computing system.

[0166] As an example, in step 701, the computing nodes S2, Sa and Sb respectively receive the relationship random numbers sent by the computing node P1 or P3 in the second multi-party secure computing system, including: the computing nodes S2 and Sb respectively receive the relationship random number v1 sent by the computing node P1 in the second multi-party secure computing system; the computing nodes S2 and Sa respectively receive the relationship random number v3 sent by the computing node P3 in the second multi-party secure computing system.

[0167] As another example, in step 702, the computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system, including: the computing nodes S1 and Sb respectively receive the secret sharing factor x1_aby3 sent by the computing node P1 in the second multi-party secure computing system; the computing nodes S1 and Sa respectively receive the secret sharing factor x2_aby3 sent by the computing node P2 in the second multi-party secure computing system.

[0168] It should be noted that the relationship random number and secret sharing factor received by each computing node in the first multi-party secure computing system meet the ABY3 protocol, but do not meet the 2-4 secret sharing protocol, and cannot be directly used by each computing node in the first multi-party secure computing system to perform secure computing tasks. Therefore, after each computing node in the first multi-party secure computing system receives the relationship random number and secret sharing factor sent by the computing node in the second multi-party secure computing system, it sets the local secret sharing factor according to the received relationship random number and secret sharing factor, so that the set secret sharing factor meets the 2-4 secret sharing protocol.

[0169] In an optional embodiment of the present invention, each computing node in step 703 sets a local secret sharing factor based on the received relationship random number and the secret sharing factor, including:

[0170] Step S51, computing node S1 sets a local secret sharing factor according to the received secret sharing factors x1_aby3 and x2_aby3, and obtains local secret sharing factors x1 and x1_, x1=-x1_aby3, x1_=-x2_aby3;

[0171] Step S51, the computing node S2 sets the local secret sharing factor according to the received relationship random numbers v1 and v3, and obtains the local secret sharing factors x2 and x2_, x2=v3, x2_=v1;

[0172] Step S51, the computing node Sa sets the local secret sharing factor according to the received relation random number v3 and the secret sharing factor x2_aby3, and obtains the local secret sharing factors xa and xa_, xa=v3, xa_=-x2_aby3;

[0173] Step S51, the computing node Sb sets the local secret sharing factor according to the received relationship random number v1 and the secret sharing factor x1_aby3, and obtains the local secret sharing factors xb and xb_, xb=-x1_aby3, xb_=v1.

[0174] In the embodiment of the present invention, after the data interaction process of the above steps 701 to 702, the computing node S1 holds the secret sharing factors x1_aby3 and x2_aby3, so the local secret sharing factors x1 and x1_ can be set to: x1=-x1_aby3, x1_=-x2_aby3. The computing node S2 holds the relationship random numbers v1 and v3, and the local secret sharing factors x2 and x2_ can be set to x2=v3, x2_=v1. The computing node Sa holds the relationship random number v3 and the secret sharing factor x2_aby3, and the local secret sharing factors xa and xa_ can be set to xa=v3, xa_=-x2_aby3. The computing node Sb holds the relationship random number v1 and the secret sharing factor x1_aby3, and the local secret sharing factors xb and xb_ can be set to xb=-x1_aby3, xb_=v1. The local secret sharing factors set by computing nodes S1, S2, Sa and Sb satisfy the 2-4 secret sharing protocol, where any two computing nodes can recover the original data X based on the local secret sharing factors they hold.

[0175] It should be noted that the embodiment of the present invention does not limit the specific setting method of setting the local secret sharing factor of each computing node in the first multi-party secure computing system, as long as the local secret sharing factor ultimately held by each computing node satisfies the 2-4 secret sharing protocol.

[0176] Finally, each computing node in the first multi-party secure computing system performs a secure computing task based on the local secret sharing factor held. When each computing node in the first multi-party secure computing system performs a secure computing task based on the random number and secret sharing factor held, the calculation is performed according to the 2-4 secret sharing protocol, and the calculation results obtained after each round of calculation are also stored in each computing node according to the 2-4 secret sharing protocol.

[0177] To summarize, the protocol conversion method provided in the embodiment of the present invention converts the relational random numbers and secret sharing factors that satisfy the ABY3 protocol held by each computing node in the second multi-party secure computing system into local secret sharing factors that satisfy the 2-4 secret sharing protocol in the first multi-party secure computing system, thereby realizing the interconnection between the first multi-party secure computing system and the second multi-party secure computing system.

[0178] It should be noted that, for the sake of simplicity, the method embodiments are described as a series of action combinations, but those skilled in the art should be aware that the embodiments of the present invention are not limited by the order of the actions described, because according to the embodiments of the present invention, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions involved are not necessarily required by the embodiments of the present invention.

[0179] Device Embodiment

[0180] Reference Fig.10 , shows a structural block diagram of a protocol conversion system of the present invention, the system may specifically include: a first multi-party secure computing system and a second multi-party secure computing system, the protocol conversion system is used for secure conversion of secret sharing factors between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol,

[0181] When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion;

[0182] The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

[0183] The first multi-party secure computing system is used to execute a protocol conversion method, the method is used for secure conversion of secret sharing factors between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supports a 2-4 secret sharing protocol, the second multi-party secure computing system supports an ABY3 protocol, and the first multi-party secure computing system includes:

[0184] 4 computing nodes, wherein the 4 computing nodes hold a first secret sharing factor of computing data to be converted for a secure computing task;

[0185] Any two computing nodes in the first multi-party secure computing system are used to calculate a relational random number according to a locally generated random number, and send the relational random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively;

[0186] The arbitrary two computing nodes are used to use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

[0187] Optionally, the arbitrary two computing nodes include a computing node S1 and a computing node S2, the random number locally generated by the computing node S1 is r_s1, and the random number locally generated by the computing node S2 is r_s2;

[0188] Computing node S1, used to send the random number r_s1 to computing node P1;

[0189] The computing node S2 is used to send the random number r_s2 to the computing node P2, so that the computing node P1 holds the relationship random number v1, v1 = r_s1, and the computing node P2 holds the relationship random number v2, v2 = r_s2;

[0190] The computing nodes S1 and S2 are further used to calculate the relational random number v3 using the random numbers r_s1 and r_s2, where v3 = -r_s1 - r_s2;

[0191] The computing node S1 or the computing node S2 is further configured to send the relationship random number v3 to the computing node P3, so that the computing node P3 holds the relationship random number v3.

[0192] Optionally, the computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, and the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, where X=x1_t0+x2_t0;

[0193] The computing nodes S1 and S2 respectively use the random numbers they hold to secretly share the first secret sharing factor x1_t0 or x2_t0, so that the computing node S1 obtains the second secret sharing factors x1_t1 and x1_t2, and the computing node S2 obtains the second secret sharing factors x2_t1 and x2_t2;

[0194] The computing node S1 is used to send the second secret sharing factor x1_t1 to the computing node P1, and send the second secret sharing factor x1_t2 to the computing node P2;

[0195] The computing node S2 is used to send the second secret sharing factor x2_t1 to the computing node P1, and send the second secret sharing factor x2_t2 to the computing node P3;

[0196] The computing nodes S1 and S2 are further used to respectively calculate the inverse of the first secret sharing factor, so that the computing node S1 obtains the second secret sharing factor x1_t3, and the computing node S2 obtains the second secret sharing factor x2_t3;

[0197] The computing node S1 is further used to send the second secret sharing factor x1_t3 to the computing node P3;

[0198] The computing node S2 is further configured to send the second secret sharing factor x2_t3 to the computing node P2.

[0199] Optionally, the second secret sharing factor x1_t1=-r_s1-x1_t0, x1_t2=r_s1-x1_t0, x1_t3=-x1_t0 obtained by the computing node S1; the second secret sharing factor x2_t1=-r_s2-x2_t0, x2_t2=r_s2-x2_t0, x2_t3=-x2_t0 obtained by the computing node S2.

[0200] The second multi-party secure computing system is used to execute a protocol conversion method, the method is used for secure conversion of secret sharing factors between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supports a 2-4 secret sharing protocol, the second multi-party secure computing system supports an ABY3 protocol, and the second multi-party secure computing system includes: computing nodes P1, P2, and P3;

[0201] The computing nodes P1, P2 and P3 are respectively used to receive a relationship random number and a second secret sharing factor sent by a computing node in a first multi-party secure computing system; the relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on a locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold;

[0202] The computing nodes P1, P2 and P3 are respectively used to perform local addition calculation using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol;

[0203] The computing nodes P1, P2 and P3 are further used to perform the secure computing task based on the held relational random number and the third secret sharing factor.

[0204] Optionally, any two computing nodes in the first multi-party secure computing system include computing node S1 and computing node S2, the random number locally generated by computing node S1 is r_s1, and the random number locally generated by computing node S2 is r_s2;

[0205] The computing node P1 is used to receive the relation random number v1 sent by the computing node S1, where v1=r_s1;

[0206] The computing node P2 is used to receive the relation random number v2 sent by the computing node S2, where v2=r_s2;

[0207] The computing node P3 is used to receive the relation random number v3 sent by the computing node S1 or the computing node S2, where v3 = -r_s1 - r_s2.

[0208] Optionally, the computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, and the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, where X=x1_t0+x2_t0;

[0209] The computing node P1 is used to receive the second secret sharing factor x1_t1 sent by the computing node S1 and the second secret sharing factor x2_t1 sent by the computing node S2, where x1_t1 = -r_s1 - x1_t0 and x2_t1 = -r_s2 - x2_t0;

[0210] The computing node P2 is used to receive the second secret sharing factor x1_t2 sent by the computing node S1 and the second secret sharing factor x2_t3 sent by the computing node S2, where x1_t2=r_s1-x1_t0 and x2_t3=-x2_t0;

[0211] The computing node P3 is used to receive the second secret sharing factor x1_t3 sent by the computing node S1 and the second secret sharing factor x2_t2 sent by the computing node S2, where x1_t3=-x1_t0 and x2_t2=r_s2-x2_t0.

[0212] Optionally, the third secret sharing factor x1_aby3 obtained by the computing node P1 is x1_aby3=-r_s1-x1_t0+r_s2-x2_t0; the third secret sharing factor x2_aby3 obtained by the computing node P2 is x2_aby3=r_s1-x1_t0-x2_t0; and the third secret sharing factor x3_aby3 obtained by the computing node P3 is x3_aby3=-x1_t0+r_s2-x2_t0.

[0213] In an optional embodiment of the present invention, the second multi-party secure computing system is used to perform another protocol conversion method, the method is used for secure conversion of secret sharing factors between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supports the 2-4 secret sharing protocol, the second multi-party secure computing system supports the ABY3 protocol, the second multi-party secure computing system includes: computing nodes P1, P2 and P3, the computing nodes P1, P2 and P3 hold secret sharing factors of computing data to be converted of the secure computing task;

[0214] The computing nodes P1 and P3 are used to send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system respectively;

[0215] The computing nodes P1 and P2 are used to send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system respectively, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

[0216] Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0217] Optionally, the computing node P1 is further used to send the relationship random number v1 held by it to the computing nodes S2 and Sb in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2_ according to the relationship random number v1, and the computing node Sb sets the local secret sharing factor xb_ according to the relationship random number v1;

[0218] The computing node P3 is also used to send the relationship random number v3 it holds to the computing nodes S2 and Sa in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2 according to the relationship random number v3, and the computing node Sa sets the local secret sharing factor xa according to the relationship random number v3.

[0219] Optionally, the computing node P1 is further used to send the secret sharing factor x1_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sb of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1 according to the secret sharing factor x1_aby3, and the computing node Sb sets the local secret sharing factor xb according to the secret sharing factor x1_aby3;

[0220] The computing node P2 is also used to send the secret sharing factor x2_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sa of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1_ according to the secret sharing factor x2_aby3, and the computing node Sa sets the local secret sharing factor xa_ according to the secret sharing factor x2_aby3.

[0221] Optionally, the local secret sharing factor of computing node S1 satisfies: x1=-x1_aby3, x1_=-x2_aby3; the local secret sharing factor of computing node S2 satisfies: x2=v3, x2_=v1; the secret sharing factor of computing node Sa satisfies: xa=v3, xa_=-x2_aby3; the secret sharing factor of computing node Sb satisfies xb=-x1_aby3, xb_=v1.

[0222] In an optional embodiment of the present invention, the first multi-party secure computing system is used to perform another protocol conversion method, the method is used for secure conversion of secret sharing factors between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supports the 2-4 secret sharing protocol, the second multi-party secure computing system supports the ABY3 protocol, the first multi-party secure computing system includes 4 computing nodes, and the 4 computing nodes include computing nodes S1, S2, Sa and Sb;

[0223] The computing nodes S2, Sa and Sb are used to respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system;

[0224] The computing nodes S1, Sa and Sb are used to respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system;

[0225] Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor;

[0226] Each computing node performs secure computing tasks based on the local secret sharing factor it holds;

[0227] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0228] Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0229] Optionally, the computing nodes S2 and Sb are further configured to respectively receive the relationship random number v1 sent by the computing node P1 in the second multi-party secure computing system;

[0230] The computing nodes S2 and Sa are further configured to respectively receive the relationship random number v3 sent by the computing node P3 in the second multi-party secure computing system.

[0231] Optionally, the computing nodes S1 and Sb are further configured to respectively receive the secret sharing factor x1_aby3 sent by the computing node P1 in the second multi-party secure computing system;

[0232] The computing nodes S1 and Sa are further configured to respectively receive the secret sharing factor x2_aby3 sent by the computing node P2 in the second multi-party secure computing system.

[0233] Optionally, the computing node S1 is further used to set a local secret sharing factor according to the received secret sharing factors x1_aby3 and x2_aby3, and obtain local secret sharing factors x1 and x1_, x1=-x1_aby3, x1_=-x2_aby3;

[0234] The computing node S2 is further used to set a local secret sharing factor according to the received relational random numbers v1 and v3, and obtain local secret sharing factors x2 and x2_, x2=v3, x2_=v1;

[0235] The computing node Sa is further used to set the local secret sharing factor according to the received relational random number v3 and the secret sharing factor x2_aby3, and obtain the local secret sharing factors xa and xa_, xa=v3, xa_=-x2_aby3;

[0236] The computing node Sb is further used to set the local secret sharing factor according to the received relational random number v1 and the secret sharing factor x1_aby3, and obtain the local secret sharing factors xb and xb_, xb=-x1_aby3, xb_=v1.

[0237] As for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0238] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.

[0239] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0240] An embodiment of the present invention provides a device for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0241] When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion;

[0242] The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

[0243] An embodiment of the present invention provides another apparatus for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The apparatus is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, and the four computing nodes hold a first secret sharing factor of computing data to be converted in a secure computing task. The apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0244] A11. Any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on a locally generated random number, and send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system respectively;

[0245] A12. Any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

[0246] Optionally, the arbitrary two computing nodes include a computing node S1 and a computing node S2, the random number locally generated by the computing node S1 is r_s1, and the random number locally generated by the computing node S2 is r_s2; any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on the locally generated random numbers, and respectively send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, including:

[0247] The computing node S1 sends the random number r_s1 to the computing node P1, and the computing node S2 sends the random number r_s2 to the computing node P2, so that the computing node P1 holds the relational random number v1, v1=r_s1, and the computing node P2 holds the relational random number v2, v2=r_s2;

[0248] The computing nodes S1 and S2 use the random numbers r_s1 and r_s2 to calculate the relational random number v3, v3 = -r_s1 - r_s2;

[0249] The computing node S1 or the computing node S2 sends the relationship random number v3 to the computing node P3, so that the computing node P3 holds the relationship random number v3.

[0250] Optionally, the computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, and the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, where X=x1_t0+x2_t0, and any two computing nodes perform data conversion on the first secret sharing factor using a locally generated random number to obtain a second secret sharing factor, and respectively send the second secret sharing factor to computing nodes P1, P2, and P3 in the second multi-party secure computing system, including:

[0251] The computing nodes S1 and S2 respectively use the random numbers they hold to secretly share the first secret sharing factor x1_t0 or x2_t0, so that the computing node S1 obtains the second secret sharing factors x1_t1 and x1_t2, and the computing node S2 obtains the second secret sharing factors x2_t1 and x2_t2;

[0252] The computing node S1 sends the second secret sharing factor x1_t1 to the computing node P1, and sends the second secret sharing factor x1_t2 to the computing node P2;

[0253] The computing node S2 sends the second secret sharing factor x2_t1 to the computing node P1, and sends the second secret sharing factor x2_t2 to the computing node P3;

[0254] The computing nodes S1 and S2 respectively calculate the inverse of the first secret sharing factor, so that the computing node S1 obtains the second secret sharing factor x1_t3, and the computing node S2 obtains the second secret sharing factor x2_t3;

[0255] The computing node S1 sends the second secret sharing factor x1_t3 to the computing node P3;

[0256] The computing node S2 sends the second secret sharing factor x2_t3 to the computing node P2.

[0257] Optionally, the second secret sharing factor x1_t1=-r_s1-x1_t0, x1_t2=r_s1-x1_t0, x1_t3=-x1_t0 obtained by the computing node S1; the second secret sharing factor x2_t1=-r_s2-x2_t0, x2_t2=r_s2-x2_t0, x2_t3=-x2_t0 obtained by the computing node S2.

[0258] An embodiment of the present invention provides another apparatus for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The apparatus is applied to the second multi-party secure computing system, and the second multi-party secure computing system includes computing nodes P1, P2, and P3. The apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0259] B11, computing nodes P1, P2 and P3 respectively receive the relationship random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system; the relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on the locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold;

[0260] B12, computing nodes P1, P2 and P3 respectively use the received second secret sharing factor to perform local addition calculation, so that computing node P1 obtains the third secret sharing factor x1_aby3, computing node P2 obtains the third secret sharing factor x2_aby3, and computing node P3 obtains x3_aby3; the relationship random number and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol;

[0261] B13, computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor.

[0262] Optionally, any two computing nodes in the first multi-party secure computing system include computing node S1 and computing node S2, the random number locally generated by computing node S1 is r_s1, the random number locally generated by computing node S2 is r_s2, and the computing nodes P1, P2 and P3 respectively receive the relationship random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including:

[0263] The computing node P1 receives the relation random number v1 sent by the computing node S1, where v1=r_s1;

[0264] The computing node P2 receives the relation random number v2 sent by the computing node S2, where v2=r_s2;

[0265] The computing node P3 receives the relation random number v3 sent by the computing node S1 or the computing node S2, where v3 = -r_s1 - r_s2.

[0266] Optionally, the computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, X=x1_t0+x2_t0, and the computing nodes P1, P2 and P3 respectively receive a relational random number and a second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including:

[0267] The computing node P1 receives the second secret sharing factor x1_t1 sent by the computing node S1 and the second secret sharing factor x2_t1 sent by the computing node S2, where x1_t1=-r_s1-x1_t0 and x2_t1=-r_s2-x2_t0;

[0268] The computing node P2 receives the second secret sharing factor x1_t2 sent by the computing node S1 and the second secret sharing factor x2_t3 sent by the computing node S2, where x1_t2=r_s1-x1_t0 and x2_t3=-x2_t0;

[0269] The computing node P3 receives the second secret sharing factor x1_t3 sent by the computing node S1 and the second secret sharing factor x2_t2 sent by the computing node S2, where x1_t3=-x1_t0 and x2_t2=r_s2-x2_t0.

[0270] Optionally, the third secret sharing factor x1_aby3 obtained by the computing node P1 is x1_aby3=-r_s1-x1_t0+r_s2-x2_t0; the third secret sharing factor x2_aby3 obtained by the computing node P2 is x2_aby3=r_s1-x1_t0-x2_t0; and the third secret sharing factor x3_aby3 obtained by the computing node P3 is x3_aby3=-x1_t0+r_s2-x2_t0.

[0271] An embodiment of the present invention provides another apparatus for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The apparatus is applied to the second multi-party secure computing system, and the second multi-party secure computing system includes computing nodes P1, P2, and P3, wherein the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted by a secure computing task, and the apparatus includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations:

[0272] C11, computing nodes P1 and P3 respectively send the held relationship random numbers to the computing nodes designated in the first multi-party secure computing system;

[0273] C12, computing nodes P1 and P2 respectively send the secret sharing factors they hold to designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

[0274] Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0275] Optionally, the computing nodes P1 and P3 respectively send the relationship random numbers they hold to a designated computing node in the first multi-party secure computing system, including:

[0276] The computing node P1 sends the relationship random number v1 held by it to the computing nodes S2 and Sb in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2_ according to the relationship random number v1, and the computing node Sb sets the local secret sharing factor xb_ according to the relationship random number v1;

[0277] The computing node P3 sends the relationship random number v3 it holds to the computing nodes S2 and Sa in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2 according to the relationship random number v3, and the computing node Sa sets the local secret sharing factor xa according to the relationship random number v3.

[0278] Optionally, the computing nodes P1 and P2 respectively send the held secret sharing factors to a designated computing node in the first multi-party secure computing system, including:

[0279] The computing node P1 sends the secret sharing factor x1_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sb of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1 according to the secret sharing factor x1_aby3, and the computing node Sb sets the local secret sharing factor xb according to the secret sharing factor x1_aby3;

[0280] The computing node P2 sends the secret sharing factor x2_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sa of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1_ according to the secret sharing factor x2_aby3, and the computing node Sa sets the local secret sharing factor xa_ according to the secret sharing factor x2_aby3.

[0281] Optionally, the local secret sharing factor of computing node S1 satisfies: x1=-x1_aby3, x1_=-x2_aby3; the local secret sharing factor of computing node S2 satisfies: x2=v3, x2_=v1; the local secret sharing factor of computing node Sa satisfies: xa=v3, xa_=-x2_aby3; the local secret sharing factor of computing node Sb satisfies xb=-x1_aby3, xb_=v1.

[0282] An embodiment of the present invention provides another device for protocol conversion, which is used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol, and the second multi-party secure computing system supports an ABY3 protocol. The device is applied to the first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, wherein the four computing nodes include computing nodes S1, S2, Sa, and Sb. The device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations:

[0283] D11, computing nodes S2, Sa and Sb respectively receive the relationship random number sent by computing node P1 or P3 in the second multi-party secure computing system;

[0284] D12, computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by computing node P1 or P2 in the second multi-party secure computing system;

[0285] D13, each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor;

[0286] D14. Each computing node performs secure computing tasks based on the local secret sharing factor it holds;

[0287] Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

[0288] Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

[0289] Optionally, the computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system, including:

[0290] The computing nodes S2 and Sb respectively receive the relationship random number v1 sent by the computing node P1 in the second multi-party secure computing system;

[0291] The computing nodes S2 and Sa respectively receive the relationship random number v3 sent by the computing node P3 in the second multi-party secure computing system.

[0292] Optionally, the computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system, including:

[0293] The computing nodes S1 and Sb respectively receive the secret sharing factor x1_aby3 sent by the computing node P1 in the second multi-party secure computing system;

[0294] The computing nodes S1 and Sa respectively receive the secret sharing factor x2_aby3 sent by the computing node P2 in the second multi-party secure computing system.

[0295] Optionally, each computing node sets a local secret sharing factor based on the received relationship random number and the secret sharing factor, including:

[0296] The computing node S1 sets the local secret sharing factor according to the received secret sharing factors x1_aby3 and x2_aby3, and obtains the local secret sharing factors x1 and x1_, x1=-x1_aby3, x1_=-x2_aby3;

[0297] The computing node S2 sets the local secret sharing factor according to the received relational random numbers v1 and v3, and obtains the local secret sharing factors x2 and x2_, x2=v3, x2_=v1;

[0298] The computing node Sa sets the local secret sharing factor according to the received relation random number v3 and the secret sharing factor x2_aby3, and obtains the local secret sharing factors xa and xa_, xa=v3, xa_=-x2_aby3;

[0299] The computing node Sb sets the local secret sharing factor according to the received relation random number v1 and the secret sharing factor x1_aby3, and obtains the local secret sharing factors xb and xb_, xb=-x1_aby3, xb_=v1.

[0300] Fig.11 8 is a block diagram of an apparatus 800 for protocol conversion according to an exemplary embodiment. For example, the apparatus 800 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, etc.

[0301] Reference Fig.11 , the device 800 may include one or more of the following components: a processing component 802 , a memory 804 , a power component 806 , a multimedia component 808 , an audio component 810 , an input / output (I / O) interface 812 , a sensor component 814 , and a communication component 816 .

[0302] The processing component 802 generally controls the overall operation of the device 800, such as operations associated with display, phone calls, data communications, camera operations, and recording operations. The processing component 802 may include one or more processors 820 to execute instructions to complete all or part of the steps of the above-mentioned method. In addition, the processing component 802 may include one or more modules to facilitate the interaction between the processing component 802 and other components. For example, the processing component 802 may include a multimedia module to facilitate the interaction between the multimedia component 808 and the processing component 802.

[0303] The memory 804 is configured to store various types of data to support operations on the device 800. Examples of such data include instructions for any application or method operating on the device 800, contact data, phone book data, messages, pictures, videos, etc. The memory 804 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.

[0304] The power supply component 806 provides power to the various components of the device 800. The power supply component 806 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device 800.

[0305] The multimedia component 808 includes a screen that provides an output interface between the device 800 and the user. In some embodiments, the screen may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from the user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundaries of the touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 808 includes a front camera and / or a rear camera. When the device 800 is in an operating mode, such as a shooting mode or a video mode, the front camera and / or the rear camera may receive external multimedia data. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

[0306] The audio component 810 is configured to output and / or input audio signals. For example, the audio component 810 includes a microphone (MIC), and when the device 800 is in an operating mode, such as a call mode, a recording mode, and a voice information processing mode, the microphone is configured to receive an external audio signal. The received audio signal can be further stored in the memory 804 or sent via the communication component 816. In some embodiments, the audio component 810 also includes a speaker for outputting audio signals.

[0307] I / O interface 812 provides an interface between processing component 802 and peripheral interface modules, such as keyboards, click wheels, buttons, etc. These buttons may include but are not limited to: home button, volume button, start button, and lock button.

[0308] The sensor assembly 814 includes one or more sensors for providing various aspects of status assessment for the device 800. For example, the sensor assembly 814 can detect the open / closed state of the device 800, the relative positioning of components, such as the display and keypad of the device 800, and the sensor assembly 814 can also detect the position change of the device 800 or a component of the device 800, the presence or absence of user contact with the device 800, the orientation or acceleration / deceleration of the device 800, and the temperature change of the device 800. The sensor assembly 814 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 814 may also include an optical sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 814 may also include an accelerometer, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

[0309] The communication component 816 is configured to facilitate wired or wireless communication between the device 800 and other devices. The device 800 can access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 816 receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 816 also includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on radio frequency information processing (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technologies.

[0310] In an exemplary embodiment, the apparatus 800 may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic components to perform the above method.

[0311] In an exemplary embodiment, a non-transitory computer-readable storage medium including instructions is also provided, such as a memory 804 including instructions, and the instructions can be executed by the processor 820 of the device 800 to perform the above method. For example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0312] Fig.12 1 is a schematic diagram of the structure of the server in some embodiments of the present invention. The server 1900 may have relatively large differences due to different configurations or performances, and may include one or more central processing units (CPU) 1922 (for example, one or more processors) and memory 1932, and one or more storage media 1930 (for example, one or more mass storage devices) storing application programs 1942 or data 1944. Among them, the memory 1932 and the storage medium 1930 can be short-term storage or permanent storage. The program stored in the storage medium 1930 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations in the server. Furthermore, the central processing unit 1922 can be configured to communicate with the storage medium 1930 and execute a series of instruction operations in the storage medium 1930 on the server 1900.

[0313] The server 1900 may also include one or more power supplies 1926, one or more wired or wireless network interfaces 1950, one or more input and output interfaces 1958, one or more keyboards 1956, and / or, one or more operating systems 1941, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.

[0314] A non-transitory computer-readable storage medium, when the instructions in the storage medium are executed by a processor of a device (server or terminal), enables the device to perform Figure 1 The protocol conversion method shown.

[0315] Those skilled in the art will readily appreciate other embodiments of the invention after considering the specification and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses or adaptations of the present invention that follow the general principles of the present invention and include common knowledge or customary techniques in the art that are not disclosed in this disclosure. The description and examples are to be considered exemplary only, and the true scope and spirit of the present invention are indicated by the following claims.

[0316] It should be understood that the present invention is not limited to the exact construction that has been described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present invention is limited only by the appended claims.

[0317] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

[0318] The above is a detailed introduction to a protocol conversion method, system and device for protocol conversion provided by the present invention. Specific examples are used in this article to illustrate the principle and implementation mode of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation mode and application scope. In summary, the content of this specification should not be understood as limiting the present invention.

Claims

1. A protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The method comprises: When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion; The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

2. A protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The method is applied to a first multi-party secure computing system, the first multi-party secure computing system includes four computing nodes, the four computing nodes hold a first secret sharing factor of computing data to be converted in a secure computing task, and the method includes: Any two computing nodes in the first multi-party secure computing system calculate a relational random number based on a locally generated random number, and send the relational random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively; The any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

3. The method according to claim 2, characterized in that The arbitrary two computing nodes include computing node S1 and computing node S2, the random number locally generated by computing node S1 is r_s1, and the random number locally generated by computing node S2 is r_s2; any two computing nodes in the first multi-party secure computing system calculate a relationship random number based on the locally generated random numbers, and send the relationship random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively, including: The computing node S1 sends the random number r_s1 to the computing node P1, and the computing node S2 sends the random number r_s2 to the computing node P2, so that the computing node P1 holds the relational random number v1, v1=r_s1, and the computing node P2 holds the relational random number v2, v2=r_s2; The computing nodes S1 and S2 use the random numbers r_s1 and r_s2 to calculate the relational random number v3, v3 = -r_s1 - r_s2; The computing node S1 or the computing node S2 sends the relationship random number v3 to the computing node P3, so that the computing node P3 holds the relationship random number v3.

4. The method according to claim 2, characterized in that: The computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, and the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, where X=x1_t0+x2_t0. Any two computing nodes perform data conversion on the first secret sharing factor using a locally generated random number to obtain a second secret sharing factor, and send the second secret sharing factor to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively, including: The computing nodes S1 and S2 respectively use the random numbers they hold to secretly share the first secret sharing factor x1_t0 or x2_t0, so that the computing node S1 obtains the second secret sharing factors x1_t1 and x1_t2, and the computing node S2 obtains the second secret sharing factors x2_t1 and x2_t2; The computing node S1 sends the second secret sharing factor x1_t1 to the computing node P1, and sends the second secret sharing factor x1_t2 to the computing node P2; The computing node S2 sends the second secret sharing factor x2_t1 to the computing node P1, and sends the second secret sharing factor x2_t2 to the computing node P3; The computing nodes S1 and S2 respectively calculate the inverse of the first secret sharing factor, so that the computing node S1 obtains the second secret sharing factor x1_t3, and the computing node S2 obtains the second secret sharing factor x2_t3; The computing node S1 sends the second secret sharing factor x1_t3 to the computing node P3; The computing node S2 sends the second secret sharing factor x2_t3 to the computing node P2.

5. The method according to claim 4, characterized in that The second secret sharing factors x1_t1=-r_s1-x1_t0, x1_t2=r_s1-x1_t0, x1_t3=-x1_t0 obtained by the computing node S1; the second secret sharing factors x2_t1=-r_s2-x2_t0, x2_t2=r_s2-x2_t0, x2_t3=-x2_t0 obtained by the computing node S2.

6. A protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The method is applied to a second multi-party secure computing system, the second multi-party secure computing system includes computing nodes P1, P2 and P3, and the method includes: The computing nodes P1, P2, and P3 respectively receive a relationship random number and a second secret sharing factor sent by a computing node in the first multi-party secure computing system; the relationship random number is obtained by any two computing nodes in the first multi-party secure computing system through calculation based on a locally generated random number, and the any two computing nodes hold the first secret sharing factor of the computing data to be converted in the secure computing task, and the second secret sharing factor is obtained by any two computing nodes performing data conversion on the first secret sharing factor using the random number they hold; The computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol; The computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor they hold.

7. The method according to claim 6, characterized in that Any two computing nodes in the first multi-party secure computing system include computing node S1 and computing node S2, the random number locally generated by computing node S1 is r_s1, the random number locally generated by computing node S2 is r_s2, and the computing nodes P1, P2 and P3 respectively receive the relationship random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including: The computing node P1 receives the relation random number v1 sent by the computing node S1, where v1=r_s1; The computing node P2 receives the relation random number v2 sent by the computing node S2, where v2=r_s2; The computing node P3 receives the relation random number v3 sent by the computing node S1 or the computing node S2, where v3 = -r_s1 - r_s2.

8. The method according to claim 7, characterized in that The computing node S1 holds a first secret sharing factor x1_t0 of the computing data X of the secure computing task, the computing node S2 holds a first secret sharing factor x2_t0 of the computing data X of the secure computing task, X=x1_t0+x2_t0, and the computing nodes P1, P2 and P3 respectively receive a relational random number and a second secret sharing factor sent by the computing nodes in the first multi-party secure computing system, including: The computing node P1 receives the second secret sharing factor x1_t1 sent by the computing node S1 and the second secret sharing factor x2_t1 sent by the computing node S2, where x1_t1=-r_s1-x1_t0 and x2_t1=-r_s2-x2_t0; The computing node P2 receives the second secret sharing factor x1_t2 sent by the computing node S1 and the second secret sharing factor x2_t3 sent by the computing node S2, where x1_t2=r_s1-x1_t0 and x2_t3=-x2_t0; The computing node P3 receives the second secret sharing factor x1_t3 sent by the computing node S1 and the second secret sharing factor x2_t2 sent by the computing node S2, where x1_t3=-x1_t0 and x2_t2=r_s2-x2_t0.

9. The method according to claim 8, characterized in that The third secret sharing factor x1_aby3 obtained by the computing node P1 is x1_aby3=-r_s1-x1_t0+r_s2-x2_t0; the third secret sharing factor x2_aby3 obtained by the computing node P2 is x2_aby3=r_s1-x1_t0-x2_t0; the third secret sharing factor x3_aby3 obtained by the computing node P3 is x3_aby3=-x1_t0+r_s2-x2_t0.

10. A protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: Applied to a second multi-party secure computing system, the second multi-party secure computing system includes computing nodes P1, P2, and P3, the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted by a secure computing task, the method includes: The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system; The computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

11. The method according to claim 10, characterized in that The computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

12. The method according to claim 11, characterized in that The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system, including: The computing node P1 sends the relationship random number v1 held by it to the computing nodes S2 and Sb in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2_ according to the relationship random number v1, and the computing node Sb sets the local secret sharing factor xb_ according to the relationship random number v1; The computing node P3 sends the relationship random number v3 it holds to the computing nodes S2 and Sa in the first multi-party secure computing system respectively, so that the computing node S2 sets the local secret sharing factor x2 according to the relationship random number v3, and the computing node Sa sets the local secret sharing factor xa according to the relationship random number v3.

13. The method according to claim 12, characterized in that The computing nodes P1 and P2 respectively send the held secret sharing factors to the designated computing nodes in the first multi-party secure computing system, including: The computing node P1 sends the secret sharing factor x1_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sb of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1 according to the secret sharing factor x1_aby3, and the computing node Sb sets the local secret sharing factor xb according to the secret sharing factor x1_aby3; The computing node P2 sends the secret sharing factor x2_aby3 of the computing data X of the secure computing task to the computing nodes S1 and Sa of the first multi-party secure computing system respectively, so that the computing node S1 sets the local secret sharing factor x1_ according to the secret sharing factor x2_aby3, and the computing node Sa sets the local secret sharing factor xa_ according to the secret sharing factor x2_aby3.

14. The method according to claim 13, characterized in that The local secret sharing factor of computing node S1 satisfies: x1=-x1_aby3, x1_=-x2_aby3; the local secret sharing factor of computing node S2 satisfies: x2=v3, x2_=v1; the local secret sharing factor of computing node Sa satisfies: xa=v3, xa_=-x2_aby3; the local secret sharing factor of computing node Sb satisfies xb=-x1_aby3, xb_=v1.

15. A protocol conversion method for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: Applied to a first multi-party secure computing system, the first multi-party secure computing system includes four computing nodes, the four computing nodes include computing nodes S1, S2, Sa and Sb, the method includes: The computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system; The computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system; Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor; Each computing node performs secure computing tasks based on the local secret sharing factor it holds; Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

16. The method according to claim 15, characterized in that The computing node P1 in the second multi-party secure computing system holds the secret sharing factor x1_aby3 and the relationship random number v1 of the computing data X of the secure computing task, the computing node P2 holds the secret sharing factor x2_aby3 and the relationship random number v2 of the computing data X of the secure computing task, and the computing node P3 holds the secret sharing factor x3_aby3 and the relationship random number v3 of the computing data X of the secure computing task; the relationship random numbers and secret sharing factors held by the computing nodes P1, P2 and P3 satisfy the following relationship: v1+v2+v3=0, x1=v3-X, x2=v1-X, x3=v2-X.

17. The method according to claim 16, characterized in that The computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system, including: The computing nodes S2 and Sb respectively receive the relationship random number v1 sent by the computing node P1 in the second multi-party secure computing system; The computing nodes S2 and Sa respectively receive the relationship random number v3 sent by the computing node P3 in the second multi-party secure computing system.

18. The method according to claim 17, characterized in that The computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system, including: The computing nodes S1 and Sb respectively receive the secret sharing factor x1_aby3 sent by the computing node P1 in the second multi-party secure computing system; The computing nodes S1 and Sa respectively receive the secret sharing factor x2_aby3 sent by the computing node P2 in the second multi-party secure computing system.

19. The method according to claim 18, characterized in that Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor, including: The computing node S1 sets the local secret sharing factor according to the received secret sharing factors x1_aby3 and x2_aby3, and obtains the local secret sharing factors x1 and x1_, x1=-x1_aby3, x1_=-x2_aby3; The computing node S2 sets the local secret sharing factor according to the received relational random numbers v1 and v3, and obtains the local secret sharing factors x2 and x2_, x2=v3, x2_=v1; The computing node Sa sets the local secret sharing factor according to the received relation random number v3 and the secret sharing factor x2_aby3, and obtains the local secret sharing factors xa and xa_, xa=v3, xa_=-x2_aby3; The computing node Sb sets the local secret sharing factor according to the received relation random number v1 and the secret sharing factor x1_aby3, and obtains the local secret sharing factors xb and xb_, xb=-x1_aby3, xb_=v1.

20. A device for protocol conversion, used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The device includes a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors. The one or more programs include instructions for performing the following operations: When it is determined that the secure computing task satisfies the preset conversion condition, the computing node in the first multi-party secure computing system or the computing node in the second multi-party secure computing system performs data conversion on the secret sharing factor of the computing data to be converted in the secure computing task, and sends the secret sharing factor after the data conversion to the computing node in the other multi-party secure computing system, so that the computing node in the other multi-party secure computing system executes the secure computing task based on the secret sharing factor after the data conversion; The preset conversion condition includes: in the first multi-party secure computing system and the second multi-party secure computing system, there is only one computing node in the multi-party secure computing system that holds the secret sharing factor of the computing data to be converted in the secure computing task.

21. A device for protocol conversion, used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The invention is applied to a first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, wherein the four computing nodes hold a first secret sharing factor of computing data to be converted by a secure computing task, and the device includes a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations: Any two computing nodes in the first multi-party secure computing system calculate a relational random number based on a locally generated random number, and send the relational random number to computing nodes P1, P2, and P3 in the second multi-party secure computing system, respectively; The any two computing nodes use locally generated random numbers to perform data conversion on the first secret sharing factor to obtain a second secret sharing factor, and send the second secret sharing factor to the computing nodes P1, P2 and P3 in the second multi-party secure computing system respectively, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system perform the secure computing task based on the received relational random number and the second secret sharing factor.

22. A device for protocol conversion, used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: Applied to a second multi-party secure computing system, the second multi-party secure computing system includes computing nodes P1, P2 and P3, the device includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, and the one or more programs include instructions for performing the following operations: The computing nodes P1, P2 and P3 respectively receive the relation random number and the second secret sharing factor sent by the computing nodes in the first multi-party secure computing system; The relationship random number is obtained by calculating between any two computing nodes in the first multi-party secure computing system based on a locally generated random number, the any two computing nodes hold a first secret sharing factor of the computing data to be converted of the secure computing task, and the second secret sharing factor is obtained by converting the first secret sharing factor by the any two computing nodes using the random numbers they hold; The computing nodes P1, P2 and P3 respectively perform local addition calculations using the received second secret sharing factor, so that the computing node P1 obtains the third secret sharing factor x1_aby3, the computing node P2 obtains the third secret sharing factor x2_aby3, and the computing node P3 obtains x3_aby3; the relational random numbers and the third secret sharing factors obtained by the computing nodes P1, P2 and P3 satisfy the ABY3 protocol; The computing nodes P1, P2 and P3 perform the secure computing task based on the relationship random number and the third secret sharing factor they hold.

23. A device for protocol conversion, used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The invention is applied to a second multi-party secure computing system, wherein the second multi-party secure computing system includes computing nodes P1, P2, and P3, wherein the computing nodes P1, P2, and P3 hold secret sharing factors of computing data to be converted by a secure computing task, and the device includes a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations: The computing nodes P1 and P3 respectively send the relationship random numbers they hold to the computing nodes designated in the first multi-party secure computing system; The computing nodes P1 and P2 respectively send the secret sharing factors they hold to the designated computing nodes in the first multi-party secure computing system, so that each computing node in the first multi-party secure computing system performs the secure computing task based on the received relational random number and secret sharing factor.

24. A device for protocol conversion, used for secure conversion of secret sharing factors between a first multi-party secure computing system and a second multi-party secure computing system, wherein the first multi-party secure computing system supports a 2-4 secret sharing protocol and the second multi-party secure computing system supports an ABY3 protocol, characterized in that: The invention is applied to a first multi-party secure computing system, wherein the first multi-party secure computing system includes four computing nodes, wherein the four computing nodes include computing nodes S1, S2, Sa and Sb, and the device includes a memory and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by one or more processors, wherein the one or more programs include instructions for performing the following operations: The computing nodes S2, Sa and Sb respectively receive the relationship random number sent by the computing node P1 or P3 in the second multi-party secure computing system; The computing nodes S1, Sa and Sb respectively receive the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system; Each computing node sets a local secret sharing factor based on the received relational random number and the secret sharing factor; Each computing node performs secure computing tasks based on the local secret sharing factor it holds; Among them, the relationship random number and secret sharing factor held by each computing node in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

25. A machine-readable medium having instructions stored thereon, which, when executed by one or more processors, causes a device to perform the protocol conversion method according to any one of claims 1 to 19.

Images