CN114978489A

CN114978489A - Protocol conversion method, system and device for protocol conversion

Info

Publication number: CN114978489A
Application number: CN202210485785.0A
Authority: CN
Inventors: 王天雨
Original assignee: Huakong Tsingjiao Information Technology Beijing Co Ltd
Current assignee: Huakong Tsingjiao Information Technology Beijing Co Ltd
Priority date: 2022-05-06
Filing date: 2022-05-06
Publication date: 2022-08-30

Abstract

The embodiment of the invention provides a protocol conversion method, a system and a device for protocol conversion. The method comprises the following steps: under the condition that the security computing task meets the preset conversion condition, a computing node in a first multi-party security computing system or a computing node in a second multi-party security computing system performs data conversion on a secret sharing factor of computing data to be converted of the security computing task, and sends the secret sharing factor after the data conversion to a computing node in another multi-party security computing system, so that the computing node in the other multi-party security computing system executes the security 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 invention realizes the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system.

Description

Protocol conversion method, system and device for protocol conversion

Technical Field

The present invention relates to the technical field of multiparty security computing, and in particular, to a protocol conversion method, system and device for protocol conversion.

Background

With the development of multi-party secure computing technology in recent years, the demand for interconnection and intercommunication among multi-party secure computing systems is increasing. The most core problem of interconnection and intercommunication among multi-party security computing systems is to solve interconnection and intercommunication of different secret sharing protocols under the condition of ensuring data security. For example, assume two multi-party secure computing systems A, 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 protocol followed by the multi-party secure computing system a is different from that followed by the multi-party secure computing system B, and the data generated by the multi-party secure computing system a cannot be applied to the multi-party secure system B. Therefore, how to implement data sharing among the multi-party security systems A, B conforming to different secret sharing protocols becomes a key for implementing interconnection and interworking among the multi-party security systems A, B.

Disclosure of Invention

Embodiments of the present invention provide a protocol conversion method, a protocol conversion system, and a device for protocol conversion, which can implement secure conversion of a secret sharing factor between two multi-party secure computing systems supporting different protocols, and implement interconnection and intercommunication between the multi-party secure computing systems.

In order to solve the above problem, an embodiment of the present invention discloses a protocol conversion method for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, where 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 including:

under the condition that the security computing task meets the preset conversion condition, a computing node in a first multi-party security computing system or a computing node in a second multi-party security computing system performs data conversion on a secret sharing factor of computing data to be converted of the security computing task, and sends the secret sharing factor after the data conversion to a computing node in another multi-party security computing system, so that the computing node in the other multi-party security computing system executes the security computing task based on the secret sharing factor after the data conversion;

wherein the preset conversion condition comprises: and in the first multi-party secure computing system and the second multi-party secure computing system, one and only one computing node in the multi-party secure computing system holds a secret sharing factor of the computing data to be converted of the secure computing task.

The embodiment of the invention discloses another protocol conversion method, which is used for the security conversion of secret sharing factors between a first multi-party security computing system and a second multi-party security computing system, wherein the first multi-party security computing system supports a 2-4 secret sharing protocol, the second multi-party security computing system supports an ABY3 protocol, the method is applied to the first multi-party security computing system, the first multi-party security computing system comprises 4 computing nodes, the 4 computing nodes hold first secret sharing factors of computing data to be converted of security computing tasks, and the method comprises the following steps:

any 2 computing nodes in the first multi-party security computing system calculate relation random numbers according to locally generated random numbers and respectively send the relation random numbers to computing nodes P1, P2 and P3 in the second multi-party security computing system;

the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor by 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, so that the computing nodes P1, P2, and P3 in the second multi-party secure computing system execute the secure computing task based on the received relational random number and the second secret sharing factor.

The embodiment of the invention discloses a protocol conversion method, which is used for the secure conversion of a secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, the method is applied to the second multi-party secure computing system, the second multi-party secure computing system comprises computing nodes P1, P2 and P3, and the method comprises the following steps:

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; the relational random number is obtained by calculating any 2 computing nodes in the first multi-party secure computing system based on locally generated random numbers, the any 2 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, and the second secret sharing factor is obtained by performing data conversion on the first secret sharing factor by the any 2 computing nodes by using the held random numbers;

the computing nodes P1, P2 and P3 respectively use the received second secret sharing factors to carry out local addition computation, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 meet the ABY3 protocol;

compute nodes P1, P2, and P3 perform the secure compute task based on the held relationship random number and a third secret sharing factor.

The embodiment of the invention discloses another protocol conversion method, which is used for the security conversion of secret sharing factors between a first multi-party security computing system and a second multi-party security computing system, wherein the first multi-party security computing system supports a 2-4 secret sharing protocol, the second multi-party security computing system supports an ABY3 protocol, and the protocol conversion method is applied to the second multi-party security computing system, the second multi-party security computing system comprises computing nodes P1, P2 and P3, the computing nodes P1, P2 and P3 hold the secret sharing factors of computing data to be converted of security computing tasks, and the method comprises the following steps:

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

compute nodes P1 and P2 each send the held secret sharing factor to a designated compute node in a first multi-party secure computing system to cause each compute node in the first multi-party secure computing system to perform the secure compute task based on the received relational random number and secret sharing factor.

The embodiment of the invention discloses a protocol conversion method, which is used for the secure conversion of a secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, the method is applied to the first multi-party secure computing system, the first multi-party secure computing system comprises 4 computing nodes, the 4 computing nodes comprise computing nodes S1, S2, Sa and Sb, and the method comprises the following steps:

the computing nodes S2, Sa and Sb respectively receive the relation random numbers sent by the computing nodes 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 relationship random number and the secret sharing factor;

each computing node executes a safe computing task based on the held local secret sharing factor;

wherein the relational random numbers and the secret sharing factors held by the computing nodes in the second multi-party secure computing system satisfy the ABY3 secret sharing protocol.

In another aspect, an embodiment of the present invention discloses an apparatus for protocol conversion for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the apparatus comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:

The embodiment of the invention discloses another device for protocol conversion, which is used for the security conversion of a secret sharing factor between a first multi-party security computing system and a second multi-party security 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, the apparatus applies to a first multi-party secured computing system, the first multi-party secured computing system comprising 4 computing nodes, the 4 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, the device comprises a memory and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors include instructions for:

The embodiment of the invention discloses a device for protocol conversion, which is used for the secure conversion of a secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, the device is applied to the second multi-party secure computing system, the second multi-party secure computing system comprises computing nodes P1, P2 and P3, the device comprises a memory and one or more programs, one or more programs are stored in the memory, and the one or more programs are configured to be executed by one or more processors and comprise instructions for:

the computing nodes P1, P2 and P3 respectively use the received second secret sharing factors to perform local addition computation, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 meet the ABY3 protocol;

The embodiment of the invention provides another device for protocol conversion, which is used for the secure conversion of the secret sharing factor 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, the apparatus applies to a second multi-party secured computing system, the second multi-party secured computing system including compute nodes P1, P2, and P3, the computing nodes P1, P2 and P3 hold secret sharing factors of computing data to be converted by the secure computing tasks, the device comprises a memory and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors include instructions for:

An embodiment of the present invention provides a device for protocol conversion, which is used for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting 2-4 secret sharing protocols, the second multi-party secure computing system supporting ABY3 protocols, the device being applied to the first multi-party secure computing system, the first multi-party secure computing system comprising 4 computing nodes, the 4 computing nodes comprising computing nodes S1, S2, Sa and Sb, the device comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising instructions for:

In yet another aspect, an embodiment of the invention discloses a machine-readable medium having stored thereon instructions, which, when executed by one or more processors, cause an apparatus to perform a protocol conversion method as described in one or more of the preceding.

The embodiment of the invention has the following advantages:

the protocol conversion method provided by the embodiment of the invention has the advantages that under the condition that the safety calculation task to be executed meets the preset condition, namely when one or 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 secure computing task, the computing node in the multi-party secure computing system holding the secret sharing factor, performing data conversion on the secret sharing factor, sending the secret sharing factor after data conversion to a computing node in another multi-party secure computing system, a computing node in the other multi-party secure computing system may perform a secure computing task based on receiving the secret sharing factor, therefore, the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system are realized.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor.

FIG. 1 is a flow chart of the steps of one embodiment of a protocol conversion method of the present invention;

FIG. 2 is a schematic diagram of secret sharing in a first multi-party secure computing system of the present invention;

FIG. 3 is a schematic diagram of secret sharing in a second multi-party secure computing system of the present invention;

FIG. 4 is a flow chart of the steps of a protocol conversion method of the present invention;

FIG. 5 is a flow chart of steps of another protocol conversion method of the present invention;

FIG. 6 is a flow chart of steps of yet another protocol conversion method of the present invention;

FIG. 7 is a flow chart of the steps of yet another protocol conversion method of the present invention;

FIG. 8 is a flow chart of steps of another protocol conversion method of the present invention;

FIG. 9 is a flow chart of the steps of yet another protocol conversion method of the present invention;

FIG. 10 is a block diagram of a protocol conversion system of the present invention;

FIG. 11 is a block diagram of an apparatus 800 for protocol conversion in accordance with the present invention;

fig. 12 is a schematic diagram of a server in some embodiments of the invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Method embodiment

Referring to fig. 1, a flowchart illustrating steps of an embodiment of a protocol conversion method according to the present invention is shown, where the method is used for secure conversion of a secret sharing factor 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, the second multi-party secure computing system supports an abb 3 (arithmetric-Binary-Yao-3, secure three-party computing) protocol, and the method specifically includes the following steps:

step 101, under the condition that the security computing task meets the preset conversion condition, a computing node in a first multi-party security computing system or a computing node in a second multi-party security computing system performs data conversion on a secret sharing factor of computing data to be converted of the security computing task.

And 102, sending the secret sharing factor after the 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 executes the secure computing task based on the secret sharing factor after the data conversion.

It should be noted that the protocol conversion method provided by the embodiment of the present invention may be applied to a multi-party secure computing system, and specifically may be 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 security computing system and the second multi-party security computing system in the invention are both computing systems for protecting data privacy security, and comprise a plurality of participants. Under the premise of not revealing the data of the participants, the multiple participants can use the multi-party safety computing technology to carry out collaborative computing to obtain computing results, and the computed data, the intermediate results and the final results can be guaranteed not to be revealed. The participators of the multi-party security computing can comprise a task control node and computing nodes, wherein the task control node is used for scheduling the computing nodes to execute security computing tasks, and the computing nodes perform collaborative computing based on secret sharing factors held by the computing nodes to complete the security computing tasks.

Further, the multi-party secure computing system may further include a data node for providing services such as data storage, data provision, computation result storage, and the like. The multi-party security computing system may further include a result acquirer for acquiring the computing result from the computing node, where the result acquirer may be a specified certain data node or certain data nodes.

The secure computing tasks executed by the computing nodes in the multi-party secure computing system may be computer program codes implemented by a preset programming language, and the multi-party secure computing system may implement corresponding computing functions by executing the computer program codes. The secure computing task includes, but is not limited to: and data related operations such as calculation, cleaning, analysis, model training, storage, database query and the like of the data are realized based on the ciphertext. It is to be understood that embodiments of the present invention do not impose limitations on the specific types of secure computing tasks.

A secure computation task may include any type of mathematical computation, such as four arithmetic computations (e.g., addition, subtraction, multiplication, division), logical computations (e.g., and, or, xor), etc.

It is understood that, in the embodiment of the present invention, the calculation data of the secure calculation task may be any data that is not convenient for disclosure, and may include, but is not limited to, data representing personal information of the user, business secrets, model parameters of a neural network model, and the like.

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.

Wherein, the first multi-party secure computing system comprises 4 computing nodes, respectively computing nodes S1, S2, Sa, and Sb. Referring to fig. 2, a schematic diagram of secret sharing of a first multiparty secure computing system according to an embodiment of the present invention is shown. As shown in fig. 2, in the first multiparty secure computing system, it is assumed that a data party holds data X, and the data party performs secret sharing on the data X once to obtain two secret sharing factors X1 and X2, where X is X1+ X2, and the data party sends the secret sharing factor X1 to computing nodes S1 and S2. The computing nodes S1 and S2 perform a second secret analysis operation, respectively, and specifically, the computing nodes S1 and S2 generate random numbers r _ S1 and r _ S2, respectively, and r _ S1 is r _ S2, respectively, based on the held seed r _12 and the pseudo-random number function. Then, the computing nodes S1 and S2 respectively share the secret with the secret sharing factor using the locally generated random numbers, where the computing node S1 obtains the secret sharing factor x1_, x1_ ═ x1-r _ S1, and the computing node S2 obtains the secret sharing factor x2_, x2_ ═ x2+ r _ S2. The computing node S1 sends the secret sharing factor x1_ to the computing node Sa and sends the secret sharing factor x1 to the computing node Sb; the computing node S2 sends the secret sharing factor x2 to the computing node Sa and sends the secret sharing factor x2_ to the computing node Sb. After receiving the secret sharing factor sent by the computing nodes S1 and S2, the computing nodes Sa and Sb perform local setting. Illustratively, the computation node S2 sets xa — x2, xa — x 1; the computation node Sb sets xb — x1 and xb — x 2. Through the above processing, the computing node S1 holds secret sharing factors x1 and x1_, the computing node S2 holds secret sharing factors x2 and x2_, the computing node Sa holds secret sharing factors x2 and x1_, and the computing node Sb holds secret sharing factors x1 and x2 _. Any 2 of the 4 compute nodes may recover the original data X based on the held secret sharing factor. When each computing node in the first multi-party secure computing system executes a secure computing task based on the held random number and the secret sharing factor, computing is performed according to a 2-4 secret sharing protocol, and computing results obtained after each round of computing are stored in each computing node according to the 2-4 secret sharing protocol.

The second multi-party secured computing system includes 3 compute nodes, compute nodes P1, P2, and P3, respectively. Referring to fig. 3, a schematic diagram of secret sharing of a second multiparty secure computing system according to an embodiment of the present invention is shown. As shown in fig. 3, in the second multiparty security computing system, it is assumed that a data party holds data Y and holds relational random numbers v1, v2, and v3, and v1+ v2+ v3 is 0. And the data party shares the data Y in a secret manner by using the relational random number, and secret sharing factors Y1, Y2 and Y3 are obtained, wherein Y1 is v3-Y, Y2 is v1-Y, and Y3 is v 2-Y. Then, the data side sends the relationship random numbers v1, v2 and v3 and the secret sharing factors y1, y2 and y3 to the computing nodes P1, P2 and P3. Through the secret sharing operation, the computing node P1 holds the relationship random number v1 and the secret sharing factor y1, the computing node P2 holds the relationship random number v2 and the secret sharing factor y2, and the computing node P3 holds the relationship random number v3 and the secret sharing factor y 3. When each computing node in the second multi-party secure computing system executes the secure computing task based on the held relation random number and the secret sharing factor, the computing is performed according to the ABY3 protocol, and computing results obtained after each computation are stored in each computing node according to the ABY3 protocol.

Because the first multi-party secure computing system and the second multi-party secure computing system support different protocols respectively and have different secret sharing forms of data, the two systems cannot directly share data and cannot be interconnected. In order to solve the problem and achieve interconnection and interworking between a first multi-party secure computing system and a second multi-party secure computing system, an embodiment of the present invention provides a protocol conversion method for performing protocol conversion on encrypted data between two systems, so that one of the systems can perform a secure computing task by using encrypted data provided by the other system.

Specifically, under the condition that the to-be-executed security computing task meets the preset condition, that is, one or only one of the first multi-party security computing system and the second multi-party security computing system holds the secret sharing factor of the computing data to be converted of the security computing task, and the computing nodes in the multi-party security computing system holding the secret sharing factor, performing data conversion on the locally generated random number and the secret sharing factor, and sending the random number and the secret sharing factor after the data conversion to a computing node in another multi-party secure computing system, the computing node in the other multi-party secure computing system may perform a secure computing task based on the received random number and the secret sharing factor, therefore, the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system are realized.

It can be understood that the computing data to be converted by the security computing task in the invention is determined according to the secret sharing factor held by the two systems and the multi-party security computing system executing the security computing task. For example, assuming that a first multi-party secure computing system holds a secret sharing factor of computation data X of a secure computation task and a second multi-party secure computing system holds a secret sharing factor of computation data Y of a secure computation task, if the secure computation task is executed in the first multi-party secure computing system, the computation data to be converted is Y, and if the secure computation task is executed in the second multi-party secure computing system, the computation data to be converted is X.

As an example, if a computing node in a first multi-party security system holds a first secret sharing factor of computing data to be converted for a secure computing task, a random number and the first secret sharing factor that conform to the 2-4 secret sharing protocol may be converted into a relational random number and a third secret sharing factor that conform to the ABY3 protocol by performing a data conversion process on the random number and the first secret sharing factor held by the computing node in the first multi-party security computing system, so that a second multi-party security computing system can execute the secure computing task based on the relational random number and the third secret sharing factor. The protocol conversion method provided by the embodiment of the invention can realize data sharing between the first multi-party secure computing system and the second multi-party secure computing system which support different protocols, and realize interconnection of the two systems.

Referring to fig. 4, a flowchart illustrating steps of a protocol conversion method according to the present invention is shown, where the method is used for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, where 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, where the method may specifically include the following steps:

step 201, any 2 computing nodes in the first multi-party secure computing system calculate the relation random number according to the locally generated random number, and respectively send the relation random number to the computing nodes P1, P2 and P3 in the second multi-party secure computing system.

Step 202, the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor of the computing data of the secure computing task by using the locally generated random number to obtain a second secret sharing factor, and respectively send the second secret sharing factor to the computing nodes P1, P2, and P3 in the second multiparty secure computing system.

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.

Step 204, the computing nodes P1, P2 and P3 respectively perform local addition computation by using the received second secret sharing factor, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 meet the ABY3 protocol;

step 205, compute nodes P1, P2, and P3 perform the secure compute task based on the held relationship random number and the third secret sharing factor.

In the embodiment of the present invention, since any 2 computing nodes in the first multi-party secure computing system can recover the original data based on the held secret sharing factor, if the random number and the first secret sharing factor held by the computing node in the first multi-party secure computing system are converted into the relational random number and the second secret sharing factor conforming to the ABY3 protocol, only the random number and the first secret sharing factor of any 2 computing nodes in the first multi-party secure computing system need to be subjected to data conversion. For example, the embodiment of the present invention does not specifically limit the combination manner of any 2 computing nodes in the first multi-party secure computing system, such as performing data conversion on the random numbers of the computing nodes S1 and S2 and the first secret sharing factor, or performing data conversion on the random numbers of the computing nodes S1 and Sa and the first secret sharing factor.

Any 2 compute nodes in the first multi-party secure computing system compute relational random numbers v1, v2, and v3 from locally generated random numbers and send the resulting relational random numbers to compute nodes P1, P2, and P3, respectively, in the second multi-party secure computing system. It should be noted that, in the embodiment of the present invention, a specific calculation manner for the calculation node in the first multiparty secure computing system to calculate the relational random number is not limited, as long as the obtained relational random number satisfies the ABY3 protocol, that is, v1+ v2+ v3 is equal to 0.

Then, the 2 computing nodes generating the relational random numbers perform data conversion on the held first secret sharing factors by using the locally generated random numbers respectively to obtain second secret sharing factors, and send the second secret sharing factors to the computing nodes P1, P2 and P3 in the second multiparty secure computing system respectively.

After each computing node in the second multi-party secure computing system receives the relationship random number and the secret sharing factor sent by the computing node in the first multi-party secure computing system, local addition calculation is respectively carried out on the received second secret sharing factor to obtain a third secret sharing factor. The computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the third secret sharing factor obtained by the computing nodes P1, P2 and P3 satisfies the ABY3 protocol.

Finally, compute nodes P1, P2, and P3 in the second multi-party secure computing system perform secure computing tasks based on the held relationship random number and the third secret sharing factor.

Through 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 and are held by any 2 computing nodes in the first multi-party secure computing system into the relational random number and the third secret sharing factor that satisfy the ABY3 protocol, thereby implementing interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system.

Referring to fig. 5, a flowchart illustrating steps of another protocol conversion method according to an embodiment of the present invention is shown. The method is used for secure conversion of a secret sharing factor between 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 method is applied to a first multi-party secure computing system, the first multi-party secure computing system comprises 4 computing nodes, the 4 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, and the method specifically comprises the following steps:

step 301, any 2 computing nodes in the first multi-party secure computing system calculate the relationship random number according to the locally generated random number, and respectively send the relationship random number to the computing nodes P1, P2, and P3 in the second multi-party secure computing system.

Step 302, the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor by using a locally generated random number to obtain a 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 execute the secure computing task based on the received relational random number and the second secret sharing factor.

The protocol conversion method provided by the embodiment of the invention is used for converting the encrypted data meeting the 2-4 secret sharing protocol in the first multi-party secure computing system into the encrypted data meeting the ABY3 protocol in the second multi-party secure computing system. Wherein, 4 computing nodes of the first multi-party security computing system all hold a first secret sharing factor of computing data to be converted of the security computing task. Because any 2 computing nodes in the first multi-party secure computing system can recover original data based on the held secret sharing factors, only the random numbers of any 2 computing nodes in the first multi-party secure computing system and the first secret sharing factors need to be subjected to data conversion when protocol conversion is performed. It should be noted that, the combination manner of any 2 computing nodes in the first multiparty secure computing system is not specifically limited in the embodiment of the present invention, for example, the any 2 computing nodes may be computing nodes S1 and S2, or computing nodes S1 and Sa, computing nodes Sa and Sb, and the like.

Any 2 compute nodes in the first multi-party secure computing system compute relational random numbers v1, v2, and v3 from locally generated random numbers and send the resulting relational random numbers to compute nodes P1, P2, and P3, respectively, in the second multi-party secure computing system. It should be noted that, in the embodiment of the present invention, a specific calculation manner of the relational random number is not limited, as long as the obtained relational random number satisfies the ABY3 protocol, that is, v1+ v2+ v3 is equal to 0.

Then, the 2 computing nodes generating the relational random numbers perform data conversion on the held first secret sharing factors by using the locally generated random numbers respectively to obtain second secret sharing factors, and send the second secret sharing factors 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 execute security computing tasks based on the received relational random numbers and the second secret sharing factors.

The following takes the computing nodes S1 and S2 in the first multi-party secure computing system as an example, and describes a specific process of data conversion between the held random number and the first secret sharing factor by any 2 computing nodes in the first multi-party secure computing system.

In an optional embodiment of the present invention, the arbitrary 2 computing nodes include a computing node S1 and a computing node S2, and step 301 of calculating a relational random number by the arbitrary 2 computing nodes in the first multi-party secure computing system according to a locally generated random number and sending the relational random number to computing nodes P1, P2 and P3 in the second multi-party secure computing system, respectively, includes:

step S11, the computing node S1 sends the random number r _ S1 to the computing node P1, 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, the computing node P2 holds the relational random number v2, v2 ═ r _ S2;

step S12, the computation nodes S1 and S2 compute the relational random number v3 using the random numbers r _ S1 and r _ S2, v3 ═ r _ S1-r _ S2;

step S13, compute node S1, or compute node S2 sends the relational random number v3 to compute node P3 so that compute node P3 holds relational random number v 3.

In the embodiment of the present invention, it is assumed that the random number locally generated by the computing node S1 based on the held seed r _12 and the pseudo random function is r _ S1, the random number locally generated by the computing node S2 based on the held seed r _12 and the pseudo random function is r _ S2, and r _ S1 is r _ S2. Where compute node S1 sends random number r _ S1 to compute node P1 in the second multi-party secured computing system, compute node S2 sends random number r _ S2 to compute node P2 in the second multi-party secured computing system. The computing nodes P1 and P2 set the received random numbers as local relational random numbers, and assume that the relational random number of the computing node P1 is v1 and the relational random number of the computing node P2 is v2, then v1 is r _ s1, and v2 is r _ s 2.

The computing nodes S1 and S2 compute the relational random number v3 using the random numbers r _ S1 and r _ S2 and send the relational random number v3 to the computing node P3 in the second multi-party secure computing system, v3 being-r _ S1-r _ S2, by the computing node S1 or the computing node S2.

It should be noted that, in the embodiment of the present invention, the relationships between the relational random numbers v1, v2, v3 and the random numbers r _ S1, r _ S2 locally generated by the computing nodes S1 and S2 are not limited to the relational expressions 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 is equal to 0.

In an optional embodiment of the present invention, 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, in step 302, the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor by using a locally generated random number to obtain second secret sharing factors, and respectively send the second secret sharing factors to the computing nodes P1, P2, and P3 in the second multiparty secure computing system, including:

step S21, the computing nodes S1 and S2 respectively perform secret sharing on the first secret sharing factor x1_ t0 or x2_ t0 by using the held random numbers, so that the computing node S1 obtains second secret sharing factors x1_ t1 and x1_ t2, and the computing node S2 obtains second secret sharing factors x2_ t1 and x2_ t 2;

step S22, 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;

step S23, 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;

step S24, calculating nodes S1 and S2 respectively calculate the inverse numbers of the first secret sharing factor, so that the calculating node S1 obtains a second secret sharing factor x1_ t3, and the calculating node S2 obtains a second secret sharing factor x2_ t 3;

step S25, the computing node S1 sends the second secret sharing factor x1_ t3 to the computing node P3;

in step S26, the compute node S2 sends the second secret sharing factor x2_ t3 to the compute node P2.

When the data conversion is performed on the first secret sharing factor, the computing node S1 performs secret sharing on the first secret sharing factor x1_ t0 by using the random number r _ S1, and obtains second secret sharing factors x1_ t1 and x1_ t 2. The computing node S1 inverts the first secret sharing factor x1_ t0, and the second secret sharing factors x1_ t3 and x1_ t3 are the inverses of x1_ t 0. Optionally, the second secret sharing factor x1_ t1 obtained by the computing node S1 is-r _ S1-x1_ t0, x1_ t2 is-r _ S1-x1_ t0, and x1_ t3 is-x 1_ t 0. The computing node S1 sends the second secret sharing factor x1_ t1 to the computing node P1, sends the second secret sharing factor x1_ t2 to the computing node P2, and sends the second secret sharing factor x1_ t3 to the computing node P3.

The computing node S2 shares the first secret sharing factor x2_ t0 with the random number r _ S2 to obtain second secret sharing factors x2_ t1 and x2_ t 2. The computing node S2 inverts the first secret sharing factor x2_ t0, and the second secret sharing factors x2_ t3 and x2_ t3 are the inverses of x2_ t 0. Optionally, the second secret sharing factor x2_ t1 obtained by the computing node S2 is-r _ S2-x2_ t0, x2_ t2 is-r _ S2-x2_ t0, and x2_ t3 is-x 2_ t 0. 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.

It should be noted that the second secret sharing factor obtained by the above processing of the computing nodes S1 and S2 in the first multi-party secure computing system does not satisfy the ABY3 protocol, and each computing node in the second multi-party secure computing system needs to locally process the received second secret sharing factor.

Referring to fig. 6, a flowchart illustrating steps of another protocol conversion method provided in an embodiment of the present invention is shown. The method is used for secure conversion of a secret sharing factor between 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 method is applied to a second multi-party security computing system, the second multi-party security computing system comprises computing nodes P1, P2 and P3, and the method specifically comprises the following steps:

step 401, 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.

Step 402, local addition calculation is carried out on the calculation nodes P1, P2 and P3 by respectively utilizing the received second secret sharing factors, so that the calculation node P1 obtains a third secret sharing factor x1_ aby3, the calculation node P2 obtains a third secret sharing factor x2_ aby3, and the calculation node P3 obtains x3_ aby 3; the relational random numbers and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 meet the ABY3 protocol.

Step 403, compute nodes P1, P2, and P3 perform secure compute tasks based on the held relationship random number and the third secret sharing factor.

The protocol conversion method provided by the embodiment of the invention is used for converting the encrypted data meeting the 2-4 secret sharing protocol in the first multi-party secure computing system into the encrypted data meeting the ABY3 protocol in the second multi-party secure computing system.

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. The relational random number is obtained by calculating any 2 computing nodes in the first multi-party secure computing system based on a locally generated random number, the any 2 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, and the second secret sharing factor is obtained by performing data conversion on the first secret sharing factor by the any 2 computing nodes by using the held random number.

Next, the computing nodes P1, P2, and P3 in the second multi-party secure computing system respectively perform local addition computation using the received second secret sharing factor to obtain a third secret sharing factor. It should be noted that the third secret sharing factor obtained by the computing nodes P1, P2 and P3 satisfies the ABY3 protocol.

Finally, compute nodes P1, P2, and P3 perform secure compute tasks based on the held relationship random number and the third secret sharing factor. It should be noted that, when each computing node in the second multiparty secure computing system executes the secure computing task based on the held random number of relationships and the secret sharing factor, the computing is performed according to the ABY3 protocol, and the computing result obtained after each round of computing is also stored in each computing node according to the ABY3 protocol.

The following description will be made of specific operations performed by each compute node in the second multi-party secure computing system, taking as an example that compute nodes S1 and S2 in the first multi-party secure computing system send the relational random number and the second secret sharing factor to each compute node in the second multi-party secure computing system.

In an optional embodiment of the present invention, any 2 computing nodes in the first multi-party secure computing system include computing node S1 and computing node S2, where 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 in step 401 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:

step S31, the computing node P1 receives the relation random number v1 sent by the computing node S1, where v1 is r _ S1;

step S32, the computing node P2 receives the relation random number v2 sent by the computing node S2, where v2 is r _ S2;

in step S33, the computing node P3 receives the relational random number v3, v 3-r _ S1-r _ S2 sent by the computing node S1 or the computing node S2.

In the second multi-party secured computing system, upon receiving the relational random number transmitted from the computing node in the first multi-party secured computing system, computing node P1 is for receiving relational random number v1 transmitted by computing node S1, computing node P2 is for receiving relational random number v2 transmitted by computing node S2, and computing node P3 is for receiving relational random number v3 transmitted by computing node S1 or S2. Alternatively, v 1-r _ s1, v 2-r _ s2, v 3-r _ s1-r _ s 2.

In an optional embodiment of the invention, 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, X ═ X1_ t0+ X2_ t0 of the computing data X of the secure computing task, and the computing nodes P1, P2, and P3 in step 401 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:

step S41, 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 is-r _ S1-x1_ t0, and x2_ t1 is-r _ S2-x2_ t 0;

step S42, 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 is r _ S1-x1_ t0, and x2_ t3 is x2_ t 0;

in 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, x1_ t3 ═ x1_ t0, and x2_ t2 ═ r _ S2-x2_ t0 sent by the computing node S2.

In the second multiparty secure computing system, the computing node P2 is configured 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, the computing node P2 is configured 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, and the computing node P3 is configured 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. Alternatively, 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, and x2_ t2 ═ r _ s2-x2_ t 0.

Through the above processing, the computing node P1 in the second multi-party secure computing system holds the relational random number v1 and the second secret sharing factors x1_ t1 and x2_ t1, the computing node P2 holds the relational random number v2 and the second secret sharing factors x1_ t2 and x2_ t3, and the computing node P3 holds the relational random number v3 and the second secret sharing factors x2_ t2 and x1_ t 3.

Next, compute nodes P1, P2, and P3 in the second multi-party secured computing system perform local addition computations based on the second secret sharing factor held to obtain a third secret sharing factor that satisfies the ABY3 protocol.

Assuming that the third secret sharing factor obtained by the computing node P1 is x1_ aby3, the third secret sharing factor obtained by the computing node P2 is x2_ aby3, and the third secret sharing factor obtained by the computing node P3 is x3_ aby3, each third secret sharing factor may satisfy the following conditions: a third secret sharing factor x1_ aby3 obtained by the computing node P1 ═ -r _ s1-x1_ t0+ r _ s2-x2_ t 0; a third secret sharing factor x2_ aby3 obtained by the computing node P2, r _ s1-x1_ t0-x2_ t 0; the third secret sharing factor x3_ aby3 obtained by the computing node P3 is-x 1_ t0+ r _ s2-x2_ t 0.

In summary, 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 and are held by any 2 computing nodes in the first multi-party secure computing system into the relational random number and the third secret sharing factor that satisfy the ABY3 protocol, thereby implementing interconnection and interworking between the first multi-party secure computing system and the second multi-party secure computing system.

The protocol conversion method provided by the invention can convert the random number and the first secret sharing factor which accord with the 2-4 secret sharing protocol into the relation random number and the third secret sharing factor which accord with the ABY3 protocol, and can also convert the relation random number and the secret sharing factor which accord with the ABY3 protocol into the random number and the secret sharing factor which accord with the 2-4 secret sharing protocol.

Referring to fig. 7, a flowchart illustrating steps of still another protocol conversion method according to an embodiment of the present invention is shown. The method is used for the secure conversion of the secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, and the method specifically comprises the following steps:

step 501, compute nodes P1 and P3 send the held relational random numbers to designated compute nodes in the first multi-party secure computing system, respectively.

Step 502, compute nodes P1 and P2 send the held secret sharing factor to the designated compute node in the first multi-party secure computing system, respectively.

Step 503, compute node S2, Sa and Sb receive the relational random numbers sent by compute node P1 or P3, respectively, in the second multi-party secured computing system.

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

And 505, each computing node sets a local secret sharing factor based on the received relationship random number and the secret sharing factor.

And step 506, each computing node executes the safe computing task based on the held local secret sharing factor.

In an embodiment of the present invention, the first multi-party secure computing system comprises compute nodes S1, S2, Sa, and Sb, the second multi-party secure computing system comprises compute nodes P1, P2, and P3, and compute nodes P1, P2, and P3 hold secret sharing factors of the relational random numbers and the compute data to be converted for the secure compute task. Wherein, the compute nodes P1 and P3 respectively send the held relational random numbers to designated compute nodes in the first multi-party secure computing system, and the compute nodes P1 and P2 respectively send the held secret sharing factors to designated compute nodes in the first multi-party secure computing system. Illustratively, compute node P1 sends the holding relationship nonce to compute nodes S2 and Sb in the first multi-party secure computing system, compute node P3 sends the holding relationship nonce to compute nodes S2 and Sa in the first multi-party secure computing system; the computing node P1 sends the held secret sharing factor to the computing nodes S1 and Sb, and the computing node P2 sends the held secret sharing factor to the computing nodes S1 and Sa.

For each compute node in the first multi-party secured computing system, compute nodes S2, Sa, and Sb are used to receive the relational random numbers sent by compute node P1 or P3 in the second multi-party secured computing system; the compute nodes S1, Sa, and Sb are used to receive the secret sharing factor sent by the compute node P1 or P2 in the second multi-party secure computing system. Then, each computing node in the first multi-party secure computing system respectively sets the received relational random number and the secret sharing factor to obtain a local secret sharing factor meeting the 2-4 secret sharing protocol, and executes a secure computing task based on the held local secret sharing factor.

Through the above steps, in the embodiment of the present invention, each computing node in the second multi-party secure computing system holds the relationship random number and the secret sharing factor that satisfy the ABY3 protocol, and converts the relationship random number and the secret sharing factor into the random number and the local secret sharing factor that satisfy the 2-4 secret sharing protocol in the first multi-party secure computing system, thereby achieving the interconnection and intercommunication between the first multi-party secure computing system and the second multi-party secure computing system.

Referring to fig. 8, a flowchart illustrating steps of another protocol conversion method provided in an embodiment of the present invention is shown. The method is used for secure conversion of a secret sharing factor between 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 method is applied to a second multi-party secure computing system, and specifically comprises the following steps:

step 601, compute nodes P1 and P3 send the held relational random numbers to designated compute nodes in the first multi-party secure computing system, respectively.

Step 602, computing nodes P1 and P2 send the held secret sharing factor to 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 a secure computing task based on the received relational random number and secret sharing factor.

The protocol conversion method provided by the embodiment of the invention is used for converting the encrypted data meeting the ABY3 protocol in the second multi-party secure computing system into the encrypted data meeting the 2-4 secret sharing protocol in the first multi-party secure computing system. Wherein the first multi-party secured computing system includes computing nodes S1, S2, Sa, and Sb. The second multi-party secure computing system includes compute nodes P1, P2, and P3, the compute nodes P1, P2, and P3 hold secret sharing factors for compute data to be converted for secure compute tasks and satisfy the ABY3 protocol.

Optionally, suppose that a computing node P1 in the second multi-party secure computing system holds a secret sharing factor X1_ aby3 and a relational random number v1 of the computation data X of the secure computation task, a computing node P2 holds a secret sharing factor X2_ aby3 and a relational random number v2 of the computation data X of the secure computation task, and a computing node P3 holds a secret sharing factor X3_ aby3 and a relational random number v3 of the computation data X of the secure computation task; the random number of relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

Compute nodes P1 and P3 each send a held relationship nonce to a designated compute node in the first multi-party secured computing system, and compute nodes P1 and P2 each send a held secret sharing factor to a designated compute node in the first multi-party secured computing system.

As an example, the computing node P1 sends the held relational random number v1 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 _accordingto the relational random number v1, and the computing node Sb sets the local secret sharing factor xb _accordingto the relational random number v 1; the computing node P3 sends the held relational random number v3 to the computing nodes S2 and Sa in the first multiparty secure computing system, respectively, so that the computing node S2 sets a local secret sharing factor x2 according to the relational random number v3, and the computing node Sa sets a local secret sharing factor xa according to the relational random number v 3.

The computing node P1 sends the secret sharing factor x1_ aby3 to computing nodes S1 and Sb of the first multi-party secure computing system respectively, so that the computing node S1 sets a local secret sharing factor x1 according to the secret sharing factor x1_ aby3, and the computing node Sb sets a local secret sharing factor xb according to the secret sharing factor x1_ aby 3; 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 _accordingto the secret sharing factor x2_ aby3, and the computing node Sa sets the local secret sharing factor xa _accordingto the secret sharing factor x2_ aby 3.

It should be noted that the local secret sharing factors set by the computing nodes S1, S2, Sa, and Sb in the first multiparty secure computing system satisfy the 2-4 secret sharing protocol, and any 2 of the computing nodes can recover the original data X based on the held local secret sharing factors.

Optionally, the local secret sharing factor of the computing node S1 satisfies: x1 ═ x1_ aby3, x1 ═ x2_ aby 3; the local secret sharing factor of the computing node S2 satisfies: x2 ═ v3, x2 ═ v 1; the local secret sharing factor of the computing node Sa satisfies the following conditions: xa-v 3, xa-x 2_ aby 3; the local secret sharing factor of the computing node Sb satisfies xb-x 1_ aby3, xb _ v 1.

Referring to fig. 9, a flowchart illustrating steps of another protocol conversion method according to an embodiment of the present invention is shown. The method is used for secure conversion of a secret sharing factor between 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 method is applied to a first multi-party secure computing system, the first multi-party secure computing system comprises 4 computing nodes, the 4 computing nodes comprise computing nodes S1, S2, Sa and Sb, and the method specifically comprises the following steps:

step 701, compute node S2, Sa and Sb receive the relational random numbers sent by compute node P1 or P3 in the second multi-party secured computing system, respectively.

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

And 703, each computing node sets a local secret sharing factor based on the received relationship random number and the secret sharing factor.

And 704, executing the safety computing task by each computing node based on the held local secret sharing factor.

The compute nodes P1, P2, P3 in the second multi-party secure compute system hold secret sharing factors for the relational random numbers and the secure compute tasks and satisfy the ABY3 protocol. Alternatively, assuming that the computing node P1 in the second multi-party secure computing system holds the secret sharing factor X1_ aby3 and the relational 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 relational 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 relational random number v3 of the computing data X of the secure computing task, the relational random numbers and the secret sharing factors held by the computing nodes P1, P2, and P3 satisfy the following relationships: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

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

As an example, the computing nodes S2, Sa and Sb in step 701 respectively receive the relational random numbers sent by the computing node P1 or P3 in the second multi-party secure computing system, and include: the computing nodes S2 and Sb respectively receive the relation random number v1 sent by the computing node P1 in the second multi-party secure computing system; the compute nodes S2 and Sa receive the relational random numbers v3, respectively, sent by the compute node P3 in the second multi-party secured computing system.

As another example, the step 702 of the computing nodes S1, Sa and Sb receiving the secret sharing factor sent by the computing node P1 or P2 in the second multi-party secure computing system respectively includes: 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 compute nodes S1 and Sa receive the secret sharing factor x2_ aby3 sent by the compute node P2 in the second multi-party secure computing system, respectively.

It should be noted that the relational random numbers and the secret sharing factors received by the computing nodes in the first multi-party secure computing system satisfy the ABY3 protocol and do not satisfy the 2-4 secret sharing protocol, and cannot be directly used by the computing nodes in the first multi-party secure computing system to perform the secure computing task. Therefore, after each computing node in the first multi-party secure computing system receives the relationship random number and the secret sharing factor sent by the computing node in the second multi-party secure computing system, the local secret sharing factor is set according to the received relationship random number and the secret sharing factor, so that the set secret sharing factor meets the 2-4 secret sharing protocol.

In an optional embodiment of the present invention, in step 703, setting, by each computing node, a local secret sharing factor based on the received relationship random number and the secret sharing factor includes:

step S51, the 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, and x1 ═ x2_ aby 3;

step S51, the computing node S2 sets a local secret sharing factor according to the received relational random numbers v1 and v3, to obtain local secret sharing factors x2 and x2, x2 ═ v3, and x2 ═ v 1;

step S51, the compute node Sa sets a local secret sharing factor according to the received relationship random number v3 and the secret sharing factor x2_ aby3, and obtains local secret sharing factors xa and xa _, xa _ ═ v3, xa _ ═ x2_ aby 3;

in step S51, the computing node Sb sets the local secret sharing factor according to the received relational random number v1 and the secret sharing factor x1_ aby3, to obtain local secret sharing factors xb and xb _, xb ═ x1_ aby3, and xb _ ═ v 1.

In the embodiment of the present invention, through the data interaction process of the foregoing steps 701 to 701, the computing node S1 holds the secret sharing factors x1_ aby3 and x2_ aby3, so that the local secret sharing factors x1 and x1_ can be set as: x1 ═ x1_ aby3, x1 ═ x2_ aby 3. The compute node S2 holds relational random numbers v1 and v3, and may set local secret sharing factors x2 and x2_ to x2 ═ v3 and x2 ═ v 1. The computing node Sa holds a relational random number v3 and a secret sharing factor x2_ aby3, and local secret sharing factors xa and xa _ can be set to xa ═ v3 and xa ═ x2_ aby 3. The computing node Sb holds a relational random number v1 and a secret sharing factor x1_ aby3, and may set local secret sharing factors xb and xb _ to xb-x 1_ aby3 and xb-v 1. The local secret sharing factors set by the computing nodes S1, S2, Sa and Sb satisfy the 2-4 secret sharing protocol, wherein any 2 computing nodes can recover the original data X based on the held local secret sharing factors.

It should be noted that, the specific setting manner of setting the local secret sharing factor for each computing node in the first multi-party secure computing system in the embodiment of the present invention is not limited, as long as the local secret sharing factor finally held by each computing node satisfies the 2-4 secret sharing protocol.

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

In summary, the protocol conversion method provided in the embodiment of the present invention converts the relationship random number and the secret sharing factor that satisfy the ABY3 protocol and are held by each computing node in the second multi-party secure computing system into the local secret sharing factor that satisfies the 2-4 secret sharing protocol in the first multi-party secure computing system, thereby implementing interconnection and interworking between the first multi-party secure computing system and the second multi-party secure computing system.

It should be noted that, for simplicity of description, the method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the illustrated order of acts, as some steps may occur in other orders or concurrently in accordance with the embodiments of the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.

Device embodiment

Referring to fig. 10, a block diagram of a protocol conversion system according to the present invention is shown, where the system may specifically include: a first multi-party secure computing system and a second multi-party secure computing system, the protocol conversion system for secure conversion of a secret sharing factor between the first multi-party secure computing system and the second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol,

Wherein the first multi-party secure computing system is configured to perform a protocol translation method for secure translation of a secret sharing factor between the first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the first multi-party secure computing system comprising:

4 computing nodes, wherein the 4 computing nodes hold a first secret sharing factor of computing data to be converted of a security computing task;

any 2 computing nodes in the first multi-party security computing system, configured to compute a relation random number according to a locally generated random number, and send the relation random number to computing nodes P1, P2, and P3 in the second multi-party security computing system, respectively;

the arbitrary 2 computing nodes are configured to perform data conversion on the first secret sharing factor by 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, so that the computing nodes P1, P2, and P3 in the second multi-party secure computing system execute the secure computing task based on the received relational random number and the second secret sharing factor.

Optionally, the 2 arbitrary compute nodes include compute node S1 and compute node S2, the locally generated random number of the compute node S1 is r _ S1, the locally generated random number of the compute node S2 is r _ S2;

a computing node S1 for sending the random number r _ S1 to a computing node P1;

a computing node S2, configured to send 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;

computing nodes S1 and S2, further for computing the relational random numbers v3, v 3-r _ S1-r _ S2 using the random numbers r _ S1 and r _ S2;

the computing node S1 or the computing node S2 is further configured to send the relational random number v3 to the computing node P3, such that the computing node P3 holds the relational random number v 3.

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 is X1_ t0+ X2_ t 0;

the computing nodes S1 and S2 respectively use the held random numbers to perform secret sharing on the first secret sharing factor x1_ t0 or x2_ t0, so that the computing node S1 obtains second secret sharing factors x1_ t1 and x1_ t2, and the computing node S2 obtains second secret sharing factors x2_ t1 and x2_ t 2;

the computing node S1 is configured 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;

the computing node S2 is configured 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;

the calculation nodes S1 and S2 are further configured to calculate the inverse numbers of the first secret sharing factor, respectively, so that the calculation node S1 obtains a second secret sharing factor x1_ t3, and the calculation node S2 obtains a second secret sharing factor x2_ t 3;

the computing node S1 is further configured to send the second secret sharing factor x1_ t3 to the computing node P3;

the compute node S2 is further configured to send the second secret sharing factor x2_ t3 to the compute node P2.

Optionally, the second secret sharing factor x1_ t1 obtained by the computing node S1 is-r _ S1-x1_ t0, x1_ t2 is r _ S1-x1_ t0, and x1_ t3 is-x 1_ t 0; the second secret sharing factor x2_ t1 obtained by the computing node S2 is-r _ S2-x2_ t0, x2_ t2 is r _ S2-x2_ t0, and x2_ t3 is-x 2_ t 0.

The second multi-party secure computing system is configured to perform a protocol translation method for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the second multi-party secure computing system comprising: compute nodes P1, P2, and P3;

the computing nodes P1, P2 and P3 are respectively used for receiving the relationship random number and the second secret sharing factor sent by the computing node in the first multi-party secure computing system; the relational random number is obtained by calculating any 2 computing nodes in the first multi-party secure computing system based on locally generated random numbers, the any 2 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, and the second secret sharing factor is obtained by performing data conversion on the first secret sharing factor by the any 2 computing nodes by using the held random numbers;

the computing nodes P1, P2, and P3 are respectively configured to perform local addition computation by using the received second secret sharing factor, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the calculation nodes P1, P2 and P3 meet the ABY3 protocol;

compute nodes P1, P2, and P3 are also to perform the secure compute task based on the held relationship random number and a third secret sharing factor.

Optionally, any 2 computing nodes in the first multi-party secured computing system include computing node S1 and computing node S2, the random number generated locally by computing node S1 is r _ S1, and the random number generated locally by computing node S2 is r _ S2;

a computing node P1, configured to receive the relational random number v1 sent by the computing node S1, where v1 is r _ S1;

a computing node P2, configured to receive the relational random number v2 sent by the computing node S2, where v2 is r _ S2;

a computing node P3, configured to receive the relational random number v3, v3 ═ r _ S1-r _ S2 sent by the computing node S1 or the computing node S2.

a computing node P1, configured 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 is-r _ S1-x1_ t0, and x2_ t1 is-r _ S2-x2_ t 0;

a computing node P2, configured 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 is r _ S1-x1_ t0, and x2_ t3 is-x 2_ t 0;

and the computing node P3 is configured 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 is-x 1_ t0, and x2_ t2 is r _ S2-x2_ t 0.

Optionally, the computing node P1 obtains a third secret sharing factor x1_ aby3 ═ r _ s1-x1_ t0+ r _ s2-x2_ t 0; a third secret sharing factor x2_ aby3 obtained by the computing node P2, r _ s1-x1_ t0-x2_ t 0; the third secret sharing factor x3_ aby3 obtained by the computing node P3 is-x 1_ t0+ r _ s2-x2_ t 0.

In an optional embodiment of the invention, the second multi-party secure computing system is configured to perform another protocol conversion method for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the second multi-party secure computing system comprising: computing nodes P1, P2, and P3, the computing nodes P1, P2, and P3 holding secret sharing factors for computing data to be converted by secure computing tasks;

compute nodes P1 and P3 for sending, respectively, the held relational random numbers to designated compute nodes in the first multi-party secure computing system;

compute nodes P1 and P2, for respectively sending the held secret sharing factor to designated compute nodes in a first multi-party secure computing system, so that each compute node in the first multi-party secure computing system performs the secure compute task based on the received relational random number and secret sharing factor.

Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor X1_ aby3 and the relational 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 relational random number v2 of the computing data X of the secure computing task, the computing node P3 holds the secret sharing factor X3_ aby3 and the relational random number v3 of the computing data X of the secure computing task; the random numbers of the relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

Optionally, the computing node P1 is further configured to send the held relational random number v1 to computing nodes S2 and Sb in the first multi-party secure computing system, respectively, so that the computing node S2 sets a local secret sharing factor x2 _accordingto the relational random number v1, and the computing node Sb sets a local secret sharing factor xb _accordingto the relational random number v 1;

the computing node P3 is further configured to send the held relational random number v3 to the computing nodes S2 and Sa in the first multiparty secure computing system, respectively, so that the computing node S2 sets a local secret sharing factor x2 according to the relational random number v3, and the computing node Sa sets a local secret sharing factor xa according to the relational random number v 3.

Optionally, the computing node P1 is further configured to send a secret sharing factor X1_ aby3 of the computing data X of the secure computing task to computing nodes S1 and Sb of the first multi-party secure computing system, respectively, so that the computing node S1 sets a local secret sharing factor X1 according to the secret sharing factor X1_ aby3, and the computing node Sb sets a local secret sharing factor xb according to the secret sharing factor X1_ aby 3;

the computing node P2 is further configured 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 _accordingto the secret sharing factor X2_ aby3, and the computing node Sa sets the local secret sharing factor xa _accordingto the secret sharing factor X2_ aby 3.

Optionally, the local secret sharing factor of the computing node S1 satisfies: x1 ═ x1_ aby3, x1 ═ x2_ aby 3; the local secret sharing factor of the computing node S2 satisfies: x2 ═ v3, x2 ═ v 1; the secret sharing factor of the computing node Sa satisfies the following conditions: xa-v 3, xa-x 2_ aby 3; the secret sharing factor of the computing node Sb satisfies xb-x 1_ aby3 and xb _ v 1.

In an optional embodiment of the present invention, the first multi-party secure computing system is configured to perform another protocol conversion method for secure conversion of a secret sharing factor between the first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the first multi-party secure computing system comprising 4 compute nodes, the 4 compute nodes comprising compute nodes S1, S2, Sa, and Sb;

the computing nodes S2, Sa and Sb are used for respectively receiving the relation random numbers sent by the computing nodes P1 or P3 in the second multi-party secure computing system;

the computing nodes S1, Sa and Sb are used for respectively receiving the secret sharing factors sent by the computing node P1 or P2 in the second multiparty security computing system;

each computing node sets a local secret sharing factor based on the received relation random number and the secret sharing factor;

Optionally, the computing node P1 in the second multi-party secure computing system holds the secret sharing factor X1_ aby3 and the relational 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 relational random number v2 of the computing data X of the secure computing task, the computing node P3 holds the secret sharing factor X3_ aby3 and the relational random number v3 of the computing data X of the secure computing task; the random number of relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

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

the computation nodes S2 and Sa are also used for respectively receiving the relational random numbers v3 sent by the computation node P3 in the second multi-party security computing system.

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

the computing nodes S1 and Sa are also used for respectively receiving the secret sharing factor x2_ aby3 sent by the computing node P2 in the second multi-party secure computing system.

Optionally, the computing node S1 is further configured to set a local secret sharing factor according to the received secret sharing factors x1_ aby3 and x2_ aby3, to obtain local secret sharing factors x1 and x1 ″, x1 ═ x1_ aby3, and x1 ═ x2_ aby 3;

the computing node S2 is further configured to set a local secret sharing factor according to the received relational random numbers v1 and v3, to obtain local secret sharing factors x2 and x2_, x2 ═ v3, and x2 ═ v 1;

the computing node Sa is further configured to set a local secret sharing factor according to the received relational random number v3 and the secret sharing factor x2_ aby3, so as to obtain local secret sharing factors xa and xa _, xa ═ v3, xa _ — x2_ aby 3;

the computing node Sb is further configured to set a local secret sharing factor according to the received relational random number v1 and the secret sharing factor x1_ aby3, to obtain local secret sharing factors xb and xb _, xb ═ x1_ aby3, xb _ ═ v 1.

For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.

The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.

With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

An embodiment of the present invention provides an apparatus for protocol translation for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the apparatus comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by one or more processors, the one or more programs comprising instructions for:

The embodiment of the invention provides another device for protocol conversion, which is used for the secure conversion of the secret sharing factor 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, the apparatus applies to a first multi-party secured computing system, the first multi-party secured computing system comprising 4 computing nodes, the 4 computing nodes hold a first secret sharing factor of computing data to be converted of the safe computing task, the device comprises a memory and one or more than one program, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors include instructions for:

a11, any 2 computation nodes in the first multi-party security computing system compute relationship random numbers according to locally generated random numbers and respectively send the relationship random numbers to computation nodes P1, P2 and P3 in the second multi-party security computing system;

a12, the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor by 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, so that the computing nodes P1, P2 and P3 in the second multi-party secure computing system execute the secure computing task based on the received relational random number and the second secret sharing factor.

Optionally, the 2 arbitrary compute nodes include compute node S1 and compute node S2, the locally generated random number of the compute node S1 is r _ S1, the locally generated random number of the compute node S2 is r _ S2; any 2 computing nodes in the first multi-party secure computing system calculate the relation random number according to the locally generated random number, and respectively send the relation random number to computing nodes P1, P2 and P3 in the second multi-party secure computing system, including:

the computing node S1 sends the random number r _ S1 to the computing node P1, 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, the computing node P2 holds the relational random number v2, v2 ═ r _ S2;

the computation nodes S1 and S2 compute the relational random numbers v3, v3 ═ r _ S1-r _ S2, using the random numbers r _ S1 and r _ S2;

the compute node S1 or the compute node S2 sends the relational random number v3 to the compute node P3 so that the compute node P3 holds the relational random number v 3.

Optionally, the computing node S1 holds a first secret sharing factor X1_ t0 of the computation data X of the secure computation task, the computing node S2 holds a first secret sharing factor X2_ t0 of the computation data X of the secure computation task, X ═ X1_ t0+ X2_ t0, and the arbitrary 2 computing nodes perform data conversion on the first secret sharing factor by using a locally generated random number to obtain second secret sharing factors, and respectively send the second secret sharing factors to the computing nodes P1, P2, and P3 in the second multiparty secure computation system, where the method includes:

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 calculation nodes S1 and S2 respectively calculate the inverse numbers of the first secret sharing factor, so that the calculation node S1 obtains a second secret sharing factor x1_ t3, and the calculation node S2 obtains a second secret sharing factor x2_ t 3;

the computing node S1 sends the second secret sharing factor x1_ t3 to the computing node P3;

the compute node S2 sends the second secret sharing factor x2_ t3 to the compute node P2.

An embodiment of the present invention provides yet another apparatus for protocol conversion for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the apparatus being applied to a second multi-party secure computing system, the second multi-party secure computing system comprising computing nodes P1, P2 and P3, the apparatus comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by one or more processors, the one or more programs comprising instructions for:

b11, P1, P2 and P3 respectively receive the relation random number and the second secret sharing factor sent by the computing node in the first multi-party secure computing system; the relational random number is obtained by calculating any 2 computing nodes in the first multi-party secure computing system based on a locally generated random number, the any 2 computing nodes hold a first secret sharing factor of computing data to be converted of a secure computing task, and the second secret sharing factor is obtained by performing data conversion on the first secret sharing factor by the any 2 computing nodes by using the held random number;

b12, computing nodes P1, P2 and P3 respectively use the received second secret sharing factors to carry out local addition computation, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the computing nodes P1, P2 and P3 meet the ABY3 protocol;

b13, compute nodes P1, P2, and P3 perform the secure compute task based on the held relationship random number and a third secret sharing factor.

Optionally, the 2 computing nodes in the first multi-party secure computing system include a computing node S1 and a computing node S2, the random number locally generated by the computing node S1 is r _ S1, the random number locally generated by the computing node S2 is r _ S2, and the computing nodes P1, P2, and P3 respectively receive the relational random number and the second secret sharing factor sent by the computing node 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, wherein v1 is r _ S1;

the computing node P2 receives the relation random number v2 sent by the computing node S2, wherein v2 is r _ S2;

the computing node P3 receives the relational random number v3, v3 ═ r _ S1-r _ S2 sent by the computing node S1 or the computing node S2.

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 the relational 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 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 is-r _ S1-x1_ t0, and x2_ t1 is-r _ S2-x2_ t 0;

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 is r _ S1-x1_ t0, and x2_ t3 is x2_ t 0;

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 is-x 1_ t0, and x2_ t2 is r _ S2-x2_ t 0.

c11, compute nodes P1 and P3 respectively send the held relational random numbers to the compute nodes designated in the first multi-party secure compute system;

c12, compute nodes P1 and P2 each send the held secret sharing factor to a designated compute node in a first multi-party secure computing system to cause each compute node in the first multi-party secure computing system to perform the secure compute task based on the received relational random number and secret sharing factor.

Optionally, the computing nodes P1 and P3 respectively send the held relationship random numbers to designated computing nodes in the first multi-party secure computing system, including:

the calculation node P1 sends the held relational random number v1 to calculation nodes S2 and Sb in the first multi-party secure calculation system, respectively, so that the calculation node S2 sets a local secret sharing factor x2 a according to the relational random number v1, and the calculation node Sb sets a local secret sharing factor xb a according to the relational random number v 1;

the computing node P3 sends the held relational random number v3 to the computing nodes S2 and Sa in the first multiparty security computing system, respectively, so that the computing node S2 sets a local secret sharing factor x2 according to the relational random number v3, and the computing node Sa sets a local secret sharing factor xa according to the relational random number v 3.

Optionally, the computing nodes P1 and P2 respectively send the held secret sharing factor to a designated computing node 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 a local secret sharing factor X1 according to the secret sharing factor X1_ aby3, and the computing node Sb sets a local secret sharing factor xb according to the secret sharing factor X1_ aby 3;

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 a local secret sharing factor X1_ according to the secret sharing factor X2_ aby3, and the computing node Sa sets a local secret sharing factor xa _ according to the secret sharing factor X2_ aby 3.

d11, compute node S2, Sa and Sb receive the relational random numbers sent by compute node P1 or P3 in the second multi-party secured computing system, respectively;

d12, compute node S1, Sa and Sb receive the secret sharing factor sent by compute node P1 or P2 in the second multi-party secure computing system, respectively;

d13, each computing node sets a local secret sharing factor based on the received relationship random number and the secret sharing factor;

d14, each computing node executes a safety computing task based on the held local secret sharing factor;

Optionally, a compute node P1 in the second multi-party secure computing system holds a secret sharing factor X1_ aby3 and a relational random number v1 of the compute data X of the secure compute task, a compute node P2 holds a secret sharing factor X2_ aby3 and a relational random number v2 of the compute data X of the secure compute task, a compute node P3 holds a secret sharing factor X3_ aby3 and a relational random number v3 of the compute data X of the secure compute task; the random numbers of the relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

Optionally, the computing nodes S2, Sa and Sb receive the relational random numbers sent by the computing node P1 or P3 in the second multi-party secure computing system, respectively, and include:

the computing nodes S2 and Sb respectively receive the relation random number v1 sent by the computing node P1 in the second multi-party secure computing system;

the computation nodes S2 and Sa respectively receive the relation random number v3 sent by the computation node P3 in the second multiparty secure computing system.

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

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 compute nodes S1 and Sa receive the secret sharing factor x2_ aby3 sent by the compute node P2 in the second multi-party secure computing system, respectively.

Optionally, the setting, by each computing node, a local secret sharing factor based on the received relationship random number and the secret sharing factor includes:

the 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, and x1 ═ x2_ aby 3;

the computing node S2 sets a local secret sharing factor according to the received relational random numbers v1 and v3, to obtain local secret sharing factors x2 and x2_, x2 ═ v3, and x2 ═ v 1;

the calculation node Sa sets a local secret sharing factor according to the received relationship random number v3 and the secret sharing factor x2_ aby3, and obtains local secret sharing factors xa and xa _, xa ═ v3, xa _ ═ x2_ aby 3;

the computing node Sb sets the local secret sharing factor according to the received relational random number v1 and the secret sharing factor x1_ aby3, to obtain local secret sharing factors xb and xb _, xb ═ x1_ aby3, xb _ ═ v 1.

Fig. 11 is a block diagram illustrating an apparatus 800 for protocol conversion in accordance with an example 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, an exercise device, a personal digital assistant, and the like.

Referring to fig. 11, the apparatus 800 may include one or more of the following components: processing component 802, memory 804, power component 806, multimedia component 808, audio component 810, input/output (I/O) interface 812, sensor component 814, and communication component 816.

The processing component 802 generally controls overall operation of the device 800, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing elements 802 may include one or more processors 820 to execute instructions to perform all or a portion of the steps of the methods described above. Further, the processing component 802 can include one or more modules that facilitate interaction between the processing component 802 and other components. For example, the processing component 802 can include a multimedia module to facilitate interaction between the multimedia component 808 and the processing component 802.

The memory 804 is configured to store various types of data to support operation at the device 800. Examples of such data include instructions for any application or method operating on device 800, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 804 may be implemented by any type or combination of volatile or non-volatile memory devices 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 or optical disks.

Power components 806 provide power to the various components of device 800. The power components 806 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the apparatus 800.

The multimedia component 808 includes a screen that provides an output interface between the device 800 and a 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 an input signal from a 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 boundary of a 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 facing camera and/or a rear facing camera. The front-facing camera and/or the rear-facing camera may receive external multimedia data when the device 800 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

The audio component 810 is configured to output and/or input audio signals. For example, the audio component 810 includes a Microphone (MIC) configured to receive external audio signals when the apparatus 800 is in an operational mode, such as a call mode, a recording mode, and a voice information processing mode. The received audio signals may further be stored in the memory 804 or transmitted via the communication component 816. In some embodiments, audio component 810 also includes a speaker for outputting audio signals.

The I/O interface 812 provides an interface between the processing component 802 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.

The sensor assembly 814 includes one or more sensors for providing various aspects of state assessment for the device 800. For example, the sensor assembly 814 may detect the open/closed state of the device 800, the relative positioning of components, such as a display and keypad of the apparatus 800, the sensor assembly 814 may also detect a change in position of the apparatus 800 or a component of the apparatus 800, the presence or absence of user contact with the apparatus 800, orientation or acceleration/deceleration of the apparatus 800, and a change in temperature of the apparatus 800. 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 a light 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 acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

The communication component 816 is configured to facilitate communications between the apparatus 800 and other devices in a wired or wireless manner. The device 800 may 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 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may 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.

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, micro-controllers, microprocessors or other electronic components for performing the above-described methods.

In an exemplary embodiment, a non-transitory computer-readable storage medium comprising instructions, such as the memory 804 comprising instructions, executable by the processor 820 of the device 800 to perform the above-described method is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

Fig. 12 is a schematic diagram of a server in some embodiments of the invention. The server 1900, which may vary considerably in configuration or performance, may include one or more Central Processing Units (CPUs) 1922 (e.g., one or more processors) and memory 1932, one or more storage media 1930 (e.g., one or more mass storage devices) storing applications 1942 or data 1944. Memory 1932 and storage medium 1930 can be, among other things, transient or persistent storage. The program stored in the storage medium 1930 may include one or more modules (not shown), each of which may include a series of instructions operating on a server. Still further, a central processor 1922 may be provided in communication with the storage medium 1930 to execute a series of instruction operations in the storage medium 1930 on the server 1900.

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-output interfaces 1958, one or more keyboards 1956, and/or one or more operating systems 1941, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.

A non-transitory computer-readable storage medium in which instructions, when executed by a processor of an apparatus (server or terminal), enable the apparatus to perform a protocol conversion method shown in fig. 1.

Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It will be understood that the invention is not limited to the precise arrangements 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 invention is limited only by the appended claims.

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

The method, system and device for protocol conversion provided by the present invention are introduced in detail, and a specific example is applied in the text to explain the principle and the implementation of the present invention, and the description of the above embodiment is only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims

1. A protocol translation method for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, the method comprising:

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, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, the method being applied to a first multi-party secure computing system, the first multi-party secure computing system comprising 4 computing nodes, the 4 computing nodes holding a first secret sharing factor for computing data to be converted for a secure computing task, the method comprising:

3. The method of claim 2, wherein the 2 computing nodes include computing node S1 and computing node S2, wherein the random number generated locally by the computing node S1 is r _ S1, and wherein the random number generated locally by the computing node S2 is r _ S2; any 2 computing nodes in the first multi-party secure computing system calculate the relation random number according to the locally generated random number, and respectively send the relation random number to computing nodes P1, P2 and P3 in the second multi-party secure computing system, including:

4. The method as claimed in claim 2, wherein 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, X ═ X1_ t0+ X2_ t0 of the computing data X of the secure computing task, and the 2 arbitrary computing nodes perform data conversion on the first secret sharing factor by using a locally generated random number to obtain second secret sharing factors, and respectively send the second secret sharing factors to the computing nodes P1, P2 and P3 in the second multiparty secure computing system, and the method comprises:

the compute node S1 sends the second secret sharing factor x1_ t3 to the compute node P3;

5. The method according to claim 4, wherein the second secret sharing factor obtained by the computing node S1, x1_ t 1-r _ S1-x1_ t0, x1_ t 2-r _ S1-x1_ t0, x1_ t 3-x 1_ t 0; the second secret sharing factor x2_ t1 obtained by the computing node S2 is-r _ S2-x2_ t0, x2_ t2 is r _ S2-x2_ t0, and x2_ t3 is-x 2_ t 0.

6. A protocol translation method for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, the method applied to a second multi-party secure computing system comprising computing nodes P1, P2 and P3, the method comprising:

7. The method of claim 6, wherein any 2 computing nodes in the first multi-party secured computing system include computing node S1 and computing node S2, wherein the random number generated locally by computing node S1 is r _ S1, wherein the random number generated locally by computing node S2 is r _ S2, and wherein the computing nodes P1, P2, and P3 receive the relational random number and the second secret sharing factor sent by the computing nodes in the first multi-party secured computing system, respectively, and wherein the method comprises:

8. The method of claim 7, wherein the compute node S1 holds a first secret sharing factor X1_ t0 for compute data X of the secure compute task, the compute node S2 holds a first secret sharing factor X2_ t0, X X1_ t0+ X2_ t0 for compute data X of the secure compute task, and the compute nodes P1, P2, and P3 respectively receive the relational random number and a second secret sharing factor sent by the compute nodes in the first multi-party secure compute system, and comprise:

9. The method according to claim 8, wherein the third secret sharing factor x1_ aby3 obtained by the computing node P1-r _ s1-x1_ t0+ r _ s2-x2_ t 0; a third secret sharing factor x2_ aby3 obtained by the computing node P2, r _ s1-x1_ t0-x2_ t 0; the third secret sharing factor x3_ aby3 obtained by the computing node P3 is-x 1_ t0+ r _ s2-x2_ t 0.

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, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, as applied to a second multi-party secure computing system, the second multi-party secure computing system comprising compute nodes P1, P2 and P3, the compute nodes P1, P2 and P3 having secret sharing factors for computing data to be converted for secure compute tasks, the method comprising:

11. The method according to claim 10, wherein a compute node P1 in the second multi-party secured computing system holds a secret sharing factor X1_ aby3 and a relational random number v1 of compute data X of secured compute tasks, a compute node P2 holds a secret sharing factor X2_ aby3 and a relational random number v2 of compute data X of secured compute tasks, a compute node P3 holds a secret sharing factor X3_ aby3 and a relational random number v3 of compute data X of secured compute tasks; the random number of relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

12. The method of claim 11, wherein the compute nodes P1 and P3 respectively send the held relationship random numbers to designated compute nodes in the first multi-party secured computing system, comprising:

the computing node P1 sends the held relational random number v1 to computing nodes S2 and Sb in the first multiparty secure computing system, respectively, so that the computing node S2 sets a local secret sharing factor x2_ according to the relational random number v1, and the computing node Sb sets a local secret sharing factor xb _ according to the relational random number v 1;

13. The method of claim 12, wherein the compute nodes P1 and P2 respectively send the held secret sharing factor to a designated compute node in the first multi-party secured computing system, comprising:

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 _accordingto the secret sharing factor X2_ aby3, and the computing node Sa sets the local secret sharing factor xa _accordingto the secret sharing factor X2_ aby 3.

14. The method according to claim 13, wherein the local secret sharing factor of the computing node S1 satisfies: x1 ═ x1_ aby3, x1 ═ x2_ aby 3; the local secret sharing factor of the computing node S2 satisfies: x2 ═ v3, x2 ═ v 1; the local secret sharing factor of the computing node Sa satisfies the following conditions: xa-v 3, xa-x 2_ aby 3; the local secret sharing factor of the computing node Sb satisfies xb-x 1_ aby3, xb _ v 1.

15. A protocol conversion method for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol, the second multi-party secure computing system supporting an ABY3 protocol, and being applied to a first multi-party secure computing system, the first multi-party secure computing system comprising 4 computing nodes, the 4 computing nodes comprising computing nodes S1, S2, Sa, and Sb, the method comprising:

16. The method according to claim 15, wherein a compute node P1 in the second multi-party secured computing system holds a secret sharing factor X1_ aby3 and a relational random number v1 of compute data X of secured compute tasks, a compute node P2 holds a secret sharing factor X2_ aby3 and a relational random number v2 of compute data X of secured compute tasks, a compute node P3 holds a secret sharing factor X3_ aby3 and a relational random number v3 of compute data X of secured compute tasks; the random number of relations held by the computing nodes P1, P2 and P3 and the secret sharing factor satisfy the following relations: v1+ v2+ v 3-0, X1-v 3-X, X2-v 1-X, and X3-v 2-X.

17. The method of claim 16, wherein the compute nodes S2, Sa and Sb receive relational random numbers sent by compute node P1 or P3, respectively, in the second multi-party secure computing system, comprising:

the compute nodes S2 and Sa receive the relational random numbers v3, respectively, sent by the compute node P3 in the second multi-party secured computing system.

18. The method of claim 17, wherein the computing nodes S1, Sa, and Sb receive the secret sharing factor sent by computing node P1 or P2, respectively, in the second multi-party secure computing system, comprising:

19. The method of claim 18, wherein setting a local secret sharing factor by each computing node based on the received relational random number and the secret sharing factor comprises:

20. An apparatus for protocol translation for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, the apparatus comprising a memory and one or more programs, wherein the one or more programs are stored in the memory and configured for execution by the one or more processors to perform the one or more programs comprising instructions for:

21. An apparatus for protocol translation for secure translation of a secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, it is characterized by that it is applied in first multi-party safety computing system, said first multi-party safety computing system includes 4 computing nodes, the 4 computing nodes hold a first secret sharing factor of computing data to be converted of the safe computing task, the device comprises a memory and one or more than one program, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors include instructions for:

22. An apparatus for protocol translation for secure translation of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, as applied to a second multi-party secure computing system, the second multi-party secure computing system comprising computing nodes P1, P2, and P3, the apparatus comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured for execution by the one or more processors and the one or more programs comprise instructions for:

the computing nodes P1, P2 and P3 respectively use the received second secret sharing factors to carry out local addition computation, so that the computing node P1 obtains a third secret sharing factor x1_ aby3, the computing node P2 obtains a third secret sharing factor x2_ aby3, and the computing node P3 obtains x3_ aby 3; the relation random number and the third secret sharing factor obtained by the calculation nodes P1, P2 and P3 meet the ABY3 protocol;

23. An apparatus for protocol translation for secure translation of a secret sharing factor 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, the second multi-party secure computing system supports an ABY3 protocol, characterized in that it applies to a second multi-party secure computing system, said second multi-party secure computing system comprising compute nodes P1, P2, and P3, the computing nodes P1, P2 and P3 hold secret sharing factors of computing data to be converted by the secure computing tasks, the device comprises a memory and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors include instructions for:

24. An apparatus for protocol conversion for secure conversion of a secret sharing factor between a first multi-party secure computing system and a second multi-party secure computing system, the first multi-party secure computing system supporting a 2-4 secret sharing protocol and the second multi-party secure computing system supporting an ABY3 protocol, as applied to a first multi-party secure computing system, the first multi-party secure computing system comprising 4 computing nodes, the 4 computing nodes comprising computing nodes S1, S2, Sa, and Sb, the apparatus comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured for execution by the one or more processors and the one or more programs comprise instructions for:

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