Privacy set intersection method, device and storage medium based on multi-party secure computing

By generating and sharing batch mapping tables and subsecret tables, the privacy set submission without third-party participation and data scales are realized in multi-party security calculations, which solves the problem of inefficiency in the existing technology and improves the privacy set submission Efficiency and safety.

CN114826580BActive Publication Date: 2024-11-22TONGDUN NETWORK TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210456602.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-24
Publication Date
2024-11-22
Estimated Expiration
2042-04-24

AI Technical Summary

Technical Problem

In the prior art, the submission of privacy sets of multi-party security calculations requires third parties to participate, and the data size of each participant is required to be the same, resulting in low efficiency.

Method used

By determining that the intersection calculation party receives the mapping parameter group, generates a batch mapping table and generates a subsecret table for secret sharing, each participant sums the subsecret table, and the intersection calculation party uses the summing result and the batch mapping table to obtain multiple participants The intersection of data sets of the parties enables the interception of privacy sets without third-party participation and different data scales.

Benefits of technology

It improves the efficiency of privacy collection submission, ensures the security of data of each participant, and allows different data sets of each participant to be different.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114826580B_ABST
    Figure CN114826580B_ABST
Patent Text Reader

Abstract

The present disclosure is about a privacy set intersection method, device and storage medium based on multi-party secure computing, and relates to the field of privacy computing technology. The method includes: determining an intersection computing party, receiving a mapping parameter group sent by the intersection computing party; using the mapping parameter group and the data sets of the participants to generate a batch mapping table, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants; summing the sub-secret tables of the participants, and sending the summation result to the intersection computing party, so that the intersection computing party obtains a target result according to the summation result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection computing party. The present disclosure improves the efficiency of privacy set intersection.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] Data faces various risks during its use and circulation, which may be related to personal safety, commercial interests and even national security. Data privacy computing can realize the flow and sharing of data value and knowledge while ensuring data privacy security.

[0003] In the related technology, multi-party secure computing solves the problem of collaborative computing between a group of mutually distrusting parties under the premise of protecting privacy information and without a trusted third party. On the one hand, when performing the intersection of privacy sets based on multi-party secure computing, a third party is usually required to participate in the intersection of the privacy sets of each participant; on the other hand, when multiple participants perform the intersection of privacy sets, the data size of each participant is required to be the same, which makes the efficiency of the intersection of privacy sets low.

[0004] Therefore, a new method needs to be provided to ensure that the privacy set intersection of data can be achieved safely and efficiently without the participation of a third party and / or when the data sizes of the participants are different.

[0005] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present invention, and therefore may include information that does not constitute prior art known to ordinary technicians in the field. Summary of the invention

[0006] The purpose of the present invention is to provide a privacy set intersection method based on multi-party secure computing, a privacy set intersection device based on multi-party secure computing, a computer-readable storage medium and an electronic device, so as to ensure that the privacy set intersection of data can be achieved safely and efficiently without the participation of a third party and / or when the data scales of the participants are different.

[0007] According to one aspect of the present disclosure, a privacy set intersection method based on multi-party secure computing is provided, which is applied to any participant and includes:

[0008] Determine the intersection calculation party, and receive a mapping parameter group sent by the intersection calculation party;

[0009] Generate a batch mapping table using the mapping parameter group and the data sets of the participants, generate a sub-secret table based on the batch mapping table, and share the sub-secret table among the multiple participants;

[0010] The sub-secret tables of the participants are summed up, and the summation result is sent to the intersection calculation party, so that the intersection calculation party uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

[0011] In an exemplary embodiment of the present disclosure, a batch mapping table is generated using the mapping parameter group and the data set of the participant, including:

[0012] Generate a first position array using the data set of the participant and the mapping parameter group;

[0013] Generate a random array, and determine the first position of each data in the data set in the random array through the first position array;

[0014] According to the first position, the data at the first position in the random array is replaced with the data in the data set to generate the batch mapping table.

[0015] In an exemplary embodiment of the present disclosure, a batch mapping table is generated using the mapping parameter group and data of the participants, including:

[0016] Generate a second position array using the data set of the participant, the mapping parameter group, and a length parameter in the mapping parameter group;

[0017] Generate a random matrix, and determine the second position of each data in the data set in the random matrix through the second position array;

[0018] According to the second position, the data at the second position in the random matrix is ​​replaced with the data in the data set to obtain the batch mapping table.

[0019] In an exemplary embodiment of the present disclosure, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants includes:

[0020] Determine the number of parties involved;

[0021] Generate a plurality of sub-secret tables of equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as the number of the participants;

[0022] Send a sub-secret table to each participant.

[0023] According to one aspect of the present disclosure, a privacy set intersection method based on multi-party secure computing is provided, which is applied to the intersection computing party and includes:

[0024] Generate a mapping parameter group, and send the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table;

[0025] Receiving the summation results sent by the participants, and obtaining the target result according to the summation results of the participants;

[0026] The batch mapping table of the intersection calculation party is obtained, and the batch mapping table of the intersection calculation party and the target result are compared to obtain the intersection of the data sets of each participant.

[0027] In an exemplary embodiment of the present disclosure, obtaining the batch mapping table of the intersection calculation party, comparing the batch mapping table of the intersection calculation party and the target result, and obtaining the intersection of the data sets of each participant includes:

[0028] Obtaining the number of participants, and obtaining a target mapping table according to the number of participants and the batch mapping table of the intersection calculation party;

[0029] The target result and the target mapping table are compared to obtain identical items, wherein the identical items are intersections of the data sets of the participants.

[0030] According to one aspect of the present disclosure, a privacy set intersection device based on multi-party secure computing is provided, which is applied to any participant, including:

[0031] A mapping parameter group receiving module, used to determine an intersection calculation party and receive a mapping parameter group sent by the intersection calculation party;

[0032] A sub-secret table sharing module, used to generate a batch mapping table using the mapping parameter group and the data sets of the participants, generate a sub-secret table based on the batch mapping table, and share the sub-secret table among the multiple participants;

[0033] A summation result sending module is used to sum the sub-secret tables of the participants and send the summation result to the intersection calculation party so that the intersection calculation party uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

[0034] According to one aspect of the version disclosure, a privacy set intersection device based on multi-party secure computing is provided, which is applied to the intersection computing party, including:

[0035] A parameter group sending module, used for generating a mapping parameter group, and sending the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table;

[0036] A target result generating module, used for receiving the summation results sent by the participants, and obtaining the target result according to the summation results of the participants;

[0037] The intersection calculation module is used to obtain the batch mapping table of the intersection calculation party, compare the batch mapping table of the intersection calculation party and the target result, and obtain the intersection of the data sets of each participant.

[0038] According to one aspect of the present disclosure, a storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the method for intersection of privacy sets based on multi-party secure computing described in any one of the above is implemented.

[0039] According to one aspect of the present disclosure, there is provided an electronic device, including:

[0040] Processor; and

[0041] A memory, configured to store executable instructions of the processor;

[0042] The processor is configured to execute any one of the above-mentioned privacy set intersection methods based on multi-party secure computing by executing the executable instructions.

[0043] The disclosed embodiment provides a privacy set intersection method based on multi-party secure computing, which includes determining an intersection computing party, receiving a mapping parameter group sent by the intersection computing party; generating a batch mapping table using the mapping parameter group and the data sets of the participants, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants; summing the sub-secret tables of the participants, and sending the summation result to the intersection computing party, so that the intersection computing party obtains a target result using the summation result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection computing party; on the one hand, after receiving the mapping parameter group, the participant generates a batch mapping table using the data set and the mapping parameter group, generates a sub-secret table based on the batch mapping table, and Sharing among multiple participants solves the problem in related technologies that privacy set intersection can only be achieved with the participation of a third party, that is, it solves the problem in related technologies that privacy set intersection can only be achieved with the OPPRF protocol, thereby improving the efficiency of privacy set intersection. On the other hand, after each participant obtains the sub-secret table shared by other participants, it sums the sub-secret tables it owns to obtain the sum result, and sends the sum result to the intersection calculation party. The intersection calculation party calculates the sum result to obtain the target result, and obtains the intersection of the data sets owned by multiple participants based on the target result and its own batch mapping table. The scale of the data set of each participant may be different, and the data security of each participant is guaranteed in the process of intersection, thereby further improving the efficiency of privacy set intersection.

[0044] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present invention, and together with the specification are used to explain the principles of the present invention. Obviously, the accompanying drawings described below are only some embodiments of the present invention, and for those of ordinary skill in the art, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0046] Figure 1 A flowchart of a privacy set intersection method based on multi-party secure computing applied to any participant according to an exemplary embodiment of the present disclosure is schematically shown.

[0047] Figure 2 A block diagram of a privacy set intersection system based on multi-party secure computation according to an exemplary embodiment of the present disclosure is schematically shown.

[0048] Figure 3 A flowchart of a method for generating a batch mapping table by using a mapping parameter group and a data set of a participant according to an exemplary embodiment of the present disclosure is schematically shown.

[0049] Figure 4 A flowchart schematically illustrates a method for generating a batch mapping table using a data set of a participant when the data set of the participant is large according to an exemplary embodiment of the present disclosure.

[0050] Figure 5 A flowchart of a method for generating a sub-secret table and sharing the sub-secret table among multiple parties according to an exemplary embodiment of the present disclosure is schematically shown.

[0051] Figure 6 A flowchart of a privacy set intersection method based on multi-party secure computing applied to an intersection computing party according to an exemplary embodiment of the present disclosure is schematically shown.

[0052] Figure 7 A flowchart schematically illustrates a method for obtaining the intersection of data sets of each participant according to a target result by an intersection calculation party according to an exemplary embodiment of the present disclosure.

[0053] Figure 8 A block diagram schematically shows a privacy set intersection device based on multi-party secure computing and applied to any participant according to an exemplary embodiment of the present disclosure.

[0054] Fig. 9 A block diagram schematically shows a privacy set intersection device based on multi-party secure computing and applied to an intersection computing party according to an exemplary embodiment of the present disclosure.

[0055] Fig.10An electronic device for implementing the above-mentioned privacy set intersection method based on secure multi-party computing according to an exemplary embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0056] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as being limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present invention will be more comprehensive and complete, and the concept of the example embodiments will be fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present invention. However, those skilled in the art will appreciate that the technical solutions of the present invention may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present invention.

[0057] In addition, the accompanying drawings are only schematic illustrations of the present invention and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0058] As the demand for privacy protection of user data increases, privacy set intersection based on multi-party secure computing can meet the needs of protecting the privacy of personal information to the greatest extent while satisfying the convenience of sales staff who rely on personal information.

[0059] Secure Multi-Party Computation (SMPC) is used to solve the problem of a group of mutually untrusted participants holding secret data and jointly calculating a given function. While ensuring that the participants obtain the correct calculation results, SMPC cannot obtain any information other than the calculation results. During the entire calculation process, the participants always have absolute control over the data they own. The privacy set intersection based on SMPC has many applications in real-name authentication, joint risk control in the financial industry, and data alignment in the data preprocessing stage of federated learning. However, in the current privacy set intersection based on SMPC, on the one hand, the participation of a third party is required. Multiple participants perform privacy set intersection based on the OPPRF (Oblivious Programmable Pseudo-Random Function) protocol, which is equivalent to a third party; on the other hand, when performing set intersection, the data size of each participant is required to be the same; on the other hand, when performing privacy set intersection through the OPPRF protocol, the OPPRF protocol needs to be constructed first, which makes the efficiency of privacy set intersection low.

[0060] Based on one or more of the above problems, this example implementation first provides a privacy set intersection method based on multi-party secure computing, which can be run on a device terminal, which may include a desktop computer, a portable computer, a smart phone, a tablet computer, etc.; of course, those skilled in the art can also run the method of the present invention on other platforms as needed, and this is not particularly limited in this exemplary embodiment.

[0061] refer to Figure 1 As shown, the privacy set intersection method based on multi-party secure computation can be used by any participant and includes the following steps:

[0062] Step S110. Determine an intersection calculation party, and receive a mapping parameter group sent by the intersection calculation party;

[0063] Step S120. Generate a batch mapping table using the mapping parameter group and the data sets of the participants, generate a sub-secret table based on the batch mapping table, and share the sub-secret table among the multiple participants;

[0064] Step S130. Sum the sub-secret tables of the participants and send the summation result to the intersection calculator so that the intersection calculator uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants based on the target result and the batch mapping table of the intersection calculator.

[0065] The above-mentioned privacy set intersection method based on multi-party secure computation determines an intersection computing party, receives a mapping parameter group sent by the intersection computing party; uses the mapping parameter group and the data sets of the participants to generate a batch mapping table, generates a sub-secret table based on the batch mapping table, and shares the sub-secret table among the multiple participants; sums the sub-secret tables of the participants, and sends the sum result to the intersection computing party, so that the intersection computing party uses the sum result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection computing party; on the one hand, after the participants receive the mapping parameter group, they use the data set and the mapping parameter group to generate a batch mapping table, based on the batch mapping table, The mapping table generates a sub-secret table and shares it among multiple participants, which solves the problem in related technologies that a third party must be involved to achieve the intersection of privacy sets, and improves the efficiency of the intersection of privacy sets. On the other hand, after each participant obtains the sub-secret table shared by other participants, it sums the sub-secret tables it owns to obtain the sum result, and sends the sum result to the intersection calculation party. The intersection calculation party calculates the sum result to obtain the target result, and obtains the intersection of the data sets owned by multiple participants based on the target result and its own batch mapping table. The size of the data set of each participant may be different, and the data security of each participant is guaranteed in the process of intersection, which further improves the efficiency of the intersection of privacy sets.

[0066] In the following, each step involved in the privacy set intersection method based on multi-party secure computing according to an exemplary embodiment of the present disclosure is explained and illustrated in detail.

[0067] First, the application scenarios and invention objectives of the exemplary embodiments of the present disclosure are explained and illustrated.

[0068] Specifically, the exemplary embodiments of the present disclosure may be used to implement the intersection of data sets of each participant, mainly to ensure the security of the data sets of the participants and the efficiency of the intersection of privacy sets.

[0069] The exemplary embodiments of the present disclosure are based on the data sets of each participant. First, an intersection calculation party included in multiple participants is determined. The intersection calculation party generates a mapping parameter group and sends the generated mapping parameter group to each participant. Each participant generates a batch mapping table according to the mapping parameter group and the data set it owns, generates a sub-secret table according to the mapping table, and shares the sub-secret table among multiple participants, so that each participant has N-1 sub-secret tables from other participants, where N is the number of participants. Each participant calculates according to its own sub-secret table and the sub-secret tables shared by other participants to obtain a sum result. Each participant sends its own sum result to the intersection calculation party. The intersection calculation party calculates the sum results sent by each participant again to obtain a target result. The target result and the batch mapping table of the intersection calculation party are compared to obtain the intersection of the data sets of each participant. No third party participation is required, and different data sizes of each participant are allowed to be different during the privacy set intersection process, thereby ensuring the data security of each participant and improving the efficiency of set intersection.

[0070] Secondly, the privacy set intersection system based on multi-party secure computation involved in the exemplary embodiment of the present disclosure is explained and illustrated. Figure 2As shown, the privacy set intersection system based on multi-party secure computing may include: a participant 210 and an intersection calculator 220, wherein the intersection calculator 220 may be any one of the participants 210; in the participant 210, it may include a batch mapping module 211, a secret sharing module 212 and a secret table summation module 213; in the intersection calculator 220, it may include a mapping parameter group generation module 221, a target summation module 222 and an intersection calculation module 223. Specifically, in the participant 210, a mapping parameter group sent by the intersection calculation party 220 is received. After receiving the mapping parameter group, the batch mapping module 211 generates a batch mapping table according to the mapping parameter group and the data set owned by the participant; the secret sharing module 212 is connected to the batch mapping module 211 through a network, and is used to generate multiple sub-secret tables according to the number of participants and the generated batch mapping table, wherein the number of generated sub-secret tables is the same as the number of participants, and the generated sub-secret tables are shared among the participants, and each participant can obtain N-1 sub-secret tables from other N-1 participants, where N is the number of participants; wherein, when generating a sub-secret table, in addition to each participant being able to generate a sub-secret table through the secret sharing module 212 and share the generated sub-secret table among other participants, the intersection calculation party can also generate a sub-secret table according to the secret sharing module 212, and share the generated sub-secret table among all participants; a secret table summation module 213, which is connected to the secret sharing module 212 network, is used to perform calculations based on the sub-secret tables owned by each participant and the sub-secret tables received from other participants, obtain a summation result, and send the obtained summation result to the intersection calculation party 220. In the intersection calculation party 220, the mapping parameter group generation module 221 is used to generate a mapping parameter group, send the generated mapping parameter group to the participant 210, and generate its own batch mapping table according to the mapping parameter group; the target summation module 222 is connected to the secret table summation module 213 of the participant 210 through a network, and is used to receive the summation result sent by the secret table summation module 213, and recalculate the received summation result to obtain the target result; the intersection calculation module 223 is connected to the target summation module 222 and the batch mapping module 221 through a network, and is used to compare the batch mapping table and the target result to obtain the same value, which is the common data among all the participants, that is, the intersection of the data sets of all the participants.

[0071] The following will be combined Figure 2 Steps S110 to S130 are explained and described.

[0072] In step S110, an intersection calculation party is determined, and a mapping parameter group sent by the intersection calculation party is received.

[0073] In this example embodiment, the number of participants is at least 2, and the intersection calculation party is any one of the multiple participants. The intersection calculation party is used to generate a mapping parameter group (k, b, t) and send the generated mapping parameter group (k, b, t) to each participant, wherein k and b in the mapping parameter group are random numbers, which are mainly used to determine the position of each data in the participant's data set in the batch mapping table, and t is a length parameter, which will affect the length of the position array. The length of the position array can determine the degree of data collision. In this example embodiment, in order to avoid data collision when constructing the position array, the value range of the parameter t can be: t≥60.

[0074] In step S120, a batch mapping table is generated using the mapping parameter group and the data sets of the participants, a sub-secret table is generated based on the batch mapping table, and the sub-secret table is shared among the multiple participants.

[0075] After receiving the mapping parameter group sent by the intersection calculation party, each participant can generate a position array according to the mapping parameter group and the data set owned by the participant, and the position array is used to determine the position of the data set owned by the participant mapped to the random array; batch additive secret sharing can be used to generate multiple sub-secret tables according to the batch mapping table, wherein batch additive secret sharing means that the secret sharing has additive properties, and for each participant, the data set it owns is X=[x 1 ,x 2 ,…,x n ], when sharing secrets based on a data set owned by it, multiple random number arrays of equal length can be generated based on the data set X, and the sum of the multiple random number arrays of equal length is X.

[0076] In this example embodiment, reference Figure 3 As shown, using the mapping parameter group and the data set of the participant to generate a batch mapping table may include steps S310 to S330:

[0077] Step S310. Generate a first position array using the data set of the participant and the mapping parameter group;

[0078] Step S320. Generate a random array, and determine the first position of each data in the data set in the random array through the first position array;

[0079] Step S330. According to the first position, replace the data at the first position in the random array with the data in the data set to generate the batch mapping table.

[0080] In the following, steps S310 to S330 will be further explained and illustrated. Specifically, first, after each participant receives the mapping parameter group sent by the intersection calculation party, each participant constructs a first position array using the mapping parameter group and the data set it owns; for any participant, the value of the position array corresponding to the i-th data in the data set owned by the participant is: T i =(x i *k+b)%(nt), where k and b are two random numbers in the mapping parameter group, t is the length parameter in the mapping parameter group, and n is the amount of data included in the data set of the participant; the first position array is used to determine the position of each data in the data set of the participant in the generated random array, that is, the value of the position array corresponding to the i-th data in the data set of the participant is the position of the i-th data in the data set mapped in the random array, where the position of the value of the position array corresponding to the i-th data in the data set of the participant in the position array is the same as the position of the i-th data in the data set; after obtaining the first position array, a random array is generated, where the length of the random array is nt, that is, the length of the random array is determined by the amount of data in the data set owned by the participant and the length parameter in the mapping parameter group; finally, according to the value of each data in the data set in the first position array, each data in the data set is placed in the position corresponding to the random array to obtain a batch mapping table, then the value of each position in the batch mapping table is: W i [T i (x j )]=x j .

[0081] Furthermore, when the dataset is large and it is not possible to process a large amount of data at once due to memory limitations, refer to Figure 4 As shown, in this exemplary embodiment, the batch mapping table is generated by using the mapping parameter group and the data of the participants, which may include steps S410 to S430:

[0082] Step S410. Generate a second position array using the data set of the participant, the mapping parameter group and the length parameter in the mapping parameter group;

[0083] Step S420. Generate a random matrix, and determine the second position of each data in the data set in the random matrix through the second position array;

[0084] Step S430: According to the second position, replace the data at the second position in the random matrix with the data in the data set to obtain the batch mapping table.

[0085] In the following, steps S410 to S430 will be further explained and illustrated. Specifically, first, after each participant receives the mapping parameter group sent by the intersection calculation party, each participant constructs a second position array using the mapping parameter group and the data set it owns. For any participant, the value of the position array corresponding to the i-th data in the data set owned by the participant is: T i =(x i *k+b)%n, where k and b are two random numbers in the mapping parameter group, and n is the amount of data included in the data set of the participant; the value in the second position array is used to determine the position of the data in the data set corresponding to the value in the random matrix, that is, according to the value of the position array corresponding to the i-th data in the data set of the participant, the position of the i-th data in the data set mapped in the random matrix can be determined; where the position of the value of the position array corresponding to the i-th data in the data set in the position array is the same as the position of the i-th data in the data set; then, a random matrix is ​​generated, which is an m*d matrix, where m is the length parameter in the mapping parameter group, After the random matrix and the second position array are generated, the position of each data in the data set mapped in the random matrix can be determined according to the value of each data in the data set in the second position array. Specifically, the row number of each data in the data set in the random matrix is ​​determined by The column number of each data in the random matrix is ​​obtained by T i %m, after obtaining the row number and column number of each data in the data set in the random matrix, each data in the data set is filled in the corresponding position of the random matrix to obtain a batch mapping table.

[0086] In this example embodiment, after the batch mapping table is generated, secret sharing can be performed according to the batch mapping table. Figure 5 As shown, generating a sub-secret table based on the batch mapping table and sharing the sub-secret table among the multiple participants may include steps S510 to S530:

[0087] Step S510. Determine the number of participants;

[0088] Step S520. Generate a plurality of sub-secret tables of equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as the number of the participants;

[0089] Step S530: Send a sub-secret table to each participant.

[0090] In the following, step S510 to step S530 will be further explained and illustrated. Specifically, first, the number of participants is determined. After the number of participants is determined, multiple equal-length sub-secret tables are generated according to the batch mapping table generated by each participant, wherein the sub-secret table is a random number array, the number of generated sub-secret tables is equal to the number of participants, and the number of data included in the random number array is equal to the number of participants; after multiple sub-secret tables are generated, one sub-secret table is sent to each of the multiple participants.

[0091] For example, when the number of participants is S, S random number arrays of equal length can be generated according to the batch mapping table generated by each participant [R i1 ,R i2 ,…,R iS ], the amount of data included in each random number array is S. After each participant generates S sub-secret tables, it randomly shares S-1 of them with S-1 participants other than itself. Specifically, when participant P i Send the generated j-th sub-secret table to the P-th j When there are multiple participants, it can be represented by R_ij.

[0092] In this exemplary embodiment, by generating a batch mapping table and batch addition secret sharing, the processing efficiency of the user data set and the efficiency of secret sharing are improved, and the security of the user data set is guaranteed.

[0093] In step S130, the sub-secret tables of the participants are summed and the summed result is sent to the intersection calculator so that the intersection calculator uses the summed result to obtain the target result, and obtains the intersection of the data sets of the multiple participants based on the target result and the batch mapping table of the intersection calculator.

[0094] In this example embodiment, after secret sharing, each participant can obtain s-1 sub-secret tables from S-1 participants. After obtaining S-1 sub-secret tables, a sub-secret table owned by the participant and the sub-secret tables received from other participants can be secret added to obtain a sum result R i , and the summation result R i It is sent to the intersection calculation party, which calculates the target result based on the summation results sent by each participant, and obtains the intersection of the data sets of each participant based on the target result and the batch mapping table of the intersection calculation party.

[0095] The present disclosure also provides a privacy set intersection method based on multi-party secure computing, which can be applied to the intersection calculation method. Figure 6As shown, the privacy set intersection method based on multi-party secure computing may include steps S610 to S630:

[0096] Step S610: Generate a mapping parameter group, and send the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table;

[0097] Step S620. Receive the summation results sent by each participant, and obtain the target result according to the summation results of each participant;

[0098] Step S630: Obtain the batch mapping table of the intersection calculation party, compare the batch mapping table of the intersection calculation party and the target result, and obtain the intersection of the data sets of each participant.

[0099] The following will further explain and illustrate steps S610 to S630. Specifically, first, the intersection square P is set. m Generate a mapping parameter group (k, b, t), where k and b in the mapping parameter group are random numbers, which are mainly used to determine the position of each data in the data set of the participant in the batch mapping table, and t is a length parameter, which will affect the length of the position array, and the length of the position array can determine the degree of data collision; after the mapping parameter group is generated, send the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, generates multiple sub-secret tables through the batch mapping table, and shares the sub-secret tables among multiple participants; after the participant receives the sub-secret tables sent by different participants, each participant sums the sub-secret tables to obtain the sum result R i , and the summation result R i Sent to the intersection calculation party. When the intersection calculation party receives the summation results sent by each participant, it adds all the summation results to obtain the target result R = R 1 +R 2 +…+R S ; Finally, the intersection of the data sets of the participants is obtained according to the batch mapping table of the intersection calculator and the target result.

[0100] For further reference, Figure 7 As shown, obtaining the batch mapping table of the intersection calculation party, comparing the batch mapping table of the intersection calculation party and the target result, and obtaining the intersection of the data sets of each participant may include step S710 and step S720:

[0101] Step S710. Obtain the number of participants, and obtain a target mapping table according to the number of participants and the batch mapping table of the intersection calculation party;

[0102] Step S720: Compare the target result and the target mapping table to obtain the same items, wherein the same items are the intersection of the data sets of the participants.

[0103] In the following, step S710 and step S720 are further explained and illustrated. Specifically, first, the number of participants S is obtained, and the number of participants S and the batch mapping table W of the intersection calculation party are compared. m Multiply and get the target mapping table S*W m Then, the intersection calculation party compares the target mapping table and the target result. When the data in the same position of the target mapping table and the target result are the same, the data is shared by the participants. By comparing, the intersection of the data sets of each participant is obtained.

[0104] The privacy set intersection method based on multi-party secure computing and the privacy set intersection system based on multi-party secure computing provided by the exemplary embodiments of the present disclosure have at least the following advantages: on the one hand, multi-party privacy set intersection can be realized without the participation of a third party, that is, there is no need to construct an OPPRF protocol, thereby improving the efficiency of privacy set intersection; on the other hand, after each participant obtains the sub-secret table shared by other participants, the sub-secret table owned is summed up to obtain the sum result, and the sum result is sent to the intersection calculation party, and the intersection calculation party obtains the intersection of the data sets owned by multiple participants based on the sum result and the batch mapping table owned by itself, wherein the size of the data set of each participant may be different, and the data security of each participant is guaranteed in the process of intersection, further improving the efficiency of privacy set intersection.

[0105] The exemplary embodiment of the present disclosure provides a privacy set intersection device based on multi-party secure computing and applied to any participant, referring to Figure 8 As shown, the privacy set intersection device based on multi-party secure computation may include: a mapping parameter group receiving module 810, a sub-secret table sharing module 820 and a summation result sending module 830. Among them:

[0106] A mapping parameter group receiving module 810 is used to determine an intersection calculation party and receive a mapping parameter group sent by the intersection calculation party;

[0107] A sub-secret table sharing module 820, for generating a batch mapping table using the mapping parameter group and the data sets of the participants, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants;

[0108] The summation result sending module 830 is used to sum the sub-secret tables of the participants and send the summation result to the intersection calculation party so that the intersection calculation party uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

[0109] The exemplary embodiment of the present disclosure also provides a privacy set intersection device based on multi-party secure computing and applied to an intersection computing party, referring to Fig. 9 As shown, the privacy set intersection device based on multi-party secure computing may include: a parameter group sending module 910, a target result generating module 920 and an intersection calculation module 930. Among them,

[0110] A parameter group sending module 910, configured to generate a mapping parameter group, and send the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table;

[0111] The target result generating module 920 is used to receive the summation results sent by the participants and obtain the target result according to the summation results of the participants;

[0112] The intersection calculation module 930 is used to obtain the batch mapping table of the intersection calculation party, compare the batch mapping table of the intersection calculation party and the target result, and obtain the intersection of the data sets of each participant.

[0113] In an exemplary embodiment of the present disclosure, a batch mapping table is generated using the mapping parameter group and the data set of the participant, including:

[0114] Generate a first position array using the data set of the participant and the mapping parameter group;

[0115] Generate a random array, and determine the first position of each data in the data set in the random array through the first position array;

[0116] According to the first position, the data at the first position in the random array is replaced with the data in the data set to generate the batch mapping table.

[0117] In an exemplary embodiment of the present disclosure, a batch mapping table is generated using the mapping parameter group and data of the participants, including:

[0118] Generate a second position array using the data set of the participant, the mapping parameter group, and a length parameter in the mapping parameter group;

[0119] Generate a random matrix, and determine the second position of each data in the data set in the random matrix through the second position array;

[0120] According to the second position, the data at the second position in the random matrix is ​​replaced with the data in the data set to obtain the batch mapping table.

[0121] In an exemplary embodiment of the present disclosure, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple parties includes:

[0122] Determine the number of parties involved;

[0123] Generate a plurality of sub-secret tables of equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as the number of the participants;

[0124] Send a sub-secret table to each participant.

[0125] In an exemplary embodiment of the present disclosure, obtaining the batch mapping table of the intersection calculation party, comparing the batch mapping table of the intersection calculation party and the target result, and obtaining the intersection of the data sets of each participant includes:

[0126] Obtaining the number of participants, and obtaining a target mapping table according to the number of participants and the batch mapping table of the intersection calculation party;

[0127] The target result and the target mapping table are compared to obtain identical items, wherein the identical items are intersections of the data sets of the participants.

[0128] The specific details of each module in the above-mentioned privacy set intersection device based on multi-party secure computing have been described in detail in the corresponding privacy set intersection method based on multi-party secure computing, so they will not be repeated here.

[0129] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to an embodiment of the present invention, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0130] In addition, although the steps of the method of the present invention are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0131] In an exemplary embodiment of the present invention, an electronic device capable of implementing the above data conversion method is also provided.

[0132] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0133] Reference below Fig.10 The electronic device 1000 according to this embodiment of the present invention will be described. Fig.10 The electronic device 1000 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0134] like Fig.10 As shown, the electronic device is in the form of a general computing device. The components of the electronic device may include, but are not limited to: the at least one processing unit 1010, the at least one storage unit 1020, a bus 1030 connecting different system components (including the storage unit 1020 and the processing unit 1010), and a display unit 1040.

[0135] The storage unit stores program codes, which can be executed by the processing unit 1010, so that the processing unit 1010 performs the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification. For example, the processing unit 1010 can perform the following steps: Figure 1 Step S110 shown in: determining an intersection calculation party, receiving a mapping parameter group sent by the intersection calculation party; step S120: generating a batch mapping table using the mapping parameter group and the data sets of the participants, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants; step S130: summing the sub-secret tables of the participants, and sending the summation result to the intersection calculation party, so that the intersection calculation party obtains the target result using the summation result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

[0136] The storage unit 1020 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 10201 and / or a cache storage unit 10202 , and may further include a read-only storage unit (ROM) 10203 .

[0137] The storage unit 1020 may also include a program / utility 10204 having a set (at least one) of program modules 10205, such program modules 1005 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0138] Bus 1030 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0139] The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 1000, and / or may communicate with any device that enables the electronic device 1000 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 1050. Furthermore, the electronic device 1000 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 1060. As shown, the network adapter 1060 communicates with other modules of the electronic device 1000 via a bus 1030. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0140] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present invention can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present invention.

[0141] In an exemplary embodiment of the present invention, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of this specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to perform the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of this specification.

[0142] The program product for implementing the above method according to an embodiment of the present invention may adopt a portable compact disk read-only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, apparatus, or device.

[0143] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The 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 (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable 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.

[0144] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a 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.

[0145] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

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

[0147] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0148] Other embodiments of the invention will readily occur to those skilled in the art after considering the specification and practicing the invention invented herein. This application is intended to cover any variations, uses or adaptations of the invention that follow the general principles of the invention and include common knowledge or customary techniques in the art that are not invented by the present invention. The specification and examples are to be considered exemplary only, and the true scope and spirit of the invention are indicated by the claims.

Claims

1. A privacy set intersection method based on multi-party secure computing, characterized in that: Applied to any participant, the method comprises: Determine an intersection calculation party, and receive a mapping parameter group sent by the intersection calculation party; Generate a batch mapping table using the mapping parameter group and the data sets of the participants, generate a sub-secret table based on the batch mapping table, and share the sub-secret table among the multiple participants; The sub-secret tables of the participants are summed up, and the summation result is sent to the intersection calculation party, so that the intersection calculation party uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

2. The method for finding intersection of private sets according to claim 1, characterized in that: Using the mapping parameter group and the data sets of the participants, a batch mapping table is generated, including: Generate a first position array using the data set of the participant and the mapping parameter group; Generate a random array, and determine the first position of each data in the data set in the random array through the first position array; According to the first position, the data at the first position in the random array is replaced with the data in the data set to generate the batch mapping table.

3. The privacy set intersection method according to claim 1, characterized in that: Using the mapping parameter group and the data of the participants, a batch mapping table is generated, including: Generate a second position array using the data set of the participant, the mapping parameter group, and a length parameter in the mapping parameter group; Generate a random matrix, and determine the second position of each data in the data set in the random matrix through the second position array; According to the second position, the data at the second position in the random matrix is ​​replaced with the data in the data set to obtain the batch mapping table.

4. The method for finding intersection of private sets according to claim 1, characterized in that: Generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants, including: Determine the number of parties involved; Generate a plurality of sub-secret tables of equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as the number of the participants; Send a sub-secret table to each participant.

5. A privacy set intersection method based on multi-party secure computing, characterized in that: Applied to the intersection calculation method, the method includes: Generate a mapping parameter group, and send the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table; Receiving the summation results sent by the participants, and obtaining the target result according to the summation results of the participants; The batch mapping table of the intersection calculation party is obtained, and the batch mapping table of the intersection calculation party and the target result are compared to obtain the intersection of the data sets of each participant.

6. The method for finding intersection of private sets according to claim 5, characterized in that: Acquiring the batch mapping table of the intersection calculation party, comparing the batch mapping table of the intersection calculation party and the target result, and obtaining the intersection of the data sets of each participant, including: Obtaining the number of participants, and obtaining a target mapping table according to the number of participants and the batch mapping table of the intersection calculation party; The target result and the target mapping table are compared to obtain identical items, wherein the identical items are intersections of the data sets of the participants.

7. A privacy set intersection device based on multi-party secure computing, characterized in that: Applied to any participant, the device comprises: A mapping parameter group receiving module, used to determine an intersection calculation party and receive a mapping parameter group sent by the intersection calculation party; A sub-secret table sharing module, used to generate a batch mapping table using the mapping parameter group and the data sets of the participants, generate a sub-secret table based on the batch mapping table, and share the sub-secret table among the multiple participants; A summation result sending module is used to sum the sub-secret tables of the participants and send the summation result to the intersection calculation party so that the intersection calculation party uses the summation result to obtain the target result, and obtains the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculation party.

8. A privacy set intersection device based on multi-party secure computing, characterized in that: Applied to intersection calculation, the device comprises: A parameter group sending module, used for generating a mapping parameter group, and sending the mapping parameter group to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, and performs secret sharing according to the batch mapping table; A target result generating module, used for receiving the summation results sent by the participants, and obtaining the target result according to the summation results of the participants; The intersection calculation module is used to obtain the batch mapping table of the intersection calculation party, compare the batch mapping table of the intersection calculation party and the target result, and obtain the intersection of the data sets of each participant.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the privacy set intersection method based on multi-party secure computing described in any one of claims 1 to 6 is implemented.

10. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; Wherein, the processor is configured to execute the privacy set intersection method based on multi-party secure computing as described in any one of claims 1-6 by executing the executable instructions.