WO2023005066A1

WO2023005066A1 - Data processing method

Info

Publication number: WO2023005066A1
Application number: PCT/CN2021/131306
Authority: WO
Inventors: 李昊轩; 严强; 王朝阳; 廖飞强; 李辉忠; 张开翔; 范瑞彬
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2021-07-30
Filing date: 2021-11-17
Publication date: 2023-02-02
Also published as: CN113343283B; CN113343283A

Abstract

Embodiments of the present invention provide a data processing method. The method comprises: when a first computing node detects a data computing request, generating N pieces of first confusion information on the basis of private data of the first computing node, and respectively sending N-1 pieces of first confusion information of the N pieces of first confusion information to N-1 second computing nodes; receiving second confusion information respectively generated by the N-1 second computing nodes, and generating, according to first reserved confusion information and the N-1 pieces of second confusion information, ciphertext fragments used for determining a data computing result; and sending the ciphertext fragments to a data requester. In this way, according to the solution, a computing process for the data computing request can be completed on the premise of not leaking the private data of the computing nodes, and a generation flow of the computing nodes for the ciphertext fragments can be completed only by performing one round of interaction among the computing nodes, so that the efficiency of secure multi-party computing can be effectively improved.

Description

A data processing method

Cross References to Related Applications

This application claims the priority of a Chinese patent application with application number 202110873970.2 and application title "A Data Processing Method" submitted to the China Patent Office on July 30, 2021, the entire contents of which are incorporated in this application by reference.

technical field

Embodiments of the present invention relate to the field of financial technology (Fintech), and in particular, to a data processing method.

Background technique

With the development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually transforming into financial technology. However, due to the security and real-time requirements of the financial industry, higher requirements are also placed on technology.

Secure multi-party computing is a kind of collaborative computing that is safely completed through the participation of multiple parties without a trusted third party. That is, in a distributed network, each participant holds his own private data and hopes to jointly complete the calculation of a certain function, but requires that each participant cannot obtain any input information from other participants except the calculation result . Based on the characteristics of secure multi-party computing, secure multi-party computing has been applied to the field of financial technology in order to provide more convenient services for financial enterprises or financial enterprise customers.

At this stage, it is usually through the use of a common secure multi-party computing protocol by each participant to jointly calculate a function (such as a multiplication function) based on the private data of each participant, and use multiple random numbers in the process of calculating the multiplication function. Multiple rounds of interaction are combined to complete the calculation process of multiple inputs, so as to obtain the calculation result of the multiplication function. However, since this processing method relies on complex cryptographic protocols, the number of interaction rounds of each participant will be relatively large during the calculation process, resulting in low efficiency of secure multi-party computing in the multi-party input scenario.

To sum up, there is an urgent need for a data processing method to effectively improve the efficiency of secure multi-party computation.

Contents of the invention

In the first aspect, an embodiment of the present invention provides a data processing method, which is suitable for a secure multi-party computing system with N computing nodes, and the method includes:

When the first computing node detects a data computing request, it generates N pieces of first obfuscation information based on the private data of the first computing node, and sends N-1 pieces of first obfuscation information among the N pieces of first obfuscation information Send to N-1 second computing nodes respectively; the first computing node is any one of the N computing nodes; the second computing node is the N computing nodes except the first computing node Any computing node other than a node;

The first computing node receives the second obfuscation information generated by each of the N-1 second computing nodes, and generates a ciphertext for determining the data calculation result according to the first reserved obfuscation message and the N-1 second obfuscation messages Fragmentation; the first reserved confusion message is the first confusion information sent to N-1 second computing nodes in the N first confusion information;

The first calculation node sends the ciphertext fragments to a data requester; the data requester is used to determine a data calculation result according to the N ciphertext fragments.

In the above technical solution, since the existing secure multi-party calculation of multiplication function operation relies on complex cryptographic protocols, the number of interaction rounds of each participant in the multiplication function operation process will be relatively large, resulting in multi-party input scenarios. The efficiency is low. Based on this, when the first computing node in the technical solution of the present invention detects a data computing request, it can start a data computing operation for generating ciphertext fragments. That is, N pieces of first obfuscation information are generated based on the private data of the first computing node, and N-1 pieces of first obfuscation information among the N pieces of first obfuscation information are sent to N-1 second computing nodes respectively. At the same time, it will also receive the second obfuscation information generated by each of the N-1 second computing nodes, and generate a ciphertext fragment for determining the data calculation result based on the first reserved obfuscation message and the N-1 second obfuscation messages . Then, the ciphertext fragments are sent to the data requesting party, so that the data requesting party can timely and effectively determine the data calculation result according to the N ciphertext fragments. In this way, the scheme can not only complete the calculation process for the data calculation request without disclosing the private data of each computing node, so as to ensure the security of the private data of each computing node, but also only needs to carry out a process between computing nodes. Rounds of interaction can complete the generation process of each computing node for ciphertext fragmentation, so as to solve the problem that the technical solutions in the prior art require a large number of interaction rounds for each participant in the calculation process, and can effectively reduce the number of rounds in the determination process. In the process of data calculation results, the network resources consumed by each computing node for data interaction can effectively improve the efficiency of secure multi-party computing.

Optionally, the generating N pieces of first confusion information based on the private data of the first computing node includes:

The first computing node generates N random numbers conforming to the secure multi-party computing mechanism, and uses the N random numbers as N confusion factors;

For each obfuscation factor, the first computing node generates an offset factor according to the obfuscation factor and the privacy data of the first computing node, and determines the obfuscation factor and the offset factor as a first obfuscation factor information.

In the above technical solution, N random numbers are generated to cover up the private data of the first computing node, so as to prevent the private data of the first computing node from being leaked, thereby ensuring the security of the private data of the first computing node sex. At the same time, the first obfuscation information generated by the scheme can provide support for the subsequent generation of ciphertext fragments, thereby providing support for the data requester to determine the data calculation result.

Optionally, the first computing node generates N random numbers conforming to a secure multi-party computing mechanism, including:

The first computing node generates N-1 random numbers by using a random number generation algorithm on the elliptic curve number field;

The first computing node generates an Nth random number based on the N-1 random numbers.

In the above technical solution, a random number is generated by using a random number generation algorithm on the elliptic curve number field, and the private data of the first computing node is concealed based on the generated random number, so that the private data of the first computing node can be avoided is leaked, so that the security of the private data of the first computing node can be ensured.

Optionally, the generating a ciphertext fragment for determining a data calculation result according to the first retained obfuscation message and the N-1 second obfuscation messages includes:

The first computing node determines a first type of sub-ciphertext fragmentation based on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages;

The first computing node determines a second type of sub-ciphertext fragmentation based on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages;

For any offset factor among the N offset factors, the first computing node determines the third type of Sub-ciphertext fragmentation;

The first calculation node generates ciphertext for determining data calculation results according to the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation Fragmentation.

In the above technical solution, the first computing node can obtain the confusion factors and offset factors of the N-1 second computing nodes through one round of interaction, without requiring multiple rounds of interaction to complete the generation of ciphertext fragments. Then, based on the obfuscation factors and offset factors retained locally and the obfuscation factors and offset factors of the N-1 second computing nodes, ciphertext fragments for determining data calculation results can be generated in a timely and accurate manner. In this way, the scheme can provide support for the subsequent data requester to determine the data calculation result based on the ciphertext fragmentation in a timely manner, thereby effectively improving the efficiency of secure multi-party computation.

Optionally, the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation or the third type of sub-ciphertext fragmentation is performed by the first calculation node according to the elliptic curve number field Generated by the number field multiplication mechanism.

Optionally, the first calculation node determines the first type of sub-ciphertext fragmentation based on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages, including:

The first calculation node generates the first type by performing number field multiplication on the first reserved confusion message and the N confusion factors in the N-1 second confusion messages on the elliptic curve number field. Sub-ciphertext fragmentation.

Optionally, the first calculation node determines the second type of sub-ciphertext fragmentation based on the first retained obfuscation message and the N offset factors in the N-1 second obfuscation messages, including:

The first calculation node generates the second by performing number field multiplication on the first reserved confusion message and the N offset factors in the N-1 second confusion messages on the elliptic curve number field. Class subciphertext sharding.

Optionally, for any offset factor among the N offset factors, the first computing node calculates N-1 aliasing factors other than the offset factor and the aliasing factor corresponding to the offset factor, Determine the third type of sub-ciphertext fragmentation, including:

For any offset factor among the N offset factors, the first calculation node uses the N-1 offset factors other than the offset factor and the confusion factor corresponding to the offset factor on the elliptic curve number field The confusion factor performs a multiplication operation in the number field to generate the third type of sub-ciphertext fragments.

Optionally, the first calculation node generates a data calculation algorithm for determining the The ciphertext fragmentation of the result, including:

The first calculation node performs number addition and subtraction on the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation on the elliptic curve number field and multiplication operation to generate ciphertext fragments for determining data calculation results.

In the above technical solution, the first type of subkey can be determined in time by performing number field multiplication on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages on the elliptic curve number field. Text slicing; the second type of subkey can be determined in time by performing number field multiplication on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages on the elliptic curve number field Text fragmentation; for any offset factor in the N offset factors, by counting N-1 confusion factors other than the offset factor and the confusion factor corresponding to the offset factor on the elliptic curve number field The field multiplication operation can determine the third type of sub-ciphertext fragmentation in time, so that the ciphertext fragmentation used to determine the data calculation result can be determined in time, so as to provide support for effectively improving the efficiency of secure multi-party computing. And it can ensure the security of the private data of each computing node, so as to avoid the risk of leakage of the private data of each computing node.

In a second aspect, an embodiment of the present invention provides a data processing method, which is suitable for a secure multi-party computing system with N computing nodes, and the method includes:

The data requester generates a data calculation request for obtaining ciphertext fragments;

The data requester sends the data calculation request to the N computing nodes respectively; when the first computing node detects the data computing request, generates N pieces of first confusion information based on the private data of the first computing node , sending N-1 first obfuscation information among the N first obfuscation information to N-1 second computing nodes, and retaining the obfuscation information according to the first and the N-1 second computing nodes The generated N-1 second confusion messages generate ciphertext fragments for determining data calculation results; the first computing node is any one of the N computing nodes, and the second computing node is all Any computing node except the first computing node among the N computing nodes;

The data requester receives the ciphertext fragments sent by the N computing nodes respectively;

The data requester determines the data calculation result according to the N ciphertext fragments.

In the above technical solution, since the data required to calculate a certain function (such as a multiplication function) is stored in multiple computing nodes, but the multiple computing nodes will not leak their private data to the data requester, they will only Send the masked private data (that is, ciphertext fragmentation) to the data requester, so when the data requester needs to calculate the multiplication function, it needs to generate a data calculation request for obtaining the ciphertext fragmentation, and send the data The calculation request is sent to the plurality of calculation nodes, so that when any calculation node in the plurality of calculation nodes detects the data request, it can start the data operation operation of generating ciphertext fragments. That is, the first computing node generates N first obfuscated information based on the private data of the first computing node, and sends N-1 first obfuscated information among the N first obfuscated information to N-1 second computing nodes respectively. node. At the same time, it will also receive the second obfuscation information generated by each of the N-1 second computing nodes, and generate a ciphertext fragment for determining the data calculation result based on the first reserved obfuscation message and the N-1 second obfuscation messages . Then, the ciphertext fragments are sent to the data requesting party, so that the data requesting party can timely and effectively determine the data calculation result according to the N ciphertext fragments. In this way, the scheme can not only complete the calculation process for the data calculation request without disclosing the private data of each computing node, so as to ensure the security of the private data of each computing node, but also only requires a Round-by-round interaction can complete the generation process of each computing node for ciphertext fragmentation, which can effectively improve the efficiency of secure multi-party computing.

Optionally, the data requester determines the data calculation result according to the N ciphertext fragments, including:

The data requester obtains the data result after the numerical addition by performing numerical addition on the N ciphertext fragments on the elliptic curve number field;

The ratio of the data result after the addition operation to N is determined as the data calculation result.

In the above technical solution, by performing numerical addition on N ciphertext slices on the elliptic curve number field, the data result after the numerical addition is obtained, and the data result after the numerical addition is divided by N, that is Data calculation results can be accurately calculated.

In a third aspect, an embodiment of the present invention provides a data processing device, which is suitable for a secure multi-party computing system with N computing nodes, and the device includes:

The first generation unit is configured to generate N pieces of first obfuscation information based on the privacy data of the first computing node when a data calculation request is detected, and N-1 pieces of first obfuscation information among the N pieces of first obfuscation information The information is sent to N-1 second computing nodes respectively; the first computing node is any one of the N computing nodes; the second computing node is any one of the N computing nodes except the first Any computing node other than a computing node;

The first processing unit is configured to receive the second obfuscation information generated by each of the N-1 second computing nodes, and generate an encryption key for determining the data calculation result according to the first reserved obfuscation message and the N-1 second obfuscation messages Text fragmentation; the first reserved obfuscation message is the first obfuscation information sent to the N-1 second computing nodes in the N first obfuscation information; the ciphertext fragmentation is sent to the data A requester; the data requester is used to determine the data calculation result according to the N ciphertext fragments.

Optionally, the first generation unit is specifically configured to:

Generate N random numbers conforming to the secure multi-party computing mechanism, and use the N random numbers as N confusion factors;

For each obfuscation factor, an offset factor is generated according to the obfuscation factor and the private data of the first computing node, and the obfuscation factor and the offset factor are determined as first obfuscation information.

Optionally, the first generation unit is specifically configured to:

Generate N-1 random numbers by using a random number generation algorithm on the elliptic curve number field;

Based on the N-1 random numbers, an Nth random number is generated.

Optionally, the first processing unit is specifically configured to:

Based on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages, determine a first type of sub-ciphertext fragmentation;

Based on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages, determine a second type of sub-ciphertext fragmentation;

For any offset factor in the N offset factors, determine the third type of sub-ciphertext fragmentation according to the offset factor and the N-1 confusion factors other than the confusion factor corresponding to the offset factor;

According to the first type of sub-ciphertext fragments, the second type of sub-ciphertext fragments and the third type of sub-ciphertext fragments, a ciphertext fragment for determining a data calculation result is generated.

Optionally, the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation are all obtained by the first computing node in the elliptic curve number field It is determined by the multiplication operation on the number field.

Optionally, the first processing unit is specifically configured to:

The first type of sub-ciphertext fragment is generated by performing number-field multiplication on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages on the elliptic curve number field.

Optionally, the first processing unit is specifically configured to:

Generate the second type of sub-ciphertext fragmentation by performing number field multiplication on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages on the elliptic curve number field .

Optionally, the first processing unit is specifically configured to:

For any offset factor in the N offset factors, perform number field multiplication on the N-1 confusion factors other than the offset factor and the confusion factor corresponding to the offset factor on the elliptic curve number field operation to generate the third type of sub-ciphertext fragments.

Optionally, the first processing unit is specifically configured to:

By performing number addition, subtraction and multiplication operations on the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation on the elliptic curve number field, generate The ciphertext fragment used to determine the result of data calculation.

In a fourth aspect, an embodiment of the present invention provides a data processing device, which is suitable for a secure multi-party computing system with N computing nodes, and the device includes:

a second generating unit, configured to generate a data calculation request for obtaining ciphertext fragmentation;

The second processing unit is configured to send the data calculation request to the N computing nodes respectively; when the first computing node detects the data computing request, generate N first computing nodes based on the private data of the first computing node Obfuscating information, sending N-1 first obfuscated information among the N first obfuscated information to N-1 second computing nodes, and retaining the obfuscated information and the N-1 second computing nodes according to the first The N-1 second confusion messages generated by the computing nodes generate ciphertext fragments for determining data calculation results; the first computing node is any one of the N computing nodes, and the second computing node Be any computing node in the N computing nodes except the first computing node; receive the ciphertext fragments sent by the N computing nodes; determine the data calculation result according to the N ciphertext fragments .

Optionally, the second processing unit is specifically configured to:

By performing numerical addition on the N ciphertext fragments on the elliptic curve number field, a data result after the numerical addition is obtained;

The data requester determines the ratio of the data result after the addition operation to N as the data calculation result.

In a fifth aspect, an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, wherein the memory stores a computer program, and when the program is executed by the processor, the processing The device executes the data processing method described in any of the first aspect or the second aspect above.

In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program runs on the computing device, the computing device executes the above-mentioned first The data processing method described in any aspect or the second aspect.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For Those of ordinary skill in the art can also obtain other drawings based on these drawings without making creative efforts.

FIG. 1 is a schematic diagram of a secure multi-party computing system architecture provided by an embodiment of the present invention;

FIG. 2 is a schematic flowchart of a data processing method provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a data processing device provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of another data processing device provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a computing device provided by an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the present invention, rather than all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

In order to facilitate the understanding of the embodiment of the present invention, first, the system architecture shown in FIG. 1 is taken as an example to describe the architecture of the secure multi-party computing system applicable to the embodiment of the present invention. As shown in FIG. 1 , the architecture of the secure multi-party computing system may be a client 100 and a distributed secure multi-party computing system 200 . Wherein, the secure multi-party computing distributed system 200 may include at least one computing node, such as computing node 201 , computing node 202 , and computing node 203 . Wherein, the client 100 and at least one computing node may be connected in a wired manner, or may be connected in a wireless manner, which is not limited in this embodiment of the present invention.

Wherein, when the data requester needs to calculate a certain function, the client 100 on the terminal device can generate a data calculation request, and send the data calculation request to each computing node in the secure multi-party computing distributed system 200 respectively. When any computing node in the secure multi-party computing distributed system 200 detects the data computing request, it can start the ciphertext fragment generation process for the data computing request. For example, taking the computing node 201 as an example, the computing node 201 detects After receiving the data calculation request, the ciphertext fragment generation process for the data calculation request can be started. After the computing nodes in the secure multi-party computing distributed system 200 generate their own ciphertext fragments, they will send their respective ciphertext fragments to the data requesting party, so that the data requesting party can Calculate the data calculation results. Wherein, the terminal device may include, but not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a vehicle terminal, and the like.

It should be noted that the above structure shown in FIG. 1 is only an example, which is not limited in this embodiment of the present invention.

Based on the above description, FIG. 2 exemplarily shows a flow of a data processing method provided by an embodiment of the present invention, and the flow may be executed by a data processing apparatus. Wherein, the data processing method in the embodiment of the present invention is applicable to a secure multi-party computing system with N computing nodes.

As shown in Figure 2, the process specifically includes:

In step 201, the data requester generates a data calculation request for obtaining ciphertext fragments.

Step 202, the data requester sends the data calculation requests to the N calculation nodes respectively.

In the above step 201 and step 202, since the data required to calculate a certain function are distributed in multiple computing nodes, but the multiple computing nodes will not leak their private data to the data requester, so the data requester When the multiplication function needs to be calculated, a data calculation request for obtaining ciphertext fragments needs to be generated, and the data calculation request is sent to the plurality of calculation nodes. Wherein, the data requester may be any computing node among the N computing nodes, or may be a service node independent of the N computing nodes. Exemplarily, suppose there are three computing nodes, namely, computing node A, computing node B, and computing node C. Taking computing node A as the data requester as an example, users of computing node A need to calculate a certain function (such as multiplication function), it is necessary to use the client on the terminal device to generate a data calculation request for obtaining the ciphertext fragmentation of the determined data calculation result, and then send the data calculation request to the calculation node A and the calculation node A through the client. Node B and computing node C; or, the user of the computing node A directly generates a data calculation request for obtaining the ciphertext fragmentation of the determined data calculation result through the service interface provided by the computing node A, and passes the data through the service interface Computing requests are sent to computing node A, computing node B, and computing node C respectively. Or, suppose there are three computing nodes, namely, computing node A, computing node B, and computing node C. Taking a service node independent of these three computing nodes as the data requester as an example, users of the service node need to compute For a certain function, it is necessary to use the service interface provided by the service node (or through the client corresponding to the service node) to generate a data calculation request for obtaining the ciphertext fragmentation of the determined data calculation result, and then, through the service interface ( or the client corresponding to the service node) sends the data calculation request to the service node, and the service node sends the data calculation request to computing node A, computing node B, and computing node C respectively.

Step 203: When the first computing node detects the data computing request, it generates N pieces of first obfuscation information based on the private data of the first computing node, and sends N-1 pieces of the N first obfuscation information One obfuscation information is sent to N-1 second computing nodes respectively.

In the embodiment of the present invention, when the first calculation node detects a data calculation request, it generates N random numbers conforming to the secure multi-party computing mechanism, and uses the N random numbers as N confusion factors. For each confusion factor, an offset factor is generated according to the confusion factor and the privacy data of the first computing node, and the confusion factor and the offset factor corresponding to the confusion factor are determined as the first confusion information, and the Nth The N-1 pieces of first confusion information in one piece of confusion information are respectively sent to the N-1 second computing nodes. Wherein, the first computing node is any one of the N computing nodes; the second computing node is any computing node in the N computing nodes except the first computing node. In this way, N random numbers are generated for masking the private data of the first computing node, so as to prevent the private data of the first computing node from being leaked, thereby ensuring the security of the private data of the first computing node. At the same time, the first obfuscation information generated by the scheme can provide support for the subsequent generation of ciphertext fragments, thereby providing support for the data requester to determine the data calculation result.

Specifically, when generating N random numbers conforming to the secure multi-party computing mechanism, the first computing node generates N-1 random numbers by using a random number generation algorithm on the elliptic curve number field, and at the same time based on the N-1 random numbers Number, the Nth random number can be generated. In this way, by using a random number generation algorithm on the elliptic curve number field to generate random numbers, it is possible to prevent the offset factor generated by concealing the private data of the first computing node based on the generated random numbers from being cracked and leaking the first computing node. The private data of the node can ensure the security of the private data of the first computing node.

For example, suppose there are three computing nodes, namely, computing node A, computing node B, and computing node C, and computing node A owns private data a, computing node B owns private data b, and computing node C owns private data c. At the same time, the data requester (such as data requester D) is described as a service node independent of the three computing nodes. The data requester D can correctly obtain the multiplication data without knowing the private data a, b, and c The calculation result of the function, that is, d=a*b*c. That is to say, through calculation node A, calculation node B and calculation node C, on the premise of not disclosing private data a, b, c, the joint calculation determines the final calculation result of the multiplication function, that is, d=F_mul(a,b ,c)=a*b*c. When the calculation node A detects the data calculation request from the data requester D, it generates 256-bit random numbers ra1 and ra2 by using a random number generation algorithm on the elliptic curve number field, and calculates ra3=-(ra1+ra2). Then, take ra1, ra2, and ra3 as the three confusion factors of computing node A in the three-party secure computing, and use these three confusion factors to perform offset operation processing on the private data a of computing node A, and then calculate the three-way confusion factor of node A. offset factors, namely a1=a+ra1, a2=a+ra2, a3=a+ra3. In this way, (ra1, a1), (ra2, a2), and (ra3, a3) can all be determined as the first confusion information. Similarly, when the calculation node B detects the data calculation request from the data requester D, it can also generate 256-bit random numbers rb1 and rb2 by using a random number generation algorithm on the elliptic curve number field, and calculate rb3=-( rb1+rb2). Then, take rb1, rb2, and rb3 as the three confusion factors of computing node B in the three-party secure computing, and use these three confusion factors to perform offset operation on the private data b of computing node B, and then calculate the three-way confusion factors of node B. offset factors, namely b1=b+rb1, b2=b+rb2, b3=b+rb3. In this way, (rb1, b1), (rb2, b2), and (rb3, b3) can all be determined as the first confusion information. When the calculation node C detects the data calculation request from the data requester D, it can also use the random number generation algorithm on the elliptic curve number field to generate 256-bit random numbers rc1 and rc2, and calculate rc3=-(rc1+rc2 ). Then, take rc1, rc2 and rc3 as the three confusion factors of computing node C in the three-party secure computing, and use these three confusion factors to perform offset operation processing on the private data c of computing node C, then the three-way confusion factor of node C can be calculated offset factors, namely c1=c+rc1, c2=c+rc2, c3=c+rc3. In this way, (rc1, c1), (rc2, c2), and (rc3, c3) can all be determined as the first confusion information.

Then, computing node A, computing node B, and computing node C perform data interaction of the first obfuscated information. Exemplarily, computing node A, computing node B, and computing node C perform the interaction of the first obfuscation information in the first possible implementation manner, for example, computing node A sends the first obfuscation information with serial number 2, that is (ra2 , a2), send to computing node B, send the first confusion information with sequence number 3, namely (ra3, a3), to computing node C, and at the same time send the first confusion information with sequence number 1, namely (ra1, a1) , kept locally. Similarly, computing node B sends the first obfuscation information with serial number 1, namely (rb1, b1), to computing node A, and sends the first obfuscated information with serial number 3, namely (rb3, b3), to computing node C. At the same time, keep the first obfuscation information whose serial number is 2, namely (rb2, b2), locally. Computing node C sends the first obfuscation information with sequence number 1, namely (rc1, c1), to computing node A, and sends the first obfuscation information with sequence number 2, namely (rc2, c2), to computing node B, and at the same time Keep the first obfuscation information whose sequence number is 3, namely (rc3, c3), locally.

Alternatively, computing node A, computing node B, and computing node C perform the interaction of the first obfuscation information in the second possible implementation manner, for example, computing node A sends the first obfuscation information with the serial number 1, that is, (ra1, a1 ), send it to computing node B, send the first obfuscation information with sequence number 2, namely (ra2, a2), to computing node C, and at the same time, keep the first obfuscation information with sequence number 3, namely (ra3, a3), locally. Similarly, computing node B sends the first obfuscation information with serial number 1, namely (rb1, b1), to computing node A, and sends the first obfuscated information with serial number 2, namely (rb2, b2), to computing node C. At the same time, keep the first obfuscation information with sequence number 3, namely (rb3, b3), locally. Computing node C sends the first obfuscation information with sequence number 1, namely (rc1, c1), to computing node A, and sends the first obfuscation information with sequence number 3, namely (rc3, c3), to computing node B, and at the same time Keep the first obfuscation information whose sequence number is 2, namely (rc2, c2), locally. Based on this, when the multiplication function is safely calculated by the three parties, the technical solution provided by the embodiment of the present invention only needs to interact with three random numbers to complete the calculation operation for the multiplication function when performing data interaction. However, in the prior art, the three parties are performing When the multiplication function is operated, more than four or even more random numbers need to be interacted to complete the operation for the multiplication function. In this way, the technical solution provided by the embodiment of the present invention has fewer random numbers for safe three-party secure computing multiplication operations. There are also fewer rounds of interaction, so secure multi-party computation is more efficient. It should be noted that computing node A, computing node B, and computing node C may also exchange first obfuscated information in other implementation manners, which will not be repeated here. Of course, this embodiment of the present invention does not limit it. .

Step 204, the first computing node receives the second confusion information generated by each of the N-1 second computing nodes, and generates a calculation result for determining the data according to the first retained confusion message and the N-1 second confusion messages ciphertext fragments.

In the embodiment of the present invention, after receiving the second obfuscation information generated by N-1 second computing nodes, the first calculation node generates the first type of sub-ciphertext fragmentation according to the number field multiplication mechanism on the elliptic curve number field, The second type of sub-ciphertext fragmentation or the third type of sub-ciphertext fragmentation. That is, by performing number-field multiplication on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages on the elliptic curve number field, the first type of subciphertext score can be determined in a timely and accurate manner. piece; by carrying out number-field multiplication on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages on the elliptic curve number field, the second type of sub-ciphertext can be determined timely and accurately Fragmentation; for any offset factor in the N offset factors, the N-1 confusion factors other than the offset factor and the confusion factor corresponding to the offset factor are calculated on the elliptic curve number field The multiplication operation can timely and accurately determine the third type of sub-ciphertext fragmentation. Wherein, the first reserved obfuscation message is the first obfuscation information among the N first obfuscation information except those sent to N-1 second computing nodes. In this way, the ciphertext fragments used to determine the data calculation results can be determined in a timely manner, so as to provide support for effectively improving the efficiency of secure multi-party calculations, and can ensure the security of the private data of each calculation node, thereby avoiding the need for each calculation There is a risk of leakage of private data of nodes.

Exemplarily, the implementation process of generating ciphertext fragments by the first computing node is described by taking the first possible implementation manner as an example. That is, after computing node A receives the first obfuscation information (rb1, b1) sent from computing node B and the first obfuscation information (rc1, c1) sent by computing node C, it selects the offset factor and the locally reserved The offset factors in the first obfuscation information, that is, a1, b1 and c1, can determine the first type of sub-ciphertext fragmentation by performing number field multiplication on a1, b1 and c1 on the elliptic curve number field, namely share1=a1*b1*c1. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra1, rb1 and rc1, and perform number field multiplication on ra1, rb1 and rc1 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra1*rb1*rc1. Then, use the confusion factors rb1 and rc1 from computing node B and computing node C and the offset factor a1 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb1*rc1*a1. Using the confusion factors ra1 and rc1 from computing node A and computing node C and the offset factor b1 of computing node B to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra1*rc1*b1. Using the confusion factors ra1 and rb1 from computing node A and computing node B and the offset factor c1 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra1*rb1*c1. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext fragments on the elliptic curve number field, the ciphertext fragments used to determine the data calculation results can be determined, that is, SA=share1+2*share2 -share3-share4-share5, namely SA=a1*b1*c1+2*ra1*rb1*rc1-rb1*rc1*a1-ra1*rc1*b1-ra1*rb1*c1.

Similarly, after receiving the first obfuscation information (ra2, a2) sent by computing node A and the first obfuscated information (rc2, c2) sent by computing node C, computing node B selects the offset factor and locally reserved The offset factors in the first obfuscation information, that is, a2, b2 and c2, can determine the first type of sub-ciphertext fragmentation by performing number field multiplication on a2, b2 and c2 on the elliptic curve number field, That is, share1=a2*b2*c2. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra2, rb2 and rc2, and perform number-field multiplication on ra2, rb2 and rc2 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra2*rb2*rc2. Then, use the confusion factors rb2 and rc2 from computing node B and computing node C and the offset factor a2 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb2*rc2*a2. Using the confusion factors ra2 and rc2 from computing node A and computing node C and the offset factor b2 of computing node B to perform number field multiplication on the elliptic curve number field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra2*rc2*b2. Using the confusion factors ra2 and rb2 from computing node A and computing node B and the offset factor c2 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra2*rb2*c2. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext fragments on the elliptic curve number field, the ciphertext fragments used to determine the data calculation results can be determined, that is, SB=share1+2*share2 -share3-share4-share5, that is, SB=a2*b2*c2+2*ra2*rb2*rc2-rb2*rc2*a2-ra2*rc2*b2-ra2*rb2*c2.

Computing node C, after receiving the first confusion information (ra3, a3) sent from computing node A and the first confusion information (rb3, b3) sent by computing node B, selects the offset factor and the locally reserved first The offset factors in the obfuscated information, namely a3, b3 and c3, can determine the first type of sub-ciphertext fragmentation by performing number field multiplication on a3, b3 and c3 on the elliptic curve number field, namely share1= a3*b3*c3. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra3, rb3 and rc3, and perform number field multiplication on ra3, rb3 and rc3 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra3*rb3*rc3. Then, use the confusion factors rb3 and rc3 from computing node B and computing node C and the offset factor a3 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb3*rc3*a3. Using the confusion factors ra3 and rc3 from computing node A and computing node C and the offset factor b3 of computing node B to perform number field multiplication on the elliptic curve number field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra3*rc3*b3. Using the confusion factors ra3 and rb3 from computing node A and computing node B and the offset factor c3 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra3*rb3*c3. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext fragments on the elliptic curve number field, the ciphertext fragments used to determine the data calculation results can be determined, that is, SC=share1+2*share2 -share3-share4-share5, namely SC=a3*b3*c3+2*ra3*rb3*rc3-rb3*rc3*a3-ra3*rc3*b3-ra3*rb3*c3.

Alternatively, the implementation process of generating ciphertext fragments by the first computing node is described by taking the above second possible implementation manner as an example. That is, after computing node A receives the first obfuscation information (rb1, b1) sent from computing node B and the first obfuscation information (rc1, c1) sent by computing node C, it selects the offset factor and the locally reserved The offset factors in the first obfuscation information, that is, a3, b1, and c1, can determine the first type of sub-ciphertext fragmentation by performing number-field multiplication on a3, b1, and c1 on the elliptic curve number field, namely share1=a3*b1*c1. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra3, rb1 and rc1, and perform number field multiplication on ra3, rb1 and rc1 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra3*rb1*rc1. Then, use the confusion factors rb1 and rc1 from computing node B and computing node C and the offset factor a3 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb1*rc1*a3. Using the confusion factors ra3 and rc1 from computing node A and computing node C and the offset factor b1 from computing node B to perform number field multiplication on the elliptic curve number field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra3*rc1*b1. Using the confusion factors ra3 and rb1 from computing node A and computing node B and the offset factor c1 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra3*rb1*c1. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext fragments on the elliptic curve number field, the ciphertext fragments used to determine the data calculation results can be determined, that is, SA=share1+2*share2 -share3-share4-share5, namely SA=a3*b1*c1+2*ra3*rb1*rc1-rb1*rc1*a3-ra3*rc1*b1-ra3*rb1*c1.

Similarly, after receiving the first obfuscation information (ra1, a1) sent by computing node A and the first obfuscated information (rc3, c3) sent by computing node C, computing node B selects the offset factor and locally reserved The offset factors in the first obfuscation information, that is, a1, b3 and c3, can determine the first type of sub-ciphertext fragmentation by performing number field multiplication on a1, b3 and c3 on the elliptic curve number field, That is, share1=a1*b3*c3. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra1, rb3 and rc3, and perform number field multiplication on ra1, rb3 and rc3 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra1*rb3*rc3. Then, use the confusion factors rb3 and rc3 from computing node B and computing node C and the offset factor a1 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb3*rc3*a1. Using the confusion factors ra1 and rc3 from computing node A and computing node C and the offset factor b3 from computing node B to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra1*rc3*b3. Using the confusion factors ra1 and rb3 from computing node A and computing node B and the offset factor c3 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra1*rb3*c3. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext fragments on the elliptic curve number field, the ciphertext fragments used to determine the data calculation results can be determined, that is, SB=share1+2*share2 -share3-share4-share5, that is, SB=a1*b3*c3+2*ra1*rb3*rc3-rb3*rc3*a1-ra1*rc3*b3-ra1*rb3*c3.

After receiving the first obfuscation information (ra2, a2) sent by computing node A and the first obfuscation information (rb2, b2) sent by computing node B, computing node C selects the offset factor and the locally reserved first The offset factors in the obfuscated information, namely a2, b2 and c2, can determine the first type of sub-ciphertext fragmentation, namely share1= a2*b2*c2. Furthermore, select the confusion factors among them and the confusion factors in the locally retained first confusion information, that is, ra2, rb2 and rc2, and perform number-field multiplication on ra2, rb2 and rc2 on the elliptic curve number field to determine The second type of sub-ciphertext fragmentation is obtained, that is, share2=ra2*rb2*rc2. Then, use the confusion factors rb2 and rc2 from computing node B and computing node C and the offset factor a2 of computing node A to perform number field multiplication on the elliptic curve number field to determine the third type of sub-ciphertext fragmentation , namely share3=rb2*rc2*a2. Using the confusion factors ra2 and rc2 from computing node A and computing node C and the offset factor b2 of computing node B to perform number field multiplication on the elliptic curve number field, the third type of sub-ciphertext fragmentation can be determined, namely share4=ra2*rc2*b2. Using the confusion factors ra2 and rb2 from computing node A and computing node B and the offset factor c2 of computing node C to perform digital field multiplication on the elliptic curve digital field, the third type of sub-ciphertext fragmentation can be determined, namely share5=ra2*rb2*c2. Finally, by performing number addition, subtraction and multiplication operations on various sub-ciphertext slices on the elliptic curve number field, the ciphertext slices used to determine the data calculation results can be determined, that is, SC=share1+2*share2 -share3-share4-share5, namely SC=a2*b2*c2+2*ra2*rb2*rc2-rb2*rc2*a2-ra2*rc2*b2-ra2*rb2*c2.

Step 205, the first computing node sends the ciphertext fragment to the data requester.

Step 206, the data requester determines the data calculation result according to the N ciphertext fragments.

In the above step 205 and step 206, after each computing node generates the ciphertext fragment, it will send the ciphertext fragment generated by it to the data requester, so that the data requestor can determine the Data calculation results. Specifically, after receiving the N ciphertext fragments, the data requester performs numerical addition operations on the N ciphertext fragments on the elliptic curve number field to obtain the data result after the numerical addition operation, and performs numerical addition operation The final data result is divided by N, and the data calculation result can be accurately calculated. Exemplarily, the above first possible implementation manner is taken as an example to describe the implementation process of each computing node sending ciphertext fragments. That is, computing node A sends the ciphertext segment SA generated by itself to data requester D, computing node B sends the ciphertext segment SB generated by itself to data requester D, and computing node C sends the ciphertext segment generated by itself The slice SC is sent to the data requester D. After receiving the ciphertext fragments SA, SB and SC, the data requester D performs sum operation on the ciphertext fragments SA, SB and SC on the elliptic curve number field, and compares the result of the sum operation with 3 By performing the division operation, the data calculation result can be accurately calculated, that is, (SA+SB+SC)/3=3*a*b*c/3=a*b*c. That is, the final calculation result is equivalent to the multiplication result a*b*c of the private data a, b, and c of computing node A, computing node B, and computing node C.

The following describes an application scenario as an example. For example, three computing institutions jointly calculate the total household income as an example to describe the implementation process of the data processing method based on secure multi-party computing in the implementation of the present invention.

For example, organization A has a per capita average income, such as 100,000 yuan, organization B has the number of household workers, such as 2 people, and organization C has working years, such as 5 years of work, and these three organizations need to not disclose their private data Complete the household gross income for a single household or the individual household gross income for multiple households without premise. That is, by adopting the technical solution of the above-mentioned data processing method based on secure multi-party computing provided by the embodiment of the present invention, institution A generates three confusion factors, namely ra1, ra2 and ra3, by using a random number generation algorithm on the elliptic curve number field, And use these three confusion factors to carry out the offset operation on the amount of 100,000 yuan respectively, and you can get three offset factors, namely a1, a2 and a3. In the same way, organization B generates three confusion factors, rb1, rb2 and rb3, by using a random number generation algorithm on the elliptic curve number field, and uses these three confusion factors to perform offset operations on the number of household workers and 2 persons respectively. Three offset factors can be obtained, namely b1, b2 and b3. Institution C uses a random number generation algorithm on the elliptic curve number field to generate three confusion factors, namely rc1, rc2, and rc3, and uses these three confusion factors to perform offset operations on the working years of 5 years respectively, to obtain three offset factors, namely c1, c2 and c3. Institution A, institution B, and institution C perform data exchange of confusion factors and offset factors through the secure channel according to the above-mentioned first possible implementation manner. Based on this, in the end, institution A obtains three confusion factors ra1, rb1 and rc1, and three offset factors a1, b1 and c1; institution B obtains three confusion factors ra2, rb2 and rc2, and three offset factors a2 and b2 and c2; Agency C obtains three confounding factors ra3, rb3 and rc3, and three offset factors a3, b3 and c3. According to the method of generating ciphertext fragments provided by the embodiment of the present invention, mechanism A can generate Determine the ciphertext slice SA of the data calculation result, and send the ciphertext slice SA to the data requester; organization B generates the ciphertext slice according to the method provided by the embodiment of the present invention, by using the confusion factors ra2, rb2, rc2 And the offset factors a2, b2, c2 perform mathematical operations on the elliptic curve number field to generate the ciphertext fragment SB used to determine the data calculation result, and send the ciphertext fragment SB to the data requester; institution C According to the method of generating ciphertext fragments provided by the embodiment of the present invention, by using the confusion factors ra3, rb3, rc3 and offset factors a3, b3, c3 to perform mathematical operations on the elliptic curve number field, the data used to determine Calculate the ciphertext fragment SC of the result, and send the ciphertext fragment SC to the data requester. After receiving the ciphertext fragments SA, SB and SC, the data requester performs summing operation on the ciphertext fragmentation SA, SB and SC on the elliptic curve number field, and calculates the result of the summation with 3 The calculation result of the data can be accurately calculated by the division operation, that is, (SA+SB+SC)/3=10*2*5=1 million yuan. That is, under the premise that Institution A, Institution B, and Institution C do not disclose their private data (that is, 100,000 yuan, 2 individuals, 5 years), the total household income of a certain family is 1 million yuan.

The above-mentioned embodiment shows that, because the secure multi-party calculation of the existing multiplication function operation relies on complex cryptographic protocols, the number of interaction rounds of each participant during the multiplication function operation process will be relatively large, resulting in multiple input scenarios for the multiplication function operation. The efficiency is low. Based on this, when the first computing node in the technical solution of the present invention detects a data computing request, it can start a data computing operation for generating ciphertext fragments. That is, N pieces of first obfuscation information are generated based on the private data of the first computing node, and N-1 pieces of first obfuscation information among the N pieces of first obfuscation information are sent to N-1 second computing nodes respectively. At the same time, it will also receive the second obfuscation information generated by each of the N-1 second computing nodes, and generate a ciphertext fragment for determining the data calculation result based on the first reserved obfuscation message and the N-1 second obfuscation messages . Then, the ciphertext fragments are sent to the data requesting party, so that the data requesting party can timely and effectively determine the data calculation result according to the N ciphertext fragments. In this way, the scheme can not only complete the calculation process for the data calculation request without disclosing the private data of each computing node, so as to ensure the security of the private data of each computing node, but also only needs to carry out a process between computing nodes. Rounds of interaction can complete the generation process of each computing node for ciphertext fragmentation, so as to solve the problem that the technical solutions in the prior art require a large number of interaction rounds for each participant in the calculation process, and can effectively reduce the number of rounds in the determination process. In the process of data calculation results, the network resources consumed by each computing node for data interaction can effectively improve the efficiency of secure multi-party computing.

Based on the same technical concept, FIG. 3 exemplarily shows a data processing device provided by an embodiment of the present invention, and the device can execute the flow of the data processing method. Wherein, the data processing method in the embodiment of the present invention is applicable to a secure multi-party computing system with N computing nodes.

As shown in Figure 3, the device includes:

The first generating unit 301 is configured to generate N pieces of first obfuscation information based on the private data of the first computing node when a data calculation request is detected, and generate N-1 pieces of first obfuscation information among the N pieces of first obfuscation information. The confusion information is sent to N-1 second computing nodes respectively; the first computing node is any one of the N computing nodes; the second computing node is any one of the N computing nodes except the first any computing node other than a computing node;

The first processing unit 302 is configured to receive the second obfuscation information generated by each of the N-1 second computing nodes, and generate information for determining a data calculation result according to the first reserved obfuscation message and the N-1 second obfuscation messages Ciphertext fragmentation; the first reserved obfuscation message is the first obfuscation information sent to the N-1 second computing nodes in the N first obfuscation information; the ciphertext fragmentation is sent to A data requester; the data requester is used to determine the data calculation result according to the N ciphertext fragments.

Optionally, the first generating unit 301 is specifically configured to:

Based on the N-1 random numbers, an Nth random number is generated.

Optionally, the first processing unit 302 is specifically configured to:

Based on the same technical concept, FIG. 4 exemplarily shows another data processing device provided by an embodiment of the present invention, and the device can execute the flow of the data processing method. Wherein, the data processing method in the embodiment of the present invention is applicable to a secure multi-party computing system with N computing nodes.

As shown in Figure 4, the device includes:

The second generating unit 401 is configured to generate a data calculation request for obtaining ciphertext fragments;

The second processing unit 402 is configured to send the data calculation request to the N computing nodes respectively; when the first computing node detects the data computing request, generate Nth computing nodes based on the private data of the first computing node One obfuscation information, sending N-1 first obfuscation information among the N first obfuscation information to N-1 second computing nodes respectively, and retaining the obfuscation information according to the first and the N-1 first obfuscation information The N-1 second confusion messages generated by two computing nodes generate ciphertext fragments used to determine data calculation results; the first computing node is any one of the N computing nodes, and the second computing The node is any computing node in the N computing nodes except the first computing node; receiving the ciphertext fragments sent by the N computing nodes; according to the N ciphertext fragments, determine the data calculation result.

Optionally, the second processing unit 402 is specifically configured to:

Based on the same technical concept, an embodiment of the present invention also provides a computing device, as shown in FIG. 5 , including at least one processor 501 and a memory 502 connected to the at least one processor. The specific connection medium between the processor 501 and the memory 502, the connection between the processor 501 and the memory 502 in FIG. 5 is taken as an example. The bus can be divided into address bus, data bus, control bus and so on.

In the embodiment of the present invention, the memory 502 stores instructions executable by at least one processor 501, and at least one processor 501 can execute the steps included in the aforementioned data processing method by executing the instructions stored in the memory 502.

Among them, the processor 501 is the control center of the computing device, which can use various interfaces and lines to connect various parts of the computing device, by running or executing instructions stored in the memory 502 and calling data stored in the memory 502, thereby realizing data deal with. Optionally, the processor 501 may include one or more processing units, and the processor 501 may integrate an application processor and a modem processor. The call processor mainly handles issuing instructions. It can be understood that the foregoing modem processor may not be integrated into the processor 501 . In some embodiments, the processor 501 and the memory 502 can be implemented on the same chip, and in some embodiments, they can also be implemented on independent chips.

The processor 501 can be a general processor, such as a central processing unit (CPU), a digital signal processor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array or other programmable logic devices, discrete gates or transistors Logic devices and discrete hardware components can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the methods disclosed in the embodiments of the data processing method can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

The memory 502, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs and modules. Memory 502 may include at least one type of storage medium, for example, may include flash memory, hard disk, multimedia card, card memory, random access memory (Random Access Memory, RAM), static random access memory (Static Random Access Memory, SRAM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Magnetic Memory, Disk , CD, etc. Memory 502 is, but is not limited to, any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 502 in the embodiment of the present invention may also be a circuit or any other device capable of implementing a storage function, and is used for storing program instructions and/or data.

Based on the same technical idea, an embodiment of the present invention also provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program is run on the computing device, the computing device Execute the steps of the above data processing method.

Those skilled in the art should understand that the embodiments of the present invention may be provided as methods, systems, or computer program products. Accordingly, the present invention can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the invention. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

While preferred embodiments of the invention have been described, additional changes and modifications to these embodiments can be made by those skilled in the art once the basic inventive concept is appreciated. Therefore, it is intended that the appended claims be construed to cover the preferred embodiment as well as all changes and modifications which fall within the scope of the invention.

Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of this application and their equivalent technologies, the present invention also intends to include these modifications and variations.

Claims

A data processing method, characterized in that it is applicable to a secure multi-party computing system with N computing nodes, the method comprising:

When the first computing node detects a data computing request, it generates N pieces of first obfuscation information based on the private data of the first computing node, and sends N-1 pieces of first obfuscation information among the N pieces of first obfuscation information Send to N-1 second computing nodes respectively; the first computing node is any one of the N computing nodes; the second computing node is the N computing nodes except the first computing node Any computing node other than a node;

The first computing node receives the second obfuscation information generated by each of the N-1 second computing nodes, and generates a ciphertext for determining the data calculation result according to the first reserved obfuscation message and the N-1 second obfuscation messages Fragmentation; the first reserved confusion message is the first confusion information sent to N-1 second computing nodes in the N first confusion information;

The first calculation node sends the ciphertext fragments to a data requester; the data requester is used to determine a data calculation result according to the N ciphertext fragments.
The method according to claim 1, wherein the generating N pieces of first confusion information based on the private data of the first computing node comprises:

The first computing node generates N random numbers conforming to the secure multi-party computing mechanism, and uses the N random numbers as N confusion factors;

For each obfuscation factor, the first computing node generates an offset factor according to the obfuscation factor and the privacy data of the first computing node, and determines the obfuscation factor and the offset factor as a first obfuscation factor information.
The method according to claim 2, wherein the first computing node generates N random numbers conforming to a secure multi-party computing mechanism, including:

The first computing node generates N-1 random numbers by using a random number generation algorithm on the elliptic curve number field;

The first computing node generates an Nth random number based on the N-1 random numbers.
The method according to claim 1, wherein the generation of ciphertext fragments for determining data calculation results according to the first reserved confusion message and N-1 second confusion messages comprises:

The first computing node determines a first type of sub-ciphertext fragmentation based on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages;

The first computing node determines a second type of sub-ciphertext fragmentation based on the first reserved obfuscation message and the N offset factors in the N-1 second obfuscation messages;

For any offset factor among the N offset factors, the first computing node determines the third type of Sub-ciphertext fragmentation;

The first calculation node generates ciphertext for determining data calculation results according to the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation Fragmentation.
The method according to claim 4, wherein the first computing node determines the first class subclass based on the first reserved obfuscation message and the N obfuscation factors in the N-1 second obfuscation messages. Ciphertext fragmentation, including:

The first calculation node generates the first type by performing number field multiplication on the first reserved confusion message and the N confusion factors in the N-1 second confusion messages on the elliptic curve number field. Sub-ciphertext fragmentation.
The method according to claim 4, wherein the first computing node determines the second type of Sub-ciphertext fragmentation, including:

The first calculation node generates the second by performing number field multiplication on the first reserved confusion message and the N offset factors in the N-1 second confusion messages on the elliptic curve number field. Class subciphertext sharding.
The method according to claim 4, wherein, for any offset factor among the N offset factors, the first calculation node calculates the offset factor according to the difference between the offset factor and the confusion factor corresponding to the offset factor. Out of the N-1 confusion factors, determine the third type of sub-ciphertext fragmentation, including:

For any offset factor among the N offset factors, the first calculation node uses the N-1 offset factors other than the offset factor and the confusion factor corresponding to the offset factor on the elliptic curve number field The confusion factor performs a multiplication operation in the number field to generate the third type of sub-ciphertext fragments.
The method according to claim 4, wherein the first computing node is based on the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation and the third type of sub-ciphertext Fragmentation, generating ciphertext fragmentation for determining data calculation results, including:

The first calculation node performs number addition and subtraction on the first type of sub-ciphertext fragmentation, the second type of sub-ciphertext fragmentation, and the third type of sub-ciphertext fragmentation on the elliptic curve number field and multiplication operation to generate ciphertext fragments for determining data calculation results.
A data processing method, characterized in that it is applicable to a secure multi-party computing system with N computing nodes, the method comprising:

The data requester generates a data calculation request for obtaining ciphertext fragments;

The data requester sends the data calculation request to the N computing nodes respectively; when the first computing node detects the data computing request, generates N pieces of first confusion information based on the private data of the first computing node , sending N-1 first obfuscated information among the N first obfuscated information to N-1 second computing nodes, and retaining the obfuscated information according to the first and the N-1 second computing nodes The generated N-1 second confusion messages generate ciphertext fragments used to determine data calculation results; the first computing node is any one of the N computing nodes, and the second computing node is all Any computing node except the first computing node among the N computing nodes;

The data requester receives the ciphertext fragments sent by the N computing nodes respectively;

The data requester determines the data calculation result according to the N ciphertext fragments.
The method according to claim 9, wherein the data requester determines the data calculation result according to the N ciphertext fragments, including:

The data requester obtains the data result after the numerical addition by performing numerical addition on the N ciphertext fragments on the elliptic curve number field;

The data requester determines the ratio of the data result after the addition operation to N as the data calculation result.