Data processing method, device, medium, equipment and product for secure computing

By splitting the polynomial evaluation process into two subprocesses in multi-party security calculations, the problem of large traffic volume of feature shards is solved, data processing efficiency is improved and data security is protected.

CN118157856BActive Publication Date: 2024-12-03BEIJING VOLCANO ENGINE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410355153.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-26
Publication Date
2024-12-03
Estimated Expiration
2044-03-26

AI Technical Summary

Technical Problem

In multi-party security computing, the traffic volume of feature shards is too large, which affects the efficiency of data processing, especially in scenarios where the number of big data and feature count is large, such as machine learning model training and SQL query.

Method used

By converting the feature sharding problem corresponding to the intersection of the identification set into a polynomial evaluation problem, and splitting the polynomial evaluation process into two subprocesses, the number of times the polynomial to be evaluated is reduced, thereby reducing the polynomial in the polynomial in the polynomial The traffic volume at the time of evaluation. The specific method includes the first party and the second party jointly implementing the privacy set interception protocol, generating a ciphertext polynomial, and calculating the value of the polynomial on the intersection partial identification to obtain shards.

Benefits of technology

It effectively reduces the traffic during feature sharding, improves the processing efficiency of target data processing tasks, and protects data security in scenarios such as model training and SQL query.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118157856B_ABST
    Figure CN118157856B_ABST
Patent Text Reader

Abstract

The present disclosure relates to a data processing method, apparatus, medium, equipment and product for secure computing. The participants in secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set. The method applied to the first party includes: based on the first identification set, executing a data processing process based on a privacy set intersection protocol with the second party; in response to receiving a ciphertext polynomial sent by the second party, for each dimensional feature in at least part of the h-dimensional features, according to the ciphertext polynomial, performing a degree reduction process on the first polynomial corresponding to the dimensional feature to obtain a second polynomial; calculating the value of the second polynomial on at least part of the identifications in the intersection set with the second party to obtain a first shard of the value; executing the target data processing task based on the first shard. Through this solution, data security can be protected in scenarios such as model training and SQL query, and the amount of communication can be reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of secure multi-party computing, and in particular, to a data processing method, apparatus, medium, equipment and product for secure computing. Background Art

[0002] Secure multi-party computing is also called multi-party secure computing (MPC). It allows multiple parties to jointly calculate the result of a function without disclosing the input data of each party in the function. The result of the calculation is open to one or more parties. Typical applications of secure multi-party computing include joint statistical analysis of multi-party data with privacy protection, machine learning, etc. The function here is a statistical operation function, a machine learning algorithm, etc.

[0003] In the process of multi-party secure computing, in order to prevent the disclosure of data and intermediate computing results of each party, the data or intermediate results can be held by each party in a shared form. A single party holds a data shard, and the shards held by each party are merged together to restore the corresponding data. Usually, the calculation is kept in a shared state. In this way, the number of data communications and the amount of communication in multi-party secure computing are important factors affecting the efficiency of secure computing. Summary of the invention

[0004] This summary is provided to introduce concepts in a brief form that will be described in detail in the detailed description below. This summary is not intended to identify key features or essential features of the claimed technical solution, nor is it intended to limit the scope of the claimed technical solution.

[0005] In a first aspect, the present disclosure provides a data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the method is applied to the first party, including:

[0006] Based on the first identifier set, performing a data processing process based on a privacy set intersection protocol with the second party, so that the second party obtains an intersection of the first identifier set and the second identifier set;

[0007] In response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, according to the ciphertext polynomial, a first polynomial corresponding to the dimensional feature is reduced in degree to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; and calculating with the second party the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value;

[0008] Execute a target data processing task based on the first shard.

[0009] In a second aspect, the present disclosure provides a data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the method is applied to the second party, including:

[0010] Based on the second identifier set, performing a data processing process based on a privacy set intersection protocol with the first party to obtain an intersection of the first identifier set and the second identifier set;

[0011] Based on the intersection, construct a fifth polynomial, and perform homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial;

[0012] The ciphertext polynomial is sent to the first party, so that the first party performs a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to reduce the order of the first polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; and the first party calculates the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value;

[0013] Execute the target data processing task based on the second shard.

[0014] In a third aspect, the present disclosure provides a data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the device is applied to the first party, including:

[0015] A first intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the second party based on the first identifier set, so that the second party obtains an intersection of the first identifier set and the second identifier set;

[0016] A reduction module is used for, in response to receiving the ciphertext polynomial sent by the second party, reducing the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; a first evaluation module is used for calculating, with the second party, the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value;

[0017] A first execution module is used to execute a target data processing task based on the first slice.

[0018] In a fourth aspect, the present disclosure provides a data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the device is applied to the second party, including:

[0019] A second intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the first party based on the second identifier set, to obtain an intersection of the first identifier set and the second identifier set;

[0020] An encryption module, used for constructing a fifth polynomial based on the intersection, and performing homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial;

[0021] a sending module, configured to send the ciphertext polynomial to the first party, so that the first party can reduce the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; and a second evaluation module, configured to calculate with the first party the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value;

[0022] A second execution module is used to execute a target data processing task based on the second slice.

[0023] In a fifth aspect, the present disclosure provides a computer-readable medium having a computer program stored thereon, which, when executed by a processing device, implements the steps of the data processing method for secure computing provided in the first aspect of the present disclosure or the steps of the data processing method for secure computing provided in the second aspect of the present disclosure.

[0024] In a sixth aspect, the present disclosure provides an electronic device, including:

[0025] a storage device having a computer program stored thereon;

[0026] A processing device is used to execute the computer program in the storage device to implement the steps of the data processing method for secure computing provided in the first aspect of the present disclosure or the steps of the data processing method for secure computing provided in the second aspect of the present disclosure.

[0027] In a seventh aspect, the present disclosure provides a computer program product, comprising a computer program, which, when executed by a processor, implements the steps of the data processing method for secure computing provided in the first aspect of the present disclosure or the steps of the data processing method for secure computing provided in the second aspect of the present disclosure.

[0028] In the above technical solution, first, the first party and the second party jointly perform a data processing process based on the privacy set intersection protocol, and the second party obtains the intersection of the first identification set and the second identification set; then, the second party generates a ciphertext polynomial based on the intersection and sends it to the first party; next, the first party performs a degree reduction process on the first polynomial corresponding to the h-dimensional feature for each dimensional feature of at least some of the dimensional features held by itself according to the received ciphertext polynomial to obtain a second polynomial; then, the first party and the second party jointly calculate the value of the second polynomial on at least some of the identifications in the intersection to obtain the first shard and the second shard of the value respectively; finally, the first party and the second party respectively perform the target data processing task based on the shards held by themselves. In this way, the sharding problem of the features corresponding to the intersection of the two parties' identification sets can be cleverly converted into a polynomial evaluation problem, and the polynomial evaluation process can be divided into two sub-processes of degree reduction and evaluation. Among them, by reducing the degree of the polynomial, the degree of the polynomial to be evaluated can be reduced, thereby reducing the communication volume between the two parties when evaluating the polynomial (where the communication volume during polynomial evaluation is proportional to the degree of the polynomial), so that the communication volume between the two parties during feature sharding can be reduced, and the processing efficiency of the target data processing task can be improved. Therefore, this solution can protect data security and reduce communication volume in scenarios such as model training and SQL query.

[0029] Other features and advantages of the present disclosure will be described in detail in the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and the originals and elements are not necessarily drawn to scale. In the drawings:

[0031] Figure 1 The invention is a flowchart showing a data processing method for secure computing applied to a first party according to an exemplary embodiment.

[0032] Figure 2 The invention is a flowchart showing a data processing method for secure computing applied to a second party according to an exemplary embodiment.

[0033] Figure 3 The invention is a block diagram showing a data processing device for secure computing applied to a first party according to an exemplary embodiment.

[0034] Figure 4 The invention is a block diagram showing a data processing device for secure computing applied to a second party according to an exemplary embodiment.

[0035] Figure 5 The diagram is a schematic structural diagram of an electronic device according to an exemplary embodiment. DETAILED DESCRIPTION

[0036] Before introducing the specific embodiments of the present disclosure, the terms involved in the present disclosure and the specific application scenarios of multi-party secure computing are first introduced and explained.

[0037] Ring: refers to a set that defines two operations, addition and multiplication, and forms a commutative group (i.e., Abelian group) for addition, a semigroup for multiplication for elements other than 0, and multiplication satisfies the distributive law for addition.

[0038] Secret Sharing is also called secret splitting or secret sharing. Its basic principle is to split secrets (such as keys, private data, etc.) into multiple shares (Shares) and give them to different data parties for safekeeping. Only when parties exceeding a threshold number merge their shards can the secret be restored; Shares obtained from parties less than the threshold number cannot restore any information of the secret. In multi-party secure computing, the threshold number is usually the same as the number of participants, and the shares into which the secret is split can also be called shards. Among them, private data is the data that you do not want other parties to know in multi-party secure computing.

[0039] Homomorphic encryption is a technology that allows calculations to be performed on encrypted data (i.e., ciphertext) and then decrypted to obtain the result. The result of homomorphic encryption is the same as the result of direct calculation on the original data (i.e., plaintext), but the entire calculation process is performed on the encrypted data. There are many encryption algorithms that can be used to implement homomorphic encryption, among which BFV is one of them, and it is called BFV homomorphic encryption at this time.

[0040] Private Set Intersection (PSI) is a proprietary protocol in the field of secure multi-party computing, which allows both parties to input private sets to jointly calculate the intersection of sets, and ensures that no additional element information is leaked except the set intersection result.

[0041] Communication volume: Since the data of the participants in secure computing are on different machines, they need to interact through network communication. During the calculation process, encrypted data will be transmitted on the network, and the amount of data transmitted is the communication volume.

[0042] In practical applications, for the purpose of privacy protection, multi-party secure computing algorithms are usually black box algorithms, and the data transmission behavior between the computing nodes equipped with multi-party secure computing algorithms is opaque. As discussed in the background technology, typical applications of multi-party secure computing include machine learning, among which multi-party secure computing technology can be used to protect privacy data during the reasoning and training stages of machine learning, mainly involving the protection of model parameters and the protection of the data of each participant during the training process.

[0043] At present, common privacy-preserving machine learning solutions based on secure multi-party computing include: privacy-preserving machine learning protocols based on obfuscated circuits, oblivious transmission and other technologies, and executing secure multi-party computing protocols to complete nonlinear operation calculations such as activation functions. Based on secret sharing technology, multiple parties are allowed to participate in machine learning network model training or prediction, and the process will not disclose data or model information.

[0044] In addition to the above application areas, multi-party secure computing can also be applied to privacy-protected network security detection, joint statistical analysis of privacy-protected multi-party data, spam cleaning and filtering of encrypted emails, advertising conversion and other fields.

[0045] Among them, bilateral secure computing is usually used for joint statistical analysis of the two-party data with privacy protection, that is, to query across the two-party databases while protecting the private data of the two parties.

[0046] For example, consider the following Structure Query Language (SQL) statement:

[0047] select avg(a.key)from a join b on a.id=b.id;

[0048] This SQL statement is used to align table a and table b according to the id column, and then average a.key based on the aligned tables to obtain the query result. Table a is stored in the first party P0, and includes an id column and at least one feature column. Table b is stored in the second party P1, and includes an id column. P0 and P1 perform SQL queries through the secure computing technology of both parties, and do not expose their own private data to each other. After the query is completed, only the query result is exposed to the querying party, and the query result is stored in P0 and P1 in the form of shards.

[0049] Specifically, P0 and P1 align table a and table b according to the id column in the following way (which can be called PSI toshare): first, both parties obtain the intersection of the id columns of the two parties through PSI, where the intersection is held by P1 alone and is not exposed to P0; then, feature sharding is performed, that is, the features held by P0 and corresponding to the intersection are stored in the form of shards on P0 and P1, so that both parties can perform SQL queries based on the feature shards they hold.

[0050] In related technologies, feature sharding is usually implemented based on the DDH hypothesis and homomorphic encryption algorithm. The amount of data communication involved in this process is proportional to the data size of the large data volume. When the data volume is large, the communication overhead of feature sharding will be huge.

[0051] For example, P0 has N = 1 billion pieces of data, each piece of data contains h = 1000 features and an identifier (for example, id); P1 has d = 1 million pieces of data, each piece of data includes an identifier (for example, id). Among them, P0 is the party with a large amount of data. The communication volume involved in feature sharding based on the DDH hypothesis and homomorphic encryption algorithm is at the O(hN) level. It can be seen that the communication overhead of feature sharding is huge.

[0052] In view of this, the present disclosure provides a data processing method, apparatus, medium, device and product for secure computing to reduce the communication volume between the two parties during feature sharding.

[0053] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0054] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0055] The term "including" and its variations used herein are open inclusions, i.e., "including but not limited to". The term "based on" means "based at least in part on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0056] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0057] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0058] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0059] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0060] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.

[0061] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0062] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet the relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0063] At the same time, it is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.

[0064] Before describing the specific implementation of the present disclosure, the core idea of ​​the data processing method for secure computing in the present disclosure is first introduced.

[0065] In the present disclosure, the participants of secure computing include a first party and a second party, wherein the first party holds a first identification set, each identification in the first identification set corresponds to h-dimensional features, and the second party holds a second identification set, h≥1, that is, each identification in the first identification set corresponds to at least one-dimensional features. The first identification set and the second identification set both contain at least one identification, and the first identification set is different from the second identification set. In one embodiment, the number of identifications in the first identification set is much larger than the number of identifications in the second identification set. In this case, the first party is the party with a large amount of data. By way of example, the first party is the above-mentioned P0, and the second party is the above-mentioned P1.

[0066] The core idea of ​​the data processing method for secure computing is to convert the sharding problem of the features corresponding to the intersection of the first identification set and the second identification set into a polynomial evaluation problem. Specifically, the first party can encode each dimensional feature of at least some of the dimensional features in the h-dimensional features into a polynomial, so that the value of the polynomial on the corresponding identification is the value of the dimensional feature corresponding to the identification; then, calculate the value of each polynomial encoded by the first party on each identification in the intersection, wherein the value is distributed in the first party and the second party in the form of shards, and the value shards are the feature shards corresponding to the corresponding identification in the intersection.

[0067] The degree of each polynomial obtained by the first-party encoding is the number of identifiers in the first identifier set. The amount of communication when evaluating the polynomial is proportional to the degree of the polynomial. In this way, when the number of identifiers in the first identifier set is large, it indicates that the degree of each polynomial is high. If it is evaluated directly, the communication overhead will be huge. For this reason, the evaluation process of the polynomial can be considered to be split into two sub-processes of reducing the degree (i.e. reducing the degree of the polynomial) and evaluating, which are executed sequentially.

[0068] In the degree reduction subprocess, the degree of the polynomial is reduced from O(N) level to O(n) level, and in the evaluation subprocess, the O(n) degree polynomial is evaluated on the n identifiers of the intersection, where N is the number of identifiers in the first identifier set and n is the number of identifiers in the intersection. The degree of the polynomial can be reduced based on the following theorem:

[0069] Theorem: Let is a domain, x i is the i-th identifier in the intersection, is a polynomial group with coefficients on x, x is the independent variable, if Then there is Where i = 0,…,n-1, and f(x) are both polynomials in , that is, if a polynomial is equal to another polynomial mod g(x), then the two polynomials have the same value on the same label.

[0070] Specifically, first, the first party converts the polynomial f(x) into the following form:

[0071]

[0072] Among them, f k (x) is the kth polynomial whose degree is less than or equal to n-1.

[0073] Then, the second party prepares the data h k (x) = x kn mod g(x), k=1,2,…,L, Then we have:

[0074]

[0075] That is, polynomial The number of times is less than or equal to 2n-2, It is the polynomial obtained by reducing the degree of the polynomial f(x).

[0076] For example, N=7, n=3, f(x)=a0+a1x+a2x 2 +a3x 3 +a4x 4 +a5x 5 +a6x 6 +a7x 7 ,but At this point, f(x) can be converted into the following form:

[0077] f(x)=(a0+a1x+a2x 2 )+(a3+a4x+a5x 2 )x 3 +(a6+a7x+a8x 2 )x 6

[0078] Where f0(x)=a0+a1x+a2x 2 , f1(x)=a3+a4x+a5x 2 , f2(x)=a6+a7x+a8x 2 , a8 = 0. At this time, the second party prepares h1(x) = x 3 mod g(x), h2(x) = x 6 mod g(x).

[0079] Figure 1 FIG. 1 is a flow chart showing a data processing method for secure computing applied to a first party according to an exemplary embodiment. Figure 1 As shown, the method may include S101 to S104.

[0080] In S101, based on the first identification set, a data processing process based on the privacy set intersection protocol is performed with the second party, so that the second party obtains the intersection of the first identification set and the second identification set.

[0081] In the present disclosure, the first party and the second party jointly execute a data processing process based on the PSI protocol, that is, jointly execute the PSI protocol to obtain the intersection of the first identification set and the second identification set, wherein the intersection is held solely by the second party and is not exposed to the first party, thereby preventing the first party from locating the corresponding object in the second party through the features corresponding to the intersection, thereby protecting the second party's data privacy.

[0082] In S102, in response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the h-dimensional features, the first polynomial corresponding to the dimensional feature is reduced in degree according to the ciphertext polynomial to obtain a second polynomial.

[0083] In the present disclosure, the ciphertext polynomial is generated by the second party based on the intersection of the first identification set and the second identification set. Specifically, the second party can construct a fifth polynomial based on the intersection of the first identification set and the second identification set, and homomorphically encrypt the fifth polynomial to obtain the ciphertext polynomial.

[0084] For example, the fifth polynomial may be constructed based on the intersection of the first identification set and the second identification set by the following equation:

[0085] h k (x) = x kn mod g(x) k=1,2,…,L

[0086] Among them, there are L fifth polynomials, h k (x) is the kth fifth polynomial, and the second party obtains N by interacting with the first party.

[0087] After constructing L fifth polynomials, the second party can use the locally generated first homomorphic encryption private key to homomorphically encrypt the L fifth polynomials respectively, obtain L ciphertext polynomials, and send them to the first party. This process is the first interaction between the two parties in the feature sharding process, and the amount of communication involved is 2NBlogp, where B is the expansion coefficient of the ciphertext relative to the plaintext (for example, the number of expansions of the plaintext polynomial relative to the fifth polynomial), and p is the plaintext modulus of homomorphic encryption. Among them, the kth ciphertext polynomial is generated by the second party for h k (x)(i.e. x kn mod g(x)) is homomorphically encrypted.

[0088] The first polynomial corresponding to the dimensional feature can be constructed based on the dimensional feature corresponding to each identifier in the first identifier set, and the value of the first polynomial on any identifier in the first identifier set is the value of the dimensional feature corresponding to the identifier, that is, the first polynomial is constructed with each identifier in the first identifier set as an independent variable and the dimensional feature as a dependent variable, and the degree of the first polynomial is less than or equal to the number of identifiers in the first identifier set. In one embodiment, the first party can construct the first polynomial by an interpolation method (e.g., Lagrange interpolation method).

[0089] In addition, both parties may shard some of the dimensional features in the h-dimensional features, and in this case, the first party may perform down-order processing on the first polynomials corresponding to the dimensional features in the partial dimensional features according to the ciphertext polynomial sent by the second party; both parties may shard the h-dimensional features, and in this case, the first party may perform down-order processing on the first polynomials corresponding to the dimensional features in the h-dimensional features according to the ciphertext polynomial sent by the second party, and in this case, a total of h second polynomials are obtained. The present disclosure does not specifically limit the number of features to be sharded.

[0090] In S103, the value of the second polynomial on at least part of the identifiers in the intersection is calculated with the second party to obtain a first slice of the value.

[0091] In the present disclosure, after the first party and the second party jointly calculate the value of the second polynomial on at least part of the identifiers in the intersection, the first party can obtain the first slice of the value, and the second party can obtain the second slice of the value. The value of the second polynomial on at least part of the identifiers in the intersection is the feature slice corresponding to at least part of the identifiers in the intersection.

[0092] In addition, the first party and the second party may jointly calculate the value of the second polynomial at each identifier in the intersection, or may jointly calculate the value of the second polynomial at some identifiers in the intersection, and the present disclosure does not make specific limitations on this.

[0093] In S104, the target data processing task is executed based on the first slice.

[0094] In the present disclosure, the above-mentioned target data processing task is a SQL query task or a machine learning model training task.

[0095] In one embodiment, when the target data processing task is an SQL query task, the first party and the second party can jointly perform SQL queries based on the feature slices they each hold to obtain query result slices respectively. After that, both parties will feed back the query result slices they obtained to the query party respectively; after the query party receives the query result slices sent by both parties, it merges them to obtain the final query result.

[0096] Specifically, the first party can perform an SQL query together with the second party based on the first shard to obtain a first query result shard, and then feed the first query result shard back to the query party; correspondingly, the second party can perform an SQL query together with the first party based on the second shard to obtain a second query result shard, and then feed the second query result shard back to the query party; finally, the query party merges the first query result shard and the second query result shard to obtain the final query result.

[0097] In another embodiment, when the target data processing task is a machine learning model training task, the second party can use the features of the first party to perform model training, wherein the first party and the second party can perform model training in an MPC manner based on the feature slices they each hold, so as to obtain model parameter slices respectively, and then the first party sends the model parameter slices it holds to the second party, and the second party merges the model parameter slices obtained from the first party with the model parameter slices it holds, so as to obtain the model parameters of the corresponding model and complete the model training of the second party. In this way, when the second party lacks training data or the training data is insufficient, the features of the first party can be used for model training, which can improve the accuracy of model training while ensuring the privacy of the first party's data.

[0098] Specifically, the first party can jointly perform model training with the second party based on the first shard to obtain a first model parameter shard, and then feed the first model parameter shard back to the second party; correspondingly, the second party can jointly perform model training with the first party based on the second shard to obtain a second model parameter shard, and then merge the second model parameter shard with the first model parameter shard received from the first party to obtain a complete model parameter.

[0099] In the above technical solution, first, the first party and the second party jointly perform a data processing process based on the privacy set intersection protocol, and the second party obtains the intersection of the first identification set and the second identification set; then, the second party generates a ciphertext polynomial based on the intersection and sends it to the first party; next, the first party performs a degree reduction process on the first polynomial corresponding to the h-dimensional feature for each dimensional feature of at least some of the dimensional features held by itself according to the received ciphertext polynomial to obtain a second polynomial; then, the first party and the second party jointly calculate the value of the second polynomial on at least some of the identifications in the intersection to obtain the first shard and the second shard of the value respectively; finally, the first party and the second party respectively perform the target data processing task based on the shards held by themselves. In this way, the sharding problem of the features corresponding to the intersection of the two parties' identification sets can be cleverly converted into a polynomial evaluation problem, and the polynomial evaluation process can be divided into two sub-processes of degree reduction and evaluation. Among them, by reducing the degree of the polynomial, the degree of the polynomial to be evaluated can be reduced, thereby reducing the communication volume between the two parties when evaluating the polynomial (where the communication volume during polynomial evaluation is proportional to the degree of the polynomial), so that the communication volume between the two parties during feature sharding can be reduced, and the processing efficiency of the target data processing task can be improved. Therefore, this solution can protect data security and reduce communication volume in scenarios such as model training and SQL query.

[0100] The following is a detailed description of the specific implementation method of performing a degree reduction process on the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial in the above S102 to obtain the second polynomial. Specifically, it can be achieved by the following steps (21) to (23):

[0101] Step (21): Convert the first polynomial corresponding to the dimension feature into form.

[0102] Step (22): Set f k (x) is multiplied by the kth ciphertext polynomial to obtain the third polynomial, where k = 1, 2, …, L.

[0103] Among them, f k (x) is plaintext, and k ciphertext polynomials are ciphertext. At this time, the plaintext and ciphertext multiplication protocol can be used to multiply the two to obtain the third polynomial.

[0104] Step (23): Determine the sum of each third polynomial and f0(x) as the second polynomial.

[0105] The sum of each third polynomial and f0(x) is It is equal to That is, we get the second polynomial

[0106] The following is a detailed description of the specific implementation method of calculating the value of the second polynomial on at least part of the identifiers in the intersection with the second square in the above S103 to obtain the first slice of the value. Specifically, it can be implemented by the following steps (31) to (33):

[0107] Step (31): Generate a random polynomial of the same degree as the second polynomial.

[0108] Step (32): Masking the second polynomial with a random polynomial to obtain a masked polynomial, and sending the masked polynomial to the second party so that the second party decrypts the masked polynomial to obtain a fourth polynomial.

[0109] Specifically, the difference between the second polynomial and the random polynomial can be determined as a masking polynomial and sent to the second party; after receiving the masking polynomial, the second party can use the first homomorphic encryption private key to decrypt it and obtain the fourth polynomial. This process is the second interaction between the two parties in the feature sharding process, that is, the first party sends the masking polynomial to the second party, and the communication volume involved is 2wBlogp (for a single second polynomial). In this way, the total communication volume involved in all second polynomials is 2mwBlogp, where m is the feature dimension contained in the at least partially dimensional feature, that is, the number of second polynomials, and w is the number of identifiers in the at least partially identified. If both parties shard the h-dimensional feature, then m=h, and if both parties jointly calculate the value of the second polynomial on each identifier in the intersection, then w=n.

[0110] Step (33): Based on the random polynomial, execute the sharded polynomial evaluation protocol with the second party to obtain a first shard of the value of the second polynomial on at least part of the identification in the intersection, wherein the second party executes the sharded polynomial evaluation protocol based on the fourth polynomial.

[0111] In the present disclosure, the first party may jointly execute a Shared Polynomial Evaluation Protocol based on a random polynomial, and the second party may jointly execute a Shared Polynomial Evaluation Protocol based on a fourth polynomial to respectively obtain slices of values ​​of the second polynomial on at least part of the identifiers in the intersection.

[0112] The following is a detailed description of the specific implementation method of executing the shard polynomial evaluation protocol with the second party based on the random polynomial in the above step (33) to obtain the first shard of the value of the second polynomial on at least part of the identifiers in the intersection. Specifically, it can be achieved by the following steps (331) to (333):

[0113] Step (331): Perform homomorphic encryption on the coefficient vector of the random polynomial to obtain an encrypted vector.

[0114] Step (332): Send the encrypted vector to the second party, so that the second party generates a difference vector based on the encrypted vector and the fourth polynomial, and sends the difference vector to the first party.

[0115] Step (333): In response to receiving the difference vector sent by the second party, the difference vector is decrypted to obtain a first slice of the value.

[0116] Specifically, the first party can use the locally generated second homomorphic encryption private key to homomorphically encrypt the coefficient vector of the random polynomial to obtain an encrypted vector, and send it to the second party; after the second party receives the encrypted vector, it can generate a difference vector based on the encrypted vector and the fourth polynomial, and send it to one party; the first party uses the second homomorphic encryption private key to decrypt the received difference vector to obtain a first slice of the values ​​of the second polynomial on at least part of the identification in the intersection.

[0117] The second party may generate a difference vector based on the encrypted vector and the fourth polynomial in the following manner:

[0118] First, the coefficient vector of the fourth polynomial and the sum of the encrypted vector are used as the coefficient vector to generate the sixth polynomial; then, each identifier in at least part of the identifiers in the intersection is substituted into the sixth polynomial to obtain a result vector, wherein after each identifier in at least part of the identifiers in the intersection is substituted into the sixth polynomial, the value of the sixth polynomial on the identifier can be obtained, and these values ​​constitute the result vector; next, a random vector with the same length as the result vector is generated, and the difference between the result vector and the random vector is determined as a difference vector. The second party uses the random vector as the second slice of the value of the second polynomial on at least part of the identifiers in the intersection.

[0119] The above step (332) is the third interaction between the two parties in the feature sharding process, that is, the first party sends the encrypted vector to the second party, and the communication volume involved is zBlogp (for a single second polynomial), and the total communication volume involved in all second polynomials is: mzBlogp, where z is the degree of the second polynomial; the above step (333) is the fourth interaction between the two parties in the feature sharding process, that is, the second party sends the difference vector to the first party, and the communication volume involved is wBlogp (for a single second polynomial), and the total communication volume involved in all second polynomials is mwBlogp; therefore, the total communication volume involved in the above step (33) is (w+z)Blogp (for a single second polynomial), and the total communication volume involved in all second polynomials is m(w+z)Blogp.

[0120] It can be seen that in the entire feature sharding process, the two parties interacted in four aspects, and the communication volume involved was 2NBlogp, 2mwBlogp, mzBlogp, and mwBlogp respectively. Therefore, the total communication volume involved in the entire feature sharding process is (2N+3mw+mz)Blogp, and the communication volume involved is no longer at the O(hN) level, which is greatly reduced compared to the communication volume at the O(hN) level.

[0121] Figure 2 FIG. 1 is a flow chart showing a data processing method for secure computing applied to a second party according to an exemplary embodiment. Figure 2 As shown, the method may include S201 to S205.

[0122] In S201, based on the second identification set, a data processing process based on the privacy set intersection protocol is performed with the first party to obtain the intersection of the first identification set and the second identification set.

[0123] In the present disclosure, participants in secure computing include a first party and a second party. The first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature (also held by the first party), and the second party holds a second identification set, h≥1.

[0124] In S202, based on the intersection, a fifth polynomial is constructed, and the fifth polynomial is homomorphically encrypted to obtain a ciphertext polynomial.

[0125] In S203, the ciphertext polynomial is sent to the first party, so that the first party can reduce the order of the first polynomial corresponding to each dimensional feature of at least some of the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial.

[0126] The first polynomial is constructed by the first party based on the features of the dimension corresponding to each identifier in the first identifier set;

[0127] In S204, the value of the second polynomial on at least part of the identifiers in the intersection is calculated with the first party to obtain a second slice of the value.

[0128] In S205, the target data processing task is executed based on the second slice.

[0129] In the above technical solution, first, the first party and the second party jointly perform a data processing process based on the privacy set intersection protocol, and the second party obtains the intersection of the first identification set and the second identification set; then, the second party generates a ciphertext polynomial based on the intersection and sends it to the first party; next, the first party performs a degree reduction process on the first polynomial corresponding to the h-dimensional feature for each dimensional feature of at least some of the dimensional features held by itself according to the received ciphertext polynomial to obtain a second polynomial; then, the first party and the second party jointly calculate the value of the second polynomial on at least some of the identifications in the intersection to obtain the first shard and the second shard of the value respectively; finally, the first party and the second party respectively perform the target data processing task based on the shards held by themselves. In this way, the sharding problem of the features corresponding to the intersection of the two parties' identification sets can be cleverly converted into a polynomial evaluation problem, and the polynomial evaluation process can be divided into two sub-processes of degree reduction and evaluation. Among them, by reducing the degree of the polynomial, the degree of the polynomial to be evaluated can be reduced, thereby reducing the communication volume between the two parties when evaluating the polynomial (where the communication volume during polynomial evaluation is proportional to the degree of the polynomial), so that the communication volume between the two parties during feature sharding can be reduced, and the processing efficiency of the target data processing task can be improved. Therefore, this solution can protect data security and reduce communication volume in scenarios such as model training and SQL query.

[0130] Optionally, based on the intersection, a fifth polynomial is constructed, including:

[0131] Based on the intersection, the fifth polynomial is constructed by the following formula:

[0132] h k (x) = x kn mod g(x)

[0133] Among them, there are L fifth polynomials, h k (x) is the kth fifth polynomial, k = 1, 2, ..., L, N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable.

[0134] Optionally, calculating the value of the second polynomial on at least part of the identifiers in the intersection with the first party to obtain a second slice of the value includes:

[0135] In response to receiving the masking polynomial sent by the first party, decrypting the masking polynomial to obtain a fourth polynomial, wherein the masking polynomial is obtained by masking a random polynomial generated by the first party itself;

[0136] Based on the fourth polynomial, a sharded polynomial evaluation protocol is performed with the first party to obtain a second shard of values ​​of the second polynomial on at least part of the identifiers in the intersection, wherein the first party performs the sharded polynomial evaluation protocol based on the random polynomial.

[0137] Optionally, based on the fourth polynomial, executing a shard polynomial evaluation protocol with the first party to obtain a second shard of values ​​of the second polynomial on at least part of the identifiers in the intersection includes:

[0138] receiving an encrypted vector sent by the first party, wherein the encrypted vector is obtained by the first party performing homomorphic encryption on a coefficient vector of a random polynomial;

[0139] Generate a sixth polynomial using the sum of the coefficient vector of the fourth polynomial and the encrypted vector as the coefficient vector;

[0140] Substituting each identifier in at least part of the identifiers in the intersection into the sixth polynomial to obtain a result vector;

[0141] Generate a random vector with the same length as the result vector, and use the random vector as the second slice of the value;

[0142] The difference vector is sent to the first party, where the difference vector is the difference between the result vector and the random vector.

[0143] Optionally, the target data processing task is a structured query language query task or a machine learning model training task.

[0144] The specific implementation methods of each step in the data processing method for secure computing applied to the second party according to the embodiment of the present disclosure have been described in detail in the data processing method for secure computing applied to the first party according to the embodiment of the present disclosure, and will not be repeated here.

[0145] Figure 3 The block diagram of a data processing device for secure computing applied to a first party is shown according to an exemplary embodiment. The participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1. Figure 3 As shown, the device 300 includes:

[0146] A first intersection module 301, configured to perform a data processing process based on a privacy set intersection protocol with the second party based on the first identifier set, so that the second party obtains an intersection of the first identifier set and the second identifier set;

[0147] A reduction module 302 is used for, in response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, reducing the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; a first evaluation module 303 is used for calculating with the second party the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value;

[0148] The first execution module 304 is used to execute the target data processing task based on the first slice.

[0149] In the above technical solution, first, the first party and the second party jointly perform a data processing process based on the privacy set intersection protocol, and the second party obtains the intersection of the first identification set and the second identification set; then, the second party generates a ciphertext polynomial based on the intersection and sends it to the first party; next, the first party performs a degree reduction process on the first polynomial corresponding to the h-dimensional feature for each dimensional feature of at least some of the dimensional features held by itself according to the received ciphertext polynomial to obtain a second polynomial; then, the first party and the second party jointly calculate the value of the second polynomial on at least some of the identifications in the intersection to obtain the first shard and the second shard of the value respectively; finally, the first party and the second party respectively perform the target data processing task based on the shards held by themselves. In this way, the sharding problem of the features corresponding to the intersection of the two parties' identification sets can be cleverly converted into a polynomial evaluation problem, and the polynomial evaluation process can be divided into two sub-processes of degree reduction and evaluation. Among them, by reducing the degree of the polynomial, the degree of the polynomial to be evaluated can be reduced, thereby reducing the communication volume between the two parties when evaluating the polynomial (where the communication volume during polynomial evaluation is proportional to the degree of the polynomial), so that the communication volume between the two parties during feature sharding can be reduced, and the processing efficiency of the target data processing task can be improved. Therefore, this solution can protect data security and reduce communication volume in scenarios such as model training and SQL query.

[0150] Optionally, the number of the ciphertext polynomials is L, and the kth ciphertext polynomial is generated by the second party for x kn mod g(x) is homomorphically encrypted to obtain k=1,2,…,L, where N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable;

[0151] The step of reducing the degree of the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain the second polynomial includes:

[0152] Convert the first polynomial corresponding to the dimension feature into The form, where f k (x) is the kth polynomial;

[0153] f k (x) multiplying the k-th ciphertext polynomial to obtain a third polynomial, where k = 1, 2, ..., L;

[0154] The sum of each of the third polynomials and f0(x) is determined as the second polynomial.

[0155] Optionally, the first evaluation module 303 includes:

[0156] A first generating submodule, used for generating a random polynomial of the same degree as the second polynomial;

[0157] a masking processing submodule, configured to perform masking processing on the second polynomial using the random polynomial to obtain a masked polynomial, and send the masked polynomial to the second party so that the second party decrypts the masked polynomial to obtain a fourth polynomial;

[0158] A first execution submodule is configured to execute a sharded polynomial evaluation protocol with the second party based on the random polynomial to obtain a first shard of values ​​of the second polynomial at least partially identified in the intersection, wherein the second party executes the sharded polynomial evaluation protocol based on the fourth polynomial.

[0159] Optionally, the first execution submodule includes:

[0160] An encryption submodule, used for performing homomorphic encryption on the coefficient vector of the random polynomial to obtain an encrypted vector;

[0161] a first sending submodule, configured to send the encrypted vector to the second party, so that the second party generates a difference vector based on the encrypted vector and the fourth polynomial, and sends the difference vector to the first party;

[0162] The first decryption submodule is used to, in response to receiving the difference vector sent by the second party, decrypt the difference vector to obtain the first slice of the value.

[0163] Optionally, the target data processing task is a structured query language query task or a machine learning model training task.

[0164] Figure 4The present invention is a block diagram of a data processing device for secure computing applied to a second party according to an exemplary embodiment. The participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1. Figure 4 As shown, the device 400 includes:

[0165] A second intersection module 401 is used to perform a data processing process based on a privacy set intersection protocol with the first party based on the second identification set to obtain an intersection of the first identification set and the second identification set;

[0166] An encryption module 402 is used to construct a fifth polynomial based on the intersection, and perform homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial;

[0167] A sending module 403 is used to send the ciphertext polynomial to the first party, so that the first party can reduce the order of the first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; a second evaluation module 404 is used to calculate with the first party the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value;

[0168] The second execution module 405 is used to execute the target data processing task based on the second slice.

[0169] In the above technical solution, first, the first party and the second party jointly perform a data processing process based on the privacy set intersection protocol, and the second party obtains the intersection of the first identification set and the second identification set; then, the second party generates a ciphertext polynomial based on the intersection and sends it to the first party; next, the first party performs a degree reduction process on the first polynomial corresponding to the h-dimensional feature for each dimensional feature of at least some of the dimensional features held by itself according to the received ciphertext polynomial to obtain a second polynomial; then, the first party and the second party jointly calculate the value of the second polynomial on at least some of the identifications in the intersection to obtain the first shard and the second shard of the value respectively; finally, the first party and the second party respectively perform the target data processing task based on the shards held by themselves. In this way, the sharding problem of the features corresponding to the intersection of the two parties' identification sets can be cleverly converted into a polynomial evaluation problem, and the polynomial evaluation process can be divided into two sub-processes of degree reduction and evaluation. Among them, by reducing the degree of the polynomial, the degree of the polynomial to be evaluated can be reduced, thereby reducing the communication volume between the two parties when evaluating the polynomial (where the communication volume during polynomial evaluation is proportional to the degree of the polynomial), so that the communication volume between the two parties during feature sharding can be reduced, and the processing efficiency of the target data processing task can be improved. Therefore, this solution can protect data security and reduce communication volume in scenarios such as model training and SQL query.

[0170] Optionally, the encryption module 402 includes a construction submodule, wherein the construction submodule is used to construct a fifth polynomial based on the intersection by using the following formula:

[0171] h k (x) = x kn mod g(x)

[0172] Among them, the fifth polynomial is L, h k (x) is the kth fifth polynomial, k = 1, 2, ..., L, N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable.

[0173] Optionally, the second evaluation module 404 includes:

[0174] a second decryption submodule, configured to, in response to receiving the masking polynomial sent by the first party, decrypt the masking polynomial to obtain a fourth polynomial, wherein the masking polynomial is obtained by masking a random polynomial generated by the first party itself;

[0175] a second execution submodule, for executing a sharded polynomial evaluation protocol with the first party based on the fourth polynomial to obtain a second shard of values ​​of the second polynomial at least partially identified in the intersection, wherein the first party executes the sharded polynomial evaluation protocol based on the random polynomial.

[0176] Optionally, the second execution submodule includes:

[0177] a receiving submodule, configured to receive an encrypted vector sent by the first party, wherein the encrypted vector is obtained by the first party performing homomorphic encryption on a coefficient vector of the random polynomial;

[0178] A second generating submodule, configured to generate a sixth polynomial by taking the sum of the coefficient vector of the fourth polynomial and the encrypted vector as the coefficient vector;

[0179] A substitution submodule, used for substituting each identifier in at least part of the identifiers in the intersection into the sixth polynomial to obtain a result vector;

[0180] A third generating submodule is used to generate a random vector with the same length as the result vector, and use the random vector as the second slice of the value;

[0181] The second sending submodule is used to send the difference vector to the first party, wherein the difference vector is the difference between the result vector and the random vector.

[0182] Optionally, the target data processing task is a structured query language query task or a machine learning model training task.

[0183] The present disclosure also provides a computer-readable medium having a computer program stored thereon, which, when executed by a processing device, implements the steps of the above-mentioned data processing method for secure computing applied to a first party or the steps of the data processing method for secure computing applied to a second party provided by the present disclosure.

[0184] The present disclosure also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the above-mentioned data processing method for secure computing applied to a first party or the steps of the data processing method for secure computing applied to a second party provided by the present disclosure.

[0185] Reference below Figure 5, which shows a schematic diagram of the structure of an electronic device (such as a terminal device or a server) 600 suitable for implementing the embodiment of the present disclosure. The terminal device in the embodiment of the present disclosure may include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0186] like Figure 5 As shown, the electronic device 600 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage device 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the electronic device 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0187] Typically, the following devices may be connected to the I / O interface 605: an input device 606 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 607 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 608 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 609. The communication device 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 5 The electronic device 600 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0188] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 609, or installed from a storage device 608, or installed from a ROM 602. When the computer program is executed by the processing device 601, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0189] It should be noted that the computer-readable medium disclosed above may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0190] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0191] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0192] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: based on the first identification set, performs a data processing process based on the privacy set intersection protocol with the second party, so that the second party obtains the intersection of the first identification set and the second identification set, wherein the participants in the secure calculation include the first party and the second party, the first party holds the first identification set, each identification in the first identification set corresponds to h-dimensional features, and the second party holds the second identification set, h≥1; in response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, according to the ciphertext polynomial, the first polynomial corresponding to the dimensional feature is reduced in degree to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identification in the first identification set; calculates with the second party the value of the second polynomial on at least some of the identifications in the intersection to obtain a first shard of the value; and executes the target data processing task based on the first shard.

[0193] Alternatively, the computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: based on the second identification set, performs a data processing process based on the privacy set intersection protocol with the first party to obtain the intersection of the first identification set and the second identification set, wherein the participants in the secure calculation include the first party and the second party, the first party holds the first identification set, each identification in the first identification set corresponds to h-dimensional features, and the second party holds the second identification set, h≥1; based on the intersection, constructs a fifth polynomial, and homomorphically encrypts the fifth polynomial to obtain a ciphertext polynomial; sends the ciphertext polynomial to the first party, so that the first party reduces the order of the first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional feature corresponding to each identification in the first identification set; calculates with the first party the value of the second polynomial on at least some of the identifications in the intersection to obtain a second shard of the value; and executes the target data processing task based on the second shard.

[0194] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including, but not limited to, object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0195] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0196] The modules involved in the embodiments described in the present disclosure may be implemented by software or hardware. The name of the module does not limit the module itself in some cases. For example, the first execution module may also be described as "a module for executing a target data processing task based on the first shard".

[0197] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0198] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0199] According to one or more embodiments of the present disclosure, Example 1 provides a data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, wherein the first party holds a first identification set, wherein each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1. The method is applied to the first party, and includes:

[0200] Based on the first identifier set, performing a data processing process based on a privacy set intersection protocol with the second party, so that the second party obtains an intersection of the first identifier set and the second identifier set;

[0201] In response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, according to the ciphertext polynomial, a first polynomial corresponding to the dimensional feature is reduced in degree to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; and calculating with the second party the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value;

[0202] Execute a target data processing task based on the first shard.

[0203] According to one or more embodiments of the present disclosure, Example 2 provides the method of Example 1, wherein the number of the ciphertext polynomials is L, and the kth ciphertext polynomial is generated by the second party for x kn mod g(x) is homomorphically encrypted to obtain k=1,2,…,L, where N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x iis the i-th identifier in the intersection, and x is the independent variable;

[0204] The step of reducing the degree of the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain the second polynomial includes:

[0205] Convert the first polynomial corresponding to the dimension feature into The form, where f k (x) is the kth polynomial;

[0206] f k (x) multiplying the k-th ciphertext polynomial to obtain a third polynomial, where k = 1, 2, ..., L;

[0207] The sum of each of the third polynomials and f0(x) is determined as the second polynomial.

[0208] According to one or more embodiments of the present disclosure, Example 3 provides the method of Example 1, wherein calculating the value of the second polynomial on at least part of the identifier in the intersection with the second party to obtain a first slice of the value includes:

[0209] generating a random polynomial of the same degree as the second polynomial;

[0210] masking the second polynomial using the random polynomial to obtain a masked polynomial, and sending the masked polynomial to the second party so that the second party decrypts the masked polynomial to obtain a fourth polynomial;

[0211] Based on the random polynomial, a sharded polynomial evaluation protocol is executed with the second party to obtain a first shard of values ​​of the second polynomial on at least a portion of the identifiers in the intersection, wherein the second party executes the sharded polynomial evaluation protocol based on the fourth polynomial.

[0212] According to one or more embodiments of the present disclosure, Example 4 provides the method of Example 3, wherein based on the random polynomial, executing the shard polynomial evaluation protocol with the second party to obtain a first shard of the value of the second polynomial on at least part of the identifiers in the intersection includes:

[0213] Performing homomorphic encryption on the coefficient vector of the random polynomial to obtain an encrypted vector;

[0214] Sending the encrypted vector to the second party, so that the second party generates a difference vector based on the encrypted vector and the fourth polynomial, and sends the difference vector to the first party;

[0215] In response to receiving the difference vector sent by the second party, the difference vector is decrypted to obtain the first slice of the value.

[0216] According to one or more embodiments of the present disclosure, Example 5 provides the method described in any one of Examples 1-4, wherein the target data processing task is a structured query language query task or a machine learning model training task.

[0217] According to one or more embodiments of the present disclosure, Example 6 provides a data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the method is applied to the second party, including:

[0218] Based on the second identifier set, performing a data processing process based on a privacy set intersection protocol with the first party to obtain an intersection of the first identifier set and the second identifier set;

[0219] Based on the intersection, construct a fifth polynomial, and perform homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial;

[0220] The ciphertext polynomial is sent to the first party, so that the first party performs a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to reduce the order of the first polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; and the first party calculates the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value;

[0221] Execute the target data processing task based on the second shard.

[0222] According to one or more embodiments of the present disclosure, Example 7 provides the method of Example 6, wherein constructing a fifth polynomial based on the intersection includes:

[0223] Based on the intersection, the fifth polynomial is constructed by the following formula:

[0224] h k (x) = x kn mod g(x)

[0225] Among them, the fifth polynomial is L, h k (x) is the kth fifth polynomial, k = 1, 2, ..., L, N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, xi is the i-th identifier in the intersection, and x is the independent variable.

[0226] According to one or more embodiments of the present disclosure, Example 8 provides the method of Example 6, wherein calculating the value of the second polynomial on at least part of the identifier in the intersection with the first party to obtain a second slice of the value includes:

[0227] In response to receiving the masking polynomial sent by the first party, decrypting the masking polynomial to obtain a fourth polynomial, wherein the masking polynomial is obtained by masking a random polynomial generated by the first party itself;

[0228] Based on the fourth polynomial, a sharded polynomial evaluation protocol is performed with the first party to obtain a second shard of values ​​of the second polynomial on at least part of the identifiers in the intersection, wherein the first party performs the sharded polynomial evaluation protocol based on the random polynomial.

[0229] According to one or more embodiments of the present disclosure, Example 9 provides the method of Example 8, wherein based on the fourth polynomial, executing the shard polynomial evaluation protocol with the first party to obtain a second shard of the value of the second polynomial on at least part of the identifiers in the intersection, includes:

[0230] receiving an encrypted vector sent by the first party, wherein the encrypted vector is obtained by the first party performing homomorphic encryption on a coefficient vector of the random polynomial;

[0231] Generate a sixth polynomial by taking the sum of the coefficient vector of the fourth polynomial and the encrypted vector as the coefficient vector;

[0232] Substituting each identifier in at least part of the identifiers in the intersection into the sixth polynomial to obtain a result vector;

[0233] Generate a random vector with the same length as the result vector, and use the random vector as the second slice of the value;

[0234] A difference vector is sent to the first party, wherein the difference vector is a difference between the result vector and the random vector.

[0235] According to one or more embodiments of the present disclosure, Example 10 provides the method described in any one of Examples 6-9, wherein the target data processing task is a structured query language query task or a machine learning model training task.

[0236] According to one or more embodiments of the present disclosure, Example 11 provides a data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the device is applied to the first party, including:

[0237] A first intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the second party based on the first identifier set, so that the second party obtains an intersection of the first identifier set and the second identifier set;

[0238] A reduction module is used for, in response to receiving the ciphertext polynomial sent by the second party, reducing the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; a first evaluation module is used for calculating, with the second party, the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value;

[0239] A first execution module is used to execute a target data processing task based on the first slice.

[0240] According to one or more embodiments of the present disclosure, Example 12 provides a data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, the first party holds a first identification set, each identification in the first identification set corresponds to an h-dimensional feature, the second party holds a second identification set, h≥1, and the device is applied to the second party, including:

[0241] A second intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the first party based on the second identifier set, to obtain an intersection of the first identifier set and the second identifier set;

[0242] An encryption module, used for constructing a fifth polynomial based on the intersection, and performing homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial;

[0243] a sending module, configured to send the ciphertext polynomial to the first party, so that the first party can reduce the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; and a second evaluation module, configured to calculate with the first party the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value;

[0244] A second execution module is used to execute a target data processing task based on the second slice.

[0245] According to one or more embodiments of the present disclosure, Example 13 provides a computer-readable medium having a computer program stored thereon, which implements the steps of any of the methods described in Examples 1-10 when executed by a processing device.

[0246] According to one or more embodiments of the present disclosure, Example 14 provides an electronic device, including:

[0247] a storage device having a computer program stored thereon;

[0248] A processing device is used to execute the computer program in the storage device to implement the steps of the method described in any one of Examples 1-10.

[0249] According to one or more embodiments of the present disclosure, Example 15 provides a computer program product, including a computer program, which implements the steps of any one of the methods of Examples 1-10 when executed by a processor.

[0250] The above description is only a preferred embodiment of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present disclosure (but not limited to) by each other to form a technical solution.

[0251] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0252] Although the subject matter has been described in language specific to structural features and / or method logic actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims. Regarding the device in the above 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.

Claims

1. A data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, wherein the first party holds a first identification set, wherein each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1, characterized in that: The method is applied to the first party, comprising: Based on the first identifier set, performing a data processing process based on a privacy set intersection protocol with the second party, so that the second party obtains an intersection of the first identifier set and the second identifier set; In response to receiving the ciphertext polynomial sent by the second party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, according to the ciphertext polynomial, a first polynomial corresponding to the dimensional feature is reduced in degree to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; generating a random polynomial of the same degree as the second polynomial; masking the second polynomial using the random polynomial to obtain a masked polynomial, and sending the masked polynomial to the second party so that the second party decrypts the masked polynomial to obtain a fourth polynomial; Based on the random polynomial, executing a sharded polynomial evaluation protocol with the second party to obtain a first shard of values ​​of the second polynomial on at least a portion of the identifiers in the intersection, wherein the second party executes the sharded polynomial evaluation protocol based on the fourth polynomial; Execute a target data processing task based on the first shard; There are L ciphertext polynomials, and the kth ciphertext polynomial is generated by the second party for x kn modg(x) is homomorphically encrypted to obtain k=1,2,…,L, where N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable; The step of reducing the degree of the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain the second polynomial includes: Convert the first polynomial corresponding to the dimension feature into The form, where f k (x) is the kth polynomial; f k (x) multiplying the k-th ciphertext polynomial to obtain a third polynomial, where k = 1, 2, ..., L; The sum of each of the third polynomials and f0(x) is determined as the second polynomial.

2. The method according to claim 1, characterized in that: The step of executing a shard polynomial evaluation protocol with the second party based on the random polynomial to obtain a first shard of the value of the second polynomial on at least part of the identifiers in the intersection includes: Performing homomorphic encryption on the coefficient vector of the random polynomial to obtain an encrypted vector; Sending the encrypted vector to the second party, so that the second party generates a difference vector based on the encrypted vector and the fourth polynomial, and sends the difference vector to the first party; In response to receiving the difference vector sent by the second party, the difference vector is decrypted to obtain the first slice of the value.

3. The method according to claim 1 or 2, characterized in that: The target data processing task is a structured query language query task or a machine learning model training task.

4. A data processing method for secure computing, wherein the participants of the secure computing include a first party and a second party, wherein the first party holds a first identification set, wherein each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1, characterized in that: The method is applied to the second party, comprising: Based on the second identifier set, performing a data processing process based on a privacy set intersection protocol with the first party to obtain an intersection of the first identifier set and the second identifier set; Based on the intersection, construct a fifth polynomial, and perform homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial; Send the ciphertext polynomial to the first party, so that the first party, for each dimensional feature of at least some of the dimensional features in the h-dimensional features, performs a degree reduction process on the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional feature corresponding to each identifier in the first identifier set; in response to receiving the masking polynomial sent by the first party, decrypt the masking polynomial to obtain a fourth polynomial, wherein the masking polynomial is obtained by masking a random polynomial generated by the first party; based on the fourth polynomial, perform a sharding polynomial evaluation protocol with the first party to obtain a second shard of the value of the second polynomial on at least some of the identifiers in the intersection, wherein the first party performs the sharding polynomial evaluation protocol based on the random polynomial; Execute the target data processing task based on the second shard; Wherein, constructing a fifth polynomial based on the intersection includes: Based on the intersection, the fifth polynomial is constructed by the following formula: h k (x)=x kn modg(x) Among them, the fifth polynomial is L, h k (x) is the kth fifth polynomial, k = 1, 2, ..., L, N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable.

5. The method according to claim 4, characterized in that The step of executing a shard polynomial evaluation protocol with the first party based on the fourth polynomial to obtain a second shard of the value of the second polynomial on at least part of the identifiers in the intersection includes: receiving an encrypted vector sent by the first party, wherein the encrypted vector is obtained by the first party performing homomorphic encryption on a coefficient vector of the random polynomial; Generate a sixth polynomial by taking the sum of the coefficient vector of the fourth polynomial and the encrypted vector as the coefficient vector; Substituting each identifier in at least part of the identifiers in the intersection into the sixth polynomial to obtain a result vector; Generate a random vector with the same length as the result vector, and use the random vector as the second slice of the value; A difference vector is sent to the first party, wherein the difference vector is a difference between the result vector and the random vector.

6. The method according to claim 4 or 5, characterized in that: The target data processing task is a structured query language query task or a machine learning model training task.

7. A data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, wherein the first party holds a first identification set, wherein each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1, characterized in that: The device is applied to the first party and includes: A first intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the second party based on the first identifier set, so that the second party obtains an intersection of the first identifier set and the second identifier set; A reduction module is used for, in response to receiving the ciphertext polynomial sent by the second party, reducing the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the ciphertext polynomial is generated by the second party based on the intersection, and the first polynomial is constructed based on the dimensional feature corresponding to each identifier in the first identifier set; a first evaluation module is used for calculating, with the second party, the value of the second polynomial on at least some of the identifiers in the intersection to obtain a first slice of the value; A first execution module, configured to execute a target data processing task based on the first shard; There are L ciphertext polynomials, and the kth ciphertext polynomial is generated by the second party for x kn modg(x) is homomorphically encrypted to obtain k=1,2,…,L, where N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable; The step of reducing the degree of the first polynomial corresponding to the dimensional feature according to the ciphertext polynomial to obtain the second polynomial includes: Convert the first polynomial corresponding to the dimension feature into The form, where f k (x) is the kth polynomial; f k (x) multiplying the k-th ciphertext polynomial to obtain a third polynomial, where k = 1, 2, ..., L; Determine the sum of each of the third polynomials and f0(x) as the second polynomial; The first evaluation module comprises: A first generating submodule, used for generating a random polynomial of the same degree as the second polynomial; a masking processing submodule, configured to perform masking processing on the second polynomial using the random polynomial to obtain a masked polynomial, and send the masked polynomial to the second party so that the second party decrypts the masked polynomial to obtain a fourth polynomial; A first execution submodule is configured to execute a sharded polynomial evaluation protocol with the second party based on the random polynomial to obtain a first shard of values ​​of the second polynomial at least partially identified in the intersection, wherein the second party executes the sharded polynomial evaluation protocol based on the fourth polynomial.

8. A data processing device for secure computing, wherein the participants of the secure computing include a first party and a second party, wherein the first party holds a first identification set, wherein each identification in the first identification set corresponds to an h-dimensional feature, and the second party holds a second identification set, where h≥1, characterized in that: The device is applied to the second party, and includes: A second intersection module, configured to perform a data processing process based on a privacy set intersection protocol with the first party based on the second identifier set, to obtain an intersection of the first identifier set and the second identifier set; An encryption module, used for constructing a fifth polynomial based on the intersection, and performing homomorphic encryption on the fifth polynomial to obtain a ciphertext polynomial; a sending module, configured to send the ciphertext polynomial to the first party, so that the first party can reduce the order of a first polynomial corresponding to each dimensional feature of at least some of the dimensional features in the h-dimensional features according to the ciphertext polynomial to obtain a second polynomial, wherein the first polynomial is constructed by the first party based on the dimensional features corresponding to each identifier in the first identifier set; and a second evaluation module, configured to calculate with the first party the value of the second polynomial on at least some of the identifiers in the intersection set to obtain a second slice of the value; A second execution module, configured to execute a target data processing task based on the second shard; The encryption module includes a construction submodule, wherein the construction submodule is used to construct a fifth polynomial based on the intersection by the following formula: h k (x)=x kn modg(x) Among them, the fifth polynomial is L, h k (x) is the kth fifth polynomial, k = 1, 2, ..., L, N is the number of identifiers in the first identifier set, n is the number of identifiers in the intersection set, x i is the i-th identifier in the intersection, and x is the independent variable; Wherein, the second evaluation module comprises: a second decryption submodule, configured to, in response to receiving the masking polynomial sent by the first party, decrypt the masking polynomial to obtain a fourth polynomial, wherein the masking polynomial is obtained by masking a random polynomial generated by the first party itself; a second execution submodule, for executing a sharded polynomial evaluation protocol with the first party based on the fourth polynomial to obtain a second shard of values ​​of the second polynomial at least partially identified in the intersection, wherein the first party executes the sharded polynomial evaluation protocol based on the random polynomial.

9. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processing device, the steps of the method described in any one of claims 1 to 6 are implemented.

10. An electronic device, characterized in that: include: a storage device having a computer program stored thereon; A processing device, configured to execute the computer program in the storage device to implement the steps of the method according to any one of claims 1 to 6.

11. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.