CN114826580A - Privacy set intersection method, device and storage medium based on multi-party security calculation - Google Patents
Privacy set intersection method, device and storage medium based on multi-party security calculation Download PDFInfo
- Publication number
- CN114826580A CN114826580A CN202210456602.2A CN202210456602A CN114826580A CN 114826580 A CN114826580 A CN 114826580A CN 202210456602 A CN202210456602 A CN 202210456602A CN 114826580 A CN114826580 A CN 114826580A
- Authority
- CN
- China
- Prior art keywords
- intersection
- participants
- mapping table
- data
- batch
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000004364 calculation method Methods 0.000 title claims abstract description 43
- 238000013507 mapping Methods 0.000 claims abstract description 240
- 239000011159 matrix material Substances 0.000 claims description 23
- 230000002776 aggregation Effects 0.000 claims description 4
- 238000004220 aggregation Methods 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 2
- 230000008569 process Effects 0.000 description 9
- 238000003491 array Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- MZWGYEJOZNRLQE-KXQOOQHDSA-N 1-stearoyl-2-myristoyl-sn-glycero-3-phosphocholine Chemical compound CCCCCCCCCCCCCCCCCC(=O)OC[C@H](COP([O-])(=O)OCC[N+](C)(C)C)OC(=O)CCCCCCCCCCCCC MZWGYEJOZNRLQE-KXQOOQHDSA-N 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
Abstract
The disclosure relates to a privacy set intersection method, a privacy set intersection device and a storage medium based on multi-party security calculation, and relates to the technical field of privacy calculation. The method comprises the following steps: determining an intersection calculator, and receiving the mapping parameter set sent by the intersection calculator; generating a batch mapping table by using the mapping parameter group and a data set of the participants, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants; and summing the sub secret tables of the participants, and sending a summation result to the intersection calculator so that the intersection calculator 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 calculator. The present disclosure improves the efficiency of privacy set intersection.
Description
Technical Field
The embodiment of the disclosure relates to the technical field of privacy computation, in particular to a privacy set intersection method, device, medium and equipment based on multi-party security computation.
Background
The data faces various risks in the using and circulating links, the risks may relate to personal safety, business benefits and even national safety, and the flowing and sharing of data values and knowledge can be realized on the basis of ensuring the privacy and safety of the data through the privacy calculation of the data.
In the related art, the multi-party secure computing solves the problem of cooperative computing among a group of mutually untrusted parties under the premise of protecting private information and having no trusted third party. On one hand, when the privacy set intersection is carried out on the premise of multi-party safety calculation, a third party is usually required to participate, and the privacy set intersection of each participant is realized by the third party; on the other hand, when a plurality of participants perform privacy set deal, the data scale of each participant is required to be the same, so that the privacy set deal efficiency is low.
Therefore, it is necessary to provide a new method to ensure that the privacy set exchange of data can be safely and efficiently realized even when no third party participates and/or the data sizes of the parties are different.
It is to be noted that the information invented in the above background section is only for enhancing the understanding of the background of the present invention, and therefore, may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The invention aims to provide a privacy set intersection method based on multi-party safe calculation, a privacy set intersection device based on multi-party safe calculation, a computer readable storage medium and electronic equipment, so that the privacy set intersection of data can be safely and efficiently realized even if no third party participates and/or the data scale of each participant is different.
According to one aspect of the present disclosure, a privacy set intersection method based on multi-party secure computation is provided, which is applied to any party, and includes:
determining the intersection set calculator, and receiving the mapping parameter set sent by the intersection set calculator;
generating a batch mapping table by using the mapping parameter group and a data set of the participants, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple participants;
and summing the sub secret tables of the participants, and sending a summation result to the intersection calculator so that the intersection calculator obtains a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
In an exemplary embodiment of the present disclosure, generating a batch mapping table using the set of mapping parameters and a data set of a participant includes:
generating a first location array using the data set of the participant and the set of mapping parameters;
generating a random array, and determining a first position of each data in the data set in the random array through the first position array;
and replacing the data at the first position in the random array with the data in the data set according to the first position to generate the batch mapping table.
In an exemplary embodiment of the present disclosure, generating a batch mapping table using the set of mapping parameters and data of the participants includes:
generating a second position array by using the data set of the participant, the mapping parameter group and the length parameter in the mapping parameter group;
generating a random matrix, and determining a second position of each data in the data set in the random matrix through the second position number group;
and replacing the data at the second position in the random matrix with the data in the data set according to the second position to obtain the batch mapping table.
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 plurality of participants includes:
determining a number of participants;
generating a plurality of sub-secret tables with equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as that of the participants;
a child secret table is sent to each participant.
According to one aspect of the present disclosure, a privacy set intersection method based on multi-party secure computation is provided, which is applied to an intersection set calculator, and includes:
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;
receiving the summation result sent by each participant, and obtaining a target result according to the summation result of each participant;
and acquiring a batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of all the participants.
In an exemplary embodiment of the present disclosure, obtaining a batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain an intersection of the data sets of the participants includes:
acquiring the number of participants, and acquiring a target mapping table according to the number of the participants and the batch mapping table of the intersection calculation party;
and comparing the target result with the target mapping table to obtain the same item, wherein the same item is the intersection of the data sets of all the participants.
According to one aspect of the present disclosure, there is provided a privacy set intersection device based on multi-party secure computation, applied to any one party, including:
the mapping parameter group receiving module is used for determining an intersection calculator and receiving the mapping parameter group sent by the intersection calculator;
the sub-secret table sharing module is used for generating a batch mapping table by 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 participants;
and the summation result sending module is used for summing the sub-secret tables of the participants and sending the summation result to the intersection calculator so that the intersection calculator can obtain a target result by using the summation result and obtain the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
According to one aspect of the version disclosure, a privacy set intersection device based on multi-party secure computation is provided, which is applied to an intersection computing party, and includes:
the parameter group sending module is used for generating a mapping parameter group, sending the mapping parameter group to each participant so that each participant generates a batch mapping table according to the mapping parameter group and carries out secret sharing according to the batch mapping table;
the target result generation module is used for receiving the summation result sent by each participant and obtaining a target result according to the summation result of each participant;
and the intersection calculation module is used for acquiring the batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of all the participants.
According to an aspect of the present disclosure, there is provided a storage medium having stored thereon a computer program, which when executed by a processor, implements the privacy set intersection method based on multi-party security computing according to any one of the above.
According to an aspect of the present disclosure, there is provided an electronic device including:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to execute any one of the above privacy set intersection methods based on multi-party security computing via execution of the executable instructions.
The privacy set intersection method based on multi-party security calculation provided by the embodiment of the disclosure determines an intersection calculator, and receives a mapping parameter set sent by the intersection calculator; generating a batch mapping table by using the mapping parameter group and a data set 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 a summation result to the intersection calculator so that the intersection calculator obtains a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and a batch mapping table of the intersection calculator; on one hand, after the participants receive the mapping parameter group, the batch mapping table is generated by utilizing the data set and the mapping parameter group, the sub-secret table is generated based on the batch mapping table and is shared among a plurality of participants, so that the problem that the privacy set intersection can be realized only by the participation of a third party in the related technology is solved, namely, the problem that the privacy set intersection can be realized only by the need of an OPPRF protocol in the related technology is solved, and the efficiency of the privacy set intersection is improved; on the other hand, after each participant acquires the sub-secret tables shared by other participants, the owned sub-secret tables are summed to obtain a summation result, the summation result is sent to the intersection calculation party, the intersection calculation party calculates the summation result to obtain a target result, and the intersection of the data sets owned by the multiple participants is obtained according to the target result and the own batch mapping table, wherein the data sets of the participants can be different in scale, the data safety of the participants is ensured in the intersection calculation process, and the privacy set intersection calculation efficiency is further improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
Fig. 1 schematically shows a flow chart of a privacy set intersection method based on multi-party security computation applied to any one participant according to an example embodiment of the present disclosure.
FIG. 2 schematically illustrates a block diagram of a privacy aggregation intersection system based on multi-party security computation according to an example embodiment of the present disclosure.
FIG. 3 schematically illustrates a flowchart of a method for generating a batch mapping table using a set of mapping parameters and a data set of a participant according to an example embodiment of the present disclosure.
FIG. 4 schematically illustrates a flowchart of a method for generating a batch mapping table using a data set of a participant when the data set of the participant is large in size, according to an example embodiment of the present disclosure.
Fig. 5 schematically illustrates a flow diagram of a method of generating a sub-secret table and sharing the sub-secret table among multiple parties, according to an example embodiment of the present disclosure.
FIG. 6 schematically shows a flow chart of a privacy set intersection method based on multi-party security computation applied to intersection computing parties, according to an example embodiment of the present disclosure.
Fig. 7 schematically illustrates a flowchart of a method for an intersection calculator to obtain an intersection of data sets of participants according to a target result, according to an example embodiment of the present disclosure.
Fig. 8 schematically illustrates a block diagram of a privacy set intersection apparatus based on multi-party security computation applied to any one participant according to an example embodiment of the present disclosure.
Fig. 9 schematically illustrates a block diagram of a privacy set intersection apparatus based on multi-party security computation applied to an intersection computing party according to an example embodiment of the present disclosure.
Fig. 10 schematically illustrates an electronic device for implementing the above-described secure multiparty computation-based privacy set rendezvous method according to an example embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the invention.
Furthermore, the drawings are merely schematic illustrations of the invention and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
With the increasing demand of privacy protection of user data, privacy set intersection based on multi-party security calculation can meet the demand of protecting privacy of personal information to the maximum extent while meeting the convenience of business personnel relying on the personal information.
Multi-Party Secure computing (SMPC) is used to solve the problem that a group of untrusted parties each hold secret data and cooperatively compute a given function. The multi-party safe calculation can not obtain any information except the calculation result while ensuring that the participants obtain the correct calculation result. The participants always have absolute control over the data they own throughout the calculation process. Privacy set intersection based on multi-party security computation has a lot of applications in real-name authentication, joint wind control of the financial industry and data alignment in the preprocessing stage of federal learning data. However, in the privacy aggregation negotiation based on the multi-party secure computation, on one hand, a third party needs to participate, and a plurality of participants perform the privacy aggregation negotiation based on an OPPRF (Programmable Oblivious Pseudo-Random Function) protocol, which is equivalent to the third party; on the other hand, when carrying out set intersection, the data scale of each participant is required to be the same; on the other hand, when the privacy set intersection is performed through the OPPRF protocol, the OPPRF protocol needs to be constructed first, so that the privacy set intersection efficiency is low.
Based on one or more of the above problems, the present example embodiment first provides a privacy set intersection method based on multi-party security computation, which may be run on a device terminal, where the device terminal may include a desktop computer, a portable computer, a smart phone, a tablet computer, and so on; of course, those skilled in the art may also operate the method of the present invention on other platforms as needed, and this is not particularly limited in this exemplary embodiment.
Referring to fig. 1, the privacy set intersection method based on multi-party secure computation may be applied to any party, and includes the following steps:
s110, determining an intersection set calculator, and receiving a mapping parameter set sent by the intersection set calculator;
s120, generating a batch mapping table by using the mapping parameter group and a data set of a participant, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the participants;
and S130, summing the sub-secret tables of the participants, and sending a summation result to the intersection calculator so that the intersection calculator can obtain a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
The privacy set intersection method based on the multi-party security calculation determines an intersection calculator and receives the mapping parameter set sent by the intersection calculator; generating a batch mapping table by using the mapping parameter group and a data set 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 a summation result to the intersection calculator so that the intersection calculator obtains a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and a batch mapping table of the intersection calculator; on one hand, after the participants receive the mapping parameter group, the batch mapping table is generated by utilizing the data set and the mapping parameter group, the sub-secret table is generated based on the batch mapping table, and the sub-secret table is shared among a plurality of participants, so that the problem that the privacy set intersection can be realized only by the participation of a third party in the related technology is solved, and the efficiency of the privacy set intersection is improved; on the other hand, after each participant acquires the sub-secret tables shared by other participants, the owned sub-secret tables are summed to obtain a summation result, the summation result is sent to the intersection calculation party, the intersection calculation party calculates the summation result to obtain a target result, and the intersection of the data sets owned by the multiple participants is obtained according to the target result and the own batch mapping table, wherein the data sets of the participants can be different in scale, the data safety of the participants is ensured in the intersection calculation process, and the privacy set intersection calculation efficiency is further improved.
Hereinafter, the steps involved in the privacy set intersection method based on multi-party secure computation according to the exemplary embodiment of the present disclosure will be explained and explained in detail.
First, an application scenario and an object of the exemplary embodiment of the present disclosure are explained and explained.
Specifically, the embodiment of the present disclosure may be used to implement data set intersection of each participant, and is mainly used to ensure security of a data set of the participant and efficiency of privacy set intersection.
The disclosed exemplary embodiment is based on the data set of each participant, first, determining an intersection calculator included in a plurality of participants, generating a mapping parameter group by the intersection calculator, and sending the generated mapping parameter group to each participant, each participant generating a batch mapping table according to the mapping parameter group and the owned data set, generating a sub-secret table according to the batch mapping table, and sharing the sub-secret table among the plurality of 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 one of its sub-secret tables and the sub-secret tables shared by other participants to obtain a summation result, each participant sends its summation result to the intersection calculator, and the intersection calculator calculates the summation result sent by each participant again, and obtaining a target result, comparing the target result with the batch mapping table of the intersection calculation party to obtain the intersection of the data sets of all the participants, without the participation of a third party, and allowing the data scales of all the participants to be different in the privacy set intersection process, thereby ensuring the data safety of all the participants and simultaneously improving the efficiency of set intersection.
Next, a privacy set intersection system based on multi-party secure computation, which is referred to in the exemplary embodiments of the present disclosure, is explained and explained. Referring to fig. 2, the privacy set intersection system based on multi-party security computation may include: a participant 210 and an intersection calculator 220, wherein the intersection calculator 220 may be any one of the participants 210; in party 210, a batch mapping module 211, a secret sharing module 212, and a secret table summing module 213 may be included; in intersection calculator 220, a mapping parameter set generation module 221, a target summation module 222, and an intersection calculation module 223 may be included. Specifically, in the participant 210, the mapping parameter group sent by the intersection calculator 220 is received, and 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 configured to generate a plurality of sub-secret tables according to the number of participants and the generated batch mapping table, where the number of the generated sub-secret tables is the same as the number of the participants, and share the generated sub-secret tables among the participants, and each participant can obtain N-1 sub-secret tables from other N-1 participants, where N is the number of the participants; when generating the sub-secret table, except that each participant can generate the sub-secret table through the secret sharing module 212, and share the generated sub-secret table among other participants, the intersection calculator can also generate the sub-secret table according to the secret sharing module 212, and share the generated sub-secret table among the participants; and the secret table summing module 213 is connected to the secret sharing module 212 through a network, and is configured to perform calculation according to the sub-secret tables owned by each participant and the received sub-secret tables sent by other participants to obtain a summing result, and send the summing result to the intersection calculating party 220. In the intersection calculator 220, a mapping parameter group generating module 221, configured to generate a mapping parameter group, send the generated mapping parameter group to the participants 210, and generate their own batch mapping tables according to the mapping parameter group; the target summing module 222 is connected to the secret table summing module 213 of the participant 210 through a network, and is configured to receive the summing result sent by the secret table summing module 213, and perform calculation again on the received summing result to obtain a target result; and an intersection calculation module 223, which is connected to the target summation module 222 and the batch mapping module 221 through a network, and configured to compare the batch mapping table with the target result to obtain the same value, where the same value is data that is common to all the participants, that is, an intersection of the data sets of all the participants.
Hereinafter, steps S110 to S130 will be explained and explained with reference to fig. 2.
In step S110, an intersection calculator is determined, and the mapping parameter set sent by the intersection calculator is received.
In this example embodiment, the number of the participants is at least 2, the intersection calculator is any one of the multiple participants, the intersection calculator is configured to generate a mapping parameter set (k, b, t), and send the generated mapping parameter set (k, b, t) to each participant, where k and b in the mapping parameter set are random numbers and are mainly used to determine a position of each data in a data set of the participants in a batch mapping table, t is a length parameter and affects a length of a position array, and the length of the position array may determine a collision degree of the data, and in this example embodiment, in order to avoid data collision when constructing the position array, a value range of the parameter t may be: t is more than or equal to 60.
In step S120, a batch mapping table is generated using the mapping parameter set 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.
After the participants receive the mapping parameter group sent by the intersection calculator, each participant can generate a position array according to the mapping parameter group and the owned data set, and the position array is used for determining the position of the data set owned by the participant mapped to the random array; multiple child secret tables may be generated from a batch mapping table by batch additive secret sharing, where batch additive secret sharing refers to the additivity of secret sharing, and for each participant, the dataset that it owns is X ═ X 1 ,x 2 ,…,x n ]When secret sharing is performed based on a data set owned by the user, a plurality of random number arrays of equal length may be generated from the data set X, and the sum of the plurality of random number arrays of equal length is X.
In this exemplary embodiment, referring to fig. 3, generating a batch mapping table by using the mapping parameter group and the data set of the participant may include steps S310 to S330:
s310, generating a first position array by using the data set of the participant and the mapping parameter group;
s320, generating a random array, and determining a first position of each data in the data set in the random array through the first position array;
and S330, replacing the data at the first position in the random array with the data in the data set according to the first position to generate the batch mapping table.
Hereinafter, steps S310 to S330 will be further explained and explained. Specifically, first, after each participant receives the mapping parameter set sent by the intersection calculator, each participant receives the mapping parameter set sent by the intersection calculatorThe participant utilizes the mapping parameter group and the owned data set to construct a first position array; for any participant, the value of the position array corresponding to the ith data in the dataset owned by that participant is: t is i ＝(x i K + b)% (nt), wherein k and b are two random numbers in the mapping parameter group, t is a length parameter in the mapping parameter group, and n is the data volume included in the data set of the participant; the first position array is used for determining the position of each data in the data set of the participant in the generated random array, namely, the value of the position array corresponding to the ith data in the data set of the participant is the position of the data set in which the ith data is mapped, wherein the position of the value of the position array corresponding to the ith data in the data set of the participant in the position array is the same as the position of the ith data in the data set; after the first position array is obtained, generating a random array, wherein the length of the random array is nt, that is, the length of the random array is determined by the data amount 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, and then the value of each position in the batch mapping table is: w i [T i (x j )]＝x j 。
Further, when the data set is large in size and a large amount of data cannot be processed at one time due to memory limitation, referring to fig. 4, in this exemplary embodiment, generating a batch mapping table by using the mapping parameter group and the data of the participants may include steps S410 to S430:
step S410, generating a second position array by using the data set of the participant, the mapping parameter group and the length parameter in the mapping parameter group;
step S420, generating a random matrix, and determining a second position of each data in the data set in the random matrix through the second position number group;
and S430, replacing the data at the second position in the random matrix with the data in the data set according to the second position to obtain the batch mapping table.
Hereinafter, steps S410 to S430 will be further explained and explained. Specifically, first, after each participant receives the mapping parameter group sent by the intersection calculator, each participant constructs a second position array by using the mapping parameter group and the owned data set, and for any participant, the value of the position array corresponding to the ith data in the data set owned by the participant is: t is i ＝(x i K + b)% n, wherein k and b are two random numbers in the mapping parameter set, and n is the data volume included in the data set of the participant; the value in the second position array is used for determining the position of the data in the data set corresponding to the value in the random matrix, that is, the position of the ith data in the data set mapped in the random matrix can be determined according to the value of the position array corresponding to the ith data in the data set of the participant; the position of the value of the position array corresponding to the ith data in the data set in the position array is the same as the position of the ith data in the data set; then, a random matrix is generated, wherein the random matrix is a matrix of m x d, m is a 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 from T i And obtaining the percentage m, and filling each data in the data set in a corresponding position of the random matrix after obtaining the row number and the column number of each data in the data set in the random matrix to obtain a batch mapping table.
In this exemplary embodiment, after generating the batch mapping table, secret sharing may be performed according to the batch mapping table, and referring to fig. 5, generating a sub-secret table based on the batch mapping table, and sharing the sub-secret table among the multiple parties may include steps S510 to S530:
step S510, determining the number of participants;
step S520, generating a plurality of sub-secret tables with equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as that of the participants;
step s530, send a sub-secret table to each participant.
Hereinafter, steps S510 to S530 will be further explained and explained. Specifically, firstly, determining the number of participants, and after determining the number of the participants, generating a plurality of sub-secret tables with equal length according to the batch mapping table generated by each participant through the number of the participants, wherein the sub-secret tables are random number arrays, the number of the generated sub-secret tables is equal to the number of the participants, and the number of data included in the random number array is equal to the number of the participants; after generating the plurality of child secret tables, one child secret table is sent to each of the plurality of participants.
For example, when the number of participants is S, S equal-length random number arrays [ R ] can be generated according to the batch mapping table generated by each participant 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, S-1 sub-secret tables are randomly shared to S-1 participants except the participant, specifically, when the participant P i Sending the generated jth sub-secret table to the pth j And when the participant is, the participant can be represented by R _ ij.
In the exemplary embodiment, by generating the batch mapping table and performing batch addition secret sharing, the processing efficiency of the user data set and the secret sharing efficiency are improved, and the security of the user data set is ensured.
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 a target result, and an intersection of the data sets of the multiple participants is obtained according to the target result and a batch mapping table of the intersection calculator.
In this exemplary embodiment, after secret sharing is performed, each participant may obtain S-1 sub-secret tables from S-1 participants, and after S-1 sub-secret tables are obtained, secret addition may be performed according to one sub-secret table owned by the participant itself and the received sub-secret tables of other participants to obtain a summation result R i And the summation result R is added i And sending the data to an intersection calculator, calculating by the intersection calculator according to the received summation result sent by each participant to obtain a target result, and obtaining the intersection of the data sets of each participant according to the target result and the batch mapping table of the intersection calculator.
The present disclosure also provides a privacy set intersection method based on multi-party secure computation, which may be applied to an intersection computing party, and as shown in fig. 6, the privacy set intersection method based on multi-party secure computation may include steps S610 to S630:
step S610, generating a mapping parameter group, 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;
s620, receiving the summation result sent by each participant, and obtaining a target result according to the summation result of each participant;
and S630, acquiring a batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of all the participants.
Hereinafter, steps S610 to S630 will be further explained and explained. Specifically, first, the set provider P m Generating a mapping parameter group (k, b, t), wherein k and b in the mapping parameter group are random numbers and are mainly used for determining the position of each data in the data set of the participant in the batch mapping table, t is a length parameter and can influence the length of the position array, and the length of the position array can determine the numberAccording to the degree of collision; after the mapping parameter group is generated, the mapping parameter group is sent to each participant, so that each participant generates a batch mapping table according to the mapping parameter group, a plurality of sub-secret tables are generated through the batch mapping table, and the sub-secret tables are shared among the participants; after the participators receive the sub-secret tables sent by different participators, each participator sums the sub-secret tables to obtain a summation result R i And the summation result R is i Sending the sum to an intersection calculation party, and adding all the summation results after the intersection calculation party receives the summation results sent by all the participants to obtain a target result R (R) 1 +R 2 +…+R S (ii) a And finally, obtaining the intersection of the data sets of the participants according to the batch mapping table of the intersection calculator and the target result.
Further, referring to fig. 7, acquiring the batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of the participants may include step S710 and step S720:
step S710, acquiring the number of participants, and obtaining a target mapping table according to the number of the participants and the batch mapping table of the intersection calculation party;
and S720, comparing the target result with the target mapping table to obtain the same item, wherein the same item is the intersection of the data sets of all the participants.
Hereinafter, step S710 and step S720 will be further explained and explained. Specifically, first, the number S of participants is obtained, and the batch mapping table W of the intersection calculator and the number S of participants are obtained m Multiplying to obtain a target mapping table S W m Then, the intersection calculation party compares the target mapping table with the target result, when the data in the same position of the target mapping table and the target result are the same, the data are the data shared by the participants, and the intersection of the data sets of the participants is obtained through comparison.
The privacy set intersection method based on multi-party secure computation and the privacy set intersection system based on multi-party secure computation provided by the disclosed example embodiments have at least the following advantages: on one hand, the multi-party privacy set intersection can be realized without the participation of a third party, namely, without constructing an OPPRF protocol, so that the efficiency of the privacy set intersection is improved; on the other hand, after each participant acquires the sub-secret tables shared by other participants, the owned sub-secret tables are summed to obtain a summation result, the summation result is sent to the intersection calculation party, the intersection calculation party obtains the intersection of the data sets owned by a plurality of participants according to the summation result and the own batch mapping table, wherein the data sets of the participants can be different in scale, the data safety of the participants is guaranteed in the intersection calculation process, and the intersection calculation efficiency of the privacy sets is further improved.
The disclosed example embodiment provides a privacy set intersection device based on multi-party secure computation, which is applied to any participant, and as shown in fig. 8, 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 transmitting module 830. Wherein:
a mapping parameter set receiving module 810, configured to determine an intersection calculator, and receive a mapping parameter set sent by the intersection calculator;
a sub-secret table sharing module 820, configured to generate a batch mapping table by 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;
and a summation result sending module 830, configured to sum the sub-secret tables of the participants, and send a summation result to the intersection calculator, so that the intersection calculator obtains a target result by using the summation result, and obtains an intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
The disclosed example embodiment also provides a privacy set intersection device based on multi-party secure computation, which is applied to an intersection computing party, and as shown in fig. 9, the privacy set intersection device based on multi-party secure computation may include: a parameter set sending module 910, a target result generating module 920 and an intersection calculating module 930. Wherein,
a parameter group sending module 910, configured to generate a mapping parameter group, 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;
a target result generating module 920, configured to receive the summation result sent by each participant, and obtain a target result according to the summation result of each participant;
and the intersection calculation module 930 is configured to obtain the batch mapping table of the intersection calculator, and compare the batch mapping table of the intersection calculator with the target result to obtain an intersection of the data sets of the participants.
In an exemplary embodiment of the present disclosure, generating a batch mapping table using the set of mapping parameters and a data set of a participant includes:
generating a first location array using the data set of the participant and the set of mapping parameters;
generating a random array, and determining a first position of each data in the data set in the random array through the first position array;
and replacing the data at the first position in the random array with the data in the data set according to the first position to generate the batch mapping table.
In an exemplary embodiment of the present disclosure, generating a batch mapping table using the set of mapping parameters and data of the participants includes:
generating a second position array by using the data set of the participant, the mapping parameter group and the length parameter in the mapping parameter group;
generating a random matrix, and determining a second position of each data in the data set in the random matrix through the second position number group;
and replacing the data at the second position in the random matrix with the data in the data set according to the second position to obtain the batch mapping table.
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 plurality of participants includes:
determining a number of participants;
generating a plurality of sub-secret tables with equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as that of the participants;
a child secret table is sent to each participant.
In an exemplary embodiment of the present disclosure, obtaining a batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain an intersection of the data sets of the participants includes:
acquiring the number of participants, and acquiring a target mapping table according to the number of the participants and the batch mapping table of the intersection calculation party;
and comparing the target result with the target mapping table to obtain the same item, wherein the same item is the intersection of the data sets of all the participants.
The details of each module in the above privacy set intersection apparatus based on multi-party secure computation have been described in detail in the corresponding privacy set intersection method based on multi-party secure computation, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the invention. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present invention are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
In an exemplary embodiment of the present invention, there is also provided an electronic device capable of implementing the above data conversion method.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 1000 according to this embodiment of the invention is described below with reference to fig. 10. The electronic device 1000 shown in fig. 10 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 10, the electronic device is in the form of a general purpose computing device. Components of the electronic device may include, but are not limited to: the at least one processing unit 1010, the at least one memory unit 1020, a bus 1030 connecting different system components (including the memory unit 1020 and the processing unit 1010), and a display unit 1040.
Wherein the storage unit stores program code that is executable by the processing unit 1010 to cause the processing unit 1010 to perform steps according to various exemplary embodiments of the present invention as described in the "exemplary methods" section above in this specification. For example, the processing unit 1010 may execute step S110 as shown in fig. 1: determining an intersection calculator, and receiving the mapping parameter set sent by the intersection calculator; step S120: generating a batch mapping table by 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 participants; step S130: and summing the sub secret tables of the participants, and sending a summation result to the intersection calculator so that the intersection calculator obtains a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
The storage unit 1020 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)10201 and/or a cache memory unit 10202, and may further include a read-only memory unit (ROM) 10203.
The memory 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 thereof, may comprise an implementation of a network environment.
The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 1000, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 1000 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interfaces 1050. Also, the electronic device 1000 may 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 the network adapter 1060. As shown, the network adapter 1060 communicates with the other modules of the electronic device 1000 over the bus 1030. It should be appreciated that although not shown, 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, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiment 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 disk, a removable hard disk, etc.) or on a network, and includes several instructions to make a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) execute the method according to the embodiment of the present invention.
In an exemplary embodiment of the present invention, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.
According to the program product for realizing the method, the portable compact disc read only memory (CD-ROM) can be adopted, the program code is included, and the program product can be operated on terminal equipment, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ 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 electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind 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).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (10)
1. A privacy set intersection method based on multi-party security calculation is applied to any party and comprises the following steps:
determining an intersection calculator, and receiving the mapping parameter set sent by the intersection calculator;
generating a batch mapping table by 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 participants;
and summing the sub secret tables of the participants, and sending a summation result to the intersection calculator so that the intersection calculator obtains a target result by using the summation result, and obtaining the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
2. The privacy set intersection method of claim 1, wherein generating a batch mapping table using the set of mapping parameters and a data set of participants comprises:
generating a first location array using the data set of the participant and the set of mapping parameters;
generating a random array, and determining a first position of each data in the data set in the random array through the first position array;
and replacing the data at the first position in the random array with the data in the data set according to the first position to generate the batch mapping table.
3. The privacy set intersection method of claim 1, wherein generating a batch mapping table using the set of mapping parameters and participant data comprises:
generating a second position array by using the data set of the participant, the mapping parameter group and the length parameter in the mapping parameter group;
generating a random matrix, and determining a second position of each data in the data set in the random matrix through the second position number group;
and replacing the data at the second position in the random matrix with the data in the data set according to the second position to obtain the batch mapping table.
4. The privacy set intersection method of claim 1, wherein generating a sub-secret table based on the batch mapping table and sharing the sub-secret table among the plurality of parties comprises:
determining a number of participants;
generating a plurality of sub-secret tables with equal length according to the batch mapping table, wherein the number of the sub-secret tables is the same as that of the participants;
a child secret table is sent to each participant.
5. A privacy set intersection method based on multi-party security computation is applied to intersection computing parties, and comprises the following steps:
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;
receiving the summation result sent by each participant, and obtaining a target result according to the summation result of each participant;
and acquiring a batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of all the participants.
6. The privacy set intersection method of claim 5, wherein obtaining the batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of the participants comprises:
acquiring the number of participants, and acquiring a target mapping table according to the number of the participants and the batch mapping table of the intersection calculation party;
and comparing the target result with the target mapping table to obtain the same item, wherein the same item is the intersection of the data sets of all the participants.
7. A privacy aggregation intersection apparatus based on multi-party secure computation, applied to any party, the apparatus comprising:
the mapping parameter group receiving module is used for determining an intersection calculator and receiving the mapping parameter group sent by the intersection calculator;
the sub-secret table sharing module is used for generating a batch mapping table by 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 participants;
and the summation result sending module is used for summing the sub-secret tables of the participants and sending the summation result to the intersection calculator so that the intersection calculator can obtain a target result by using the summation result and obtain the intersection of the data sets of the multiple participants according to the target result and the batch mapping table of the intersection calculator.
8. A privacy set intersection apparatus based on multi-party secure computation, applied to intersection computing parties, the apparatus comprising:
the parameter group sending module is used for generating a mapping parameter group, sending the mapping parameter group to each participant so that each participant generates a batch mapping table according to the mapping parameter group and carries out secret sharing according to the batch mapping table;
the target result generation module is used for receiving the summation result sent by each participant and obtaining a target result according to the summation result of each participant;
and the intersection calculation module is used for acquiring the batch mapping table of the intersection calculator, and comparing the batch mapping table of the intersection calculator with the target result to obtain the intersection of the data sets of all the participants.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the privacy set intersection method based on multi-party security computing according to any one of claims 1 to 6.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the multiparty security computing based privacy set intersection method of any one of claims 1-6 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210456602.2A CN114826580A (en) | 2022-04-24 | 2022-04-24 | Privacy set intersection method, device and storage medium based on multi-party security calculation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210456602.2A CN114826580A (en) | 2022-04-24 | 2022-04-24 | Privacy set intersection method, device and storage medium based on multi-party security calculation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114826580A true CN114826580A (en) | 2022-07-29 |
Family
ID=82510122
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210456602.2A Pending CN114826580A (en) | 2022-04-24 | 2022-04-24 | Privacy set intersection method, device and storage medium based on multi-party security calculation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114826580A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412364A (en) * | 2022-10-19 | 2022-11-29 | 北京融数联智科技有限公司 | Method, system and medium for safely solving intersection of multiple parties without third party |
| CN115994161A (en) * | 2023-03-21 | 2023-04-21 | 杭州金智塔科技有限公司 | Data aggregation system and method based on multiparty security calculation |
| CN117544309A (en) * | 2024-01-10 | 2024-02-09 | 厦门身份宝网络科技有限公司 | Mixed computing storage and transmission method and system for plaintext and ciphertext |
| CN117892355A (en) * | 2024-03-14 | 2024-04-16 | 蓝象智联(杭州)科技有限公司 | Multiparty data joint analysis method and system based on privacy protection |
-
2022
- 2022-04-24 CN CN202210456602.2A patent/CN114826580A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412364A (en) * | 2022-10-19 | 2022-11-29 | 北京融数联智科技有限公司 | Method, system and medium for safely solving intersection of multiple parties without third party |
| CN115412364B (en) * | 2022-10-19 | 2023-03-24 | 北京融数联智科技有限公司 | Method, system and medium for safely solving intersection of multiple parties without third party |
| CN115994161A (en) * | 2023-03-21 | 2023-04-21 | 杭州金智塔科技有限公司 | Data aggregation system and method based on multiparty security calculation |
| CN115994161B (en) * | 2023-03-21 | 2023-06-06 | 杭州金智塔科技有限公司 | Data aggregation system and method based on multiparty security calculation |
| CN117544309A (en) * | 2024-01-10 | 2024-02-09 | 厦门身份宝网络科技有限公司 | Mixed computing storage and transmission method and system for plaintext and ciphertext |
| CN117544309B (en) * | 2024-01-10 | 2024-03-22 | 厦门身份宝网络科技有限公司 | Mixed computing storage and transmission method and system for plaintext and ciphertext |
| CN117892355A (en) * | 2024-03-14 | 2024-04-16 | 蓝象智联(杭州)科技有限公司 | Multiparty data joint analysis method and system based on privacy protection |
| CN117892355B (en) * | 2024-03-14 | 2024-05-24 | 蓝象智联(杭州)科技有限公司 | Multiparty data joint analysis method and system based on privacy protection |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114826580A (en) | Privacy set intersection method, device and storage medium based on multi-party security calculation | |
| CN113159327B (en) | Model training method and device based on federal learning system and electronic equipment | |
| CN113708930B (en) | Data comparison method, device, equipment and medium for private data | |
| CN110969524B (en) | Block chain-based fund service processing method, device, equipment and medium | |
| CN114528044A (en) | Interface calling method, device, equipment and medium | |
| CN113922995A (en) | Cloud desktop sharing method and device, storage medium and electronic equipment | |
| CN112615852A (en) | Data processing method, related device and computer program product | |
| CN113571162B (en) | Method, device and system for realizing multi-user collaborative operation medical image | |
| CN113032817B (en) | Data alignment method, device, equipment and medium based on block chain | |
| CN113626765A (en) | Energy data processing method, device, equipment and storage medium | |
| CN108876299A (en) | A kind of method and device handling electronic contract | |
| CN113691374A (en) | Data encryption method and device, storage medium and electronic equipment | |
| CN110532810A (en) | Information processing method, device, electronic equipment and readable storage medium storing program for executing | |
| CN115795503A (en) | Privacy set intersection method and device, storage medium and electronic equipment | |
| CN114723239A (en) | Multi-party collaborative modeling method, device, equipment, medium and program product | |
| CN114359015A (en) | Data transmission method and device and graphic processing server | |
| CN114254370A (en) | Method and device for improving transaction matching degree based on multi-party security privacy calculation | |
| CN113435537A (en) | Cross-feature federated learning method and prediction method based on Soft GBDT | |
| CN112615712B (en) | Data processing method, related device and computer program product | |
| US20120131489A1 (en) | Evaluating and comparing the requirements of a task with the capabilities of an entity | |
| CN114327486B (en) | Method, device and medium for realizing multiparty security calculation based on domain-specific language | |
| CN113328913B (en) | Method, device and system for improving project testing efficiency | |
| KR102531826B1 (en) | Method and apparatus for acquiring a random number for blockchain, device and storage medium | |
| CN114650179B (en) | Risk data monitoring method, apparatus, system, electronic device and storage medium | |
| CN113821825B (en) | Feature distance determining method, device and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |