CN114520721B - Multiparty secure computing privacy exchange method, device, equipment and storage medium - Google Patents
Multiparty secure computing privacy exchange method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN114520721B CN114520721B CN202210287748.9A CN202210287748A CN114520721B CN 114520721 B CN114520721 B CN 114520721B CN 202210287748 A CN202210287748 A CN 202210287748A CN 114520721 B CN114520721 B CN 114520721B
- Authority
- CN
- China
- Prior art keywords
- information
- encryption information
- initial
- encryption
- initial encryption
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 72
- 238000013507 mapping Methods 0.000 claims abstract description 106
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 92
- 230000006870 function Effects 0.000 claims description 99
- 230000008569 process Effects 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 10
- 238000004364 calculation method Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 239000012634 fragment Substances 0.000 description 2
- 239000003999 initiator Substances 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000001010 compromised effect Effects 0.000 description 1
- 238000013506 data mapping Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006116 polymerization reaction Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0478—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload applying multiple layers of encryption, e.g. nested tunnels or encrypting the content with a first key and then with at least a second key
-
- 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- 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
Abstract
The method is applied to a query party and a participant, and comprises the steps that all the participants map privacy data of all the participants into mapping data based on a commonly selected mapping function, and a corresponding relation of the mapping data is constructed; constructing initial encryption information through an encryption algorithm according to the corresponding relation; the inquiring party shares the initial encryption information to other participators in a secret sharing mode; the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information; and the inquiring party determines privacy intersection information according to the inquiry encryption information and the corresponding relation. The method can ensure that the data is not leaked, ensure the safety privacy, and realize the privacy exchange under the condition of supporting different data scales of different participants.
Description
Technical Field
The disclosure relates to the technical field of privacy computing, and in particular relates to a multiparty secure computing privacy intersection method, device, equipment and storage medium.
Background
In the 'everything interconnection age', the collection and storage of personal user information by enterprises will also be growing in an explosive manner. The personal safety of the individual user and the business interests of the enterprise user themselves can be compromised by various risks encountered by the data in the use and circulation links.
The circulation sharing and the value mining of the data elements are core contents of the market cultivation of the data elements, and the premise of the information sharing and the value mining is to guarantee the privacy security of the data.
The prior art mainly depends on an internal management system and an external data security system for protecting the privacy of data, and the two modes only prevent the data from leaking from the surface, but cannot truly ensure the privacy security of the data, cannot realize the sharing of the value of the data, and cannot truly realize the availability and invisibility of the data.
The information disclosed in the background section of this application is only for enhancement of understanding of the general background of this application and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The embodiment of the disclosure provides a multiparty secure computing privacy intersection method, a multiparty secure computing privacy intersection device, equipment and a storage medium.
Querying party in a first aspect of embodiments of the present disclosure,
the utility model provides a multiparty secure computing privacy is solved and is handed over method, the method is applied to inquiry party and participant, the inquiry party is any one of the participant, the method includes:
all the participants map privacy data of all the participants into mapping data based on a commonly selected mapping function, and a corresponding relation of the mapping data is constructed;
constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the inquiring party shares the initial encryption information to other participators in a secret sharing mode;
the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information;
and the inquiring party determines privacy intersection information according to the inquiry encryption information and the corresponding relation. .
In an alternative embodiment of the present invention,
the encryption algorithm includes a first encryption algorithm, the initial encryption information includes first initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
and respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm according to the corresponding relation to construct the first initial encryption information.
In an alternative embodiment of the present invention,
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information.
In an alternative embodiment of the present invention,
the method of constructing the first initial encryption information includes constructing the first initial encryption information according to a method shown in the following formula (1):
（1）
wherein,
wherein,representing a first intermediate parameter, ">Representing a second intermediate parameter, ">Indicating the total number of parameters.
In an alternative embodiment of the present invention,
the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
and constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, the predetermined encryption function and the predetermined encryption table.
In an alternative embodiment of the present invention,
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
In an alternative embodiment of the present invention,
the method of constructing the second initial encryption information includes constructing the second initial encryption information according to a method shown in the following formula (2):
(2)
wherein,representing a first intermediate parameter, ">Representing the mapping function, k representing the number of the mapping function, GBF (t) representing the number at the position of the array t corresponding to the second encryption algorithm.
In an alternative embodiment of the present invention,
the mapping functions include a first mapping function and a second mapping function,
the first mapping function maps the privacy data of the participant to first intermediate data,
the second mapping data maps the privacy data of the participant to second intermediate data,
the first mapping function and the second mapping function belong to two functions of different parameters in the same class of functions.
In a second aspect of the embodiments of the present disclosure,
the utility model provides a multiparty safe calculation privacy is solved and is handed over device, the device is applied to inquiry party and participant, the inquiry party is any one among the participant, the device includes:
the first unit is used for mapping privacy data of all the participants into mapping data based on the commonly selected mapping function, and constructing a corresponding relation of the mapping data;
the second unit is used for constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the third unit is used for sharing the initial encryption information to other participants by the inquiring party in a secret sharing mode;
a fourth unit, configured to determine query encryption information according to the initial encryption information and feature information corresponding to the initial encryption information by the querying party;
and a fifth unit, configured to determine privacy intersection information according to the query encryption information and the correspondence by the querying party.
In an alternative embodiment of the present invention,
the encryption algorithm includes a first encryption algorithm, the initial encryption information includes first initial encryption information,
the second unit is further configured to:
and respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm according to the corresponding relation to construct the first initial encryption information.
In an alternative embodiment of the present invention,
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the fourth unit is further configured to:
and the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information.
In an alternative embodiment of the present invention,
the second unit is further configured to:
the first initial encryption information is constructed as shown in the following formula (1):
（1）
wherein,
wherein,representing a first intermediate parameter, ">Representing a second intermediate parameter, ">Indicating the total number of parameters.
In an alternative embodiment of the present invention,
the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the second unit is further configured to:
and constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, the predetermined encryption function and the predetermined encryption table.
In an alternative embodiment of the present invention,
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the fourth unit is further configured to:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
In an alternative embodiment, the second unit is further configured to:
the second initial encryption information is constructed as shown in the following formula (2):
(2)
wherein,representing a first intermediate parameter, ">Representing the mapping function, k representing the number of the mapping function, GBF (t) representing the number at the position of the array t corresponding to the second encryption algorithm.
In an alternative embodiment of the present invention,
the mapping functions include a first mapping function and a second mapping function,
the first mapping function maps the privacy data of the participant to first intermediate data,
the second mapping data maps the privacy data of the participant to second intermediate data,
the first mapping function and the second mapping function belong to two functions of different parameters in the same class of functions.
In a third aspect of the embodiments of the present disclosure,
there is provided an electronic device including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to invoke the instructions stored in the memory to perform the method of any of the preceding claims.
In a fourth aspect of embodiments of the present disclosure,
there is provided a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement a method as claimed in any one of the preceding claims.
The multiparty security computing privacy intersection method is applied to a query party and a participant, wherein the query party is any one of the participants, and the method comprises the following steps:
all the participants map privacy data of all the participants into mapping data based on a commonly selected mapping function, and a corresponding relation of the mapping data is constructed;
constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the inquiring party shares the initial encryption information to other participators in a secret sharing mode;
the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information;
and the inquiring party determines privacy intersection information according to the inquiry encryption information and the corresponding relation.
The multiparty secure computing privacy intersection method can ensure that data is not leaked, secure privacy is ensured, privacy intersection is realized under the condition that data scales of different participants are different, and the data is invisible.
Drawings
FIG. 1 schematically illustrates a flow diagram of a multi-party secure computing privacy intersection method in accordance with an embodiment of the present disclosure;
FIG. 2 schematically illustrates a logic diagram of a multiparty secure computing privacy intersection method of an embodiment of the present disclosure;
FIG. 3 schematically illustrates a logic diagram of a first encryption algorithm according to an embodiment of the present disclosure;
FIG. 4 schematically illustrates a logic diagram of a second encryption algorithm according to an embodiment of the present disclosure;
FIG. 5 schematically illustrates a bloom filter table of an embodiment of the present disclosure;
fig. 6 schematically illustrates a structural diagram of a multiparty secure computing privacy intersection device according to an embodiment of the present disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, not all embodiments. Based on the embodiments in this disclosure, all other embodiments that a person of ordinary skill in the art would obtain without making any inventive effort are within the scope of protection of this disclosure.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the disclosure described herein may be capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present disclosure, the size of the sequence number of each process does not mean that the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure.
It should be understood that in this disclosure, "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements that are expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in this disclosure, "plurality" means two or more. "and/or" is merely an association relationship describing an association object, and means that three relationships may exist, for example, and/or B may mean: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship. "comprising A, B and C", "comprising A, B, C" means that all three of A, B, C comprise, "comprising A, B or C" means that one of the three comprises A, B, C, and "comprising A, B and/or C" means that any 1 or any 2 or 3 of the three comprises A, B, C.
It should be understood that in this disclosure, "B corresponding to a", "a corresponding to B", or "B corresponding to a" means that B is associated with a from which B may be determined. Determining B from a does not mean determining B from a alone, but may also determine B from a and/or other information. The matching of A and B is that the similarity of A and B is larger than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to detection" depending on the context.
The technical scheme of the present disclosure is described in detail below with specific examples. The following embodiments may be combined with each other, and some embodiments may not be repeated for the same or similar concepts or processes.
It should be noted that the multiparty secure computing privacy intersection method of the embodiments of the present disclosure is applied to a plurality of participants and querying parties, wherein,
the participants comprise data parties that hold private data and participate in multiparty secure computation;
the inquiring party comprises a data party which holds the privacy data and inquires the privacy exchange information;
wherein the inquirer can be any one of the participants.
FIG. 1 schematically illustrates a flow diagram of a multi-party secure computing privacy intersection method in accordance with an embodiment of the present disclosure; fig. 2 schematically illustrates a logic diagram of a multiparty secure computing privacy intersection method according to an embodiment of the present disclosure, and in conjunction with fig. 1 and fig. 2, the method is applied to a querying party and a participating party, where the querying party is any one of the participating parties, and the method includes:
s101, mapping privacy data of all participants into mapping data based on a commonly selected mapping function, and constructing a corresponding relation of the mapping data;
optionally, in the embodiment of the present disclosure, before performing multiparty security computation, all the participants may jointly select a mapping function, that is, all the participants perform data mapping by using the same mapping function; the number of mapping functions may include a plurality of mapping functions, and for simplicity and convenience of description, the number of mapping functions is taken as two for illustration in the embodiment of the disclosure, and the number and types of mapping functions are not limited in the embodiment of the disclosure.
In an alternative embodiment of the present invention,
the mapping functions include a first mapping function and a second mapping function,
the first mapping function maps the privacy data of the participant to first intermediate data,
the second mapping function maps the privacy data of the participant to second intermediate data,
the first mapping function and the second mapping function belong to functions of different parameters in the same class of functions.
Illustratively, taking N participants as an example, the participants correspond to data sets x_1, x_n, respectively, each data set having possession ofThe individual data x_i= { x_i1,.. N P_1 may be the querying party, p_2,..p_n may be the participating party, h_1 may represent the first mapping function, h_2 may represent the second mapping function, and the first and second mapping functions may be the mapping functions common to the respective participating parties. Wherein the first mapping function and the second mapping function are two functions of different parameters in the same class of functions, i.e. the first mapping function and the second mapping function may both be hash functions, but the specific parameter values of the two functions may be different.
Each party can map own privacy data into mapping data through a first mapping function and a second mapping function, the data mapped through the first mapping function can be first intermediate data, and the data mapped through the second mapping function can be second intermediate data, wherein the mapping data can further comprise the first intermediate data and the second intermediate data for convenience of explanation.
Optionally, the first mapping function and the second mapping function of the embodiments of the present disclosure may include hash functions, but it should be noted that the hash functions are merely exemplary, and the specific types of the mapping functions are not limited by the embodiments of the present disclosure.
For example, the first intermediate data may be represented as h_i1= { h_i11,..h_i1mn }, and the second intermediate data may be represented as h_i2= { h_i21,..h_i2mn }; the first intermediate data and the second intermediate data are structured as correspondence, that is, the correspondence may be expressed as { (h_i11, h_i21),., (h_i1mn, h_i2mn) }.
According to the embodiment of the disclosure, the private data is mapped through the mapping function commonly selected by the plurality of participants, so that the encryption and blinding process of the data can be performed locally without remote communication, and the calculation cost and the communication cost can be effectively reduced.
Wherein, blinding refers to randomizing data.
S102, constructing initial encryption information through an encryption algorithm according to the corresponding relation;
in an alternative implementation, the encryption algorithm of the disclosed embodiments may include a first encryption algorithm and a second encryption algorithm,
the initial encryption information comprises first initial encryption information and second initial encryption information, wherein the first initial encryption information is obtained through a first encryption algorithm, and the second initial encryption information is obtained through a second encryption algorithm;
illustratively, the first encryption algorithm may include a polynomial interpolation algorithm, and the second encryption algorithm may include a bloom filter algorithm, where the first encryption algorithm and the second encryption algorithm are merely exemplary, and the first encryption algorithm and the second encryption algorithm are specifically defined in the embodiments of the present disclosure.
The initial encryption information refers to information after the corresponding relation is encrypted; in an alternative embodiment of the present invention,
the encryption algorithm includes a first encryption algorithm, the initial encryption information includes first initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
and respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm according to the corresponding relation to construct the first initial encryption information.
FIG. 3 schematically illustrates a logic diagram of a first encryption algorithm according to an embodiment of the present disclosure;
illustratively, the embodiment of the disclosure takes the first encryption algorithm as a polynomial interpolation algorithm, and the correspondence relationship is { (h_i11, h_i21),...
Specifically, the first initial encryption information may be constructed as shown in the following formula (1):
（1）
wherein,
representing a first intermediate parameter, ">Representing a second intermediate parameter, ">Representing the total number of parameters;
wherein the first intermediate parameter may comprise an abscissa of a vector corresponding to the privacy data; the second intermediate parameter may comprise an ordinate of the privacy data corresponding vector.
It should be noted that, the first intermediate parameter and the second intermediate parameter in the embodiment of the present disclosure are parameters used in the process of constructing the first initial encryption information; the first intermediate data and the second intermediate data in the embodiments of the present disclosure are data in which privacy data is mapped by a mapping function.
In an alternative embodiment of the present invention,
the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
and constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, the predetermined encryption function and the predetermined encryption table.
FIG. 4 schematically illustrates a logic diagram of a second encryption algorithm according to an embodiment of the present disclosure;
illustratively, the disclosed embodiments take the second encryption algorithm as a bloom filter algorithm, the correspondence is { (h_i11, h_i21),.+ -, (h_i1mN, h_i2mN) } as an example,
the second initial encryption information may be constructed as shown in the following formula (2):
(2)
wherein,representing a first intermediate parameter, ">Representing the mapping function, k representing the number of the mapping function, GBF (t) representing the number at the position of the array t corresponding to the second encryption algorithm.
FIG. 5 schematically illustrates a bloom filter table of an embodiment of the present disclosure, as shown in FIG. 5, where all participants may jointly select multiple mapping functions, and illustratively, all participants may jointly select three hash functions, which may be denoted as h_1, h_2, and h_3, respectively; it should be noted that the embodiments of the present disclosure do not limit the types and numbers of mapping functions that are commonly selected by all the participants.
Taking any party p_i as an example, it may generate an empty bloom filter table, which may be represented as table_i, and any party p_i may generate three corresponding values, h_1 (x_ij), h_2 (x_ij), h_3 (x_ij), through three hash functions selected together, respectively, and query whether there are corresponding empty positions in the empty bloom filter table table_i based on the generated three values;
if there are empty positions, three random numbers, respectively denoted as r_1ij, r_2ij, r_3ij, are generated by a pseudo-random function, the sum of the three values is made equal to one value in the second intermediate data in the correspondence, for example, h_i21, that is, such that r_1ij+r_2ij+r_3ij=h_i21, and then the three random numbers r_1ij, r_2ij, r_3ij generated by the pseudo-random function are inserted into the corresponding positions.
If there is no empty position, no corresponding value is inserted.
S103, the inquiring party shares the initial encryption information to other parties in a secret sharing mode;
illustratively, secret sharing of embodiments of the present disclosure refers to splitting data into a plurality of nonsensical numbers and distributing the numbers to a plurality of parties; by means of secret sharing, each participant can only take a part of the original data, one or a few participants can not restore the original data, and only when the respective data are put together, the real data can be restored.
In actual calculation, each participant distributes data fragments to other participants in a secret sharing mode, each participant calculates by using each data fragment received by the participant, and exchanges some data (the exchanged data is random and does not contain information about the original data) when appropriate, the result after calculation is sent to an initiator, and the initiator aggregates the results returned by all the participants. The information of each participant can be protected by calculating based on the data slicing, but the real calculation result can be restored during the final polymerization;
optionally, the secret sharing manner of the embodiment of the present disclosure may include shamir secret sharing, which should be noted that the secret sharing manner of the embodiment of the present disclosure is not limited.
S104, the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information;
for example, the feature information of the embodiment of the present disclosure may include first feature information and second feature information, where the first feature information is used to indicate an average value of coefficients corresponding to each item in the first initial encryption information; the second characteristic information is used to indicate an average value of values of the same location of each party in the second initial encrypted information.
Alternatively, the first initial encryption information may include a plurality of items, illustratively, ten items of the first initial encryption information are included, for example, the first item coefficient k_1 in the first initial encryption information of each party may be generated, N sub-secrets with a threshold value t are generated, the sub-secrets are distributed to other parties, the threshold value t of all parties should be kept consistent, and the number of parties required for determining the inquiry encryption information is determined by the threshold value t.
Further, the first initial encryption information may include a plurality of orders, for example, first order, second order, third order, and the like, for example, coefficients of all first orders in the first initial encryption information may be averaged, coefficients of all second orders in the first initial encryption information may be averaged, and the like.
Alternatively, taking the second initial encryption information as an example of a bloom filter table, taking the bloom filter table including 10 locations as an example, numbered 1-10, respectively, it will be appreciated that each participant may correspond to one bloom filter table,
wherein the values corresponding to position number 1 in the bloom filter table for each participant may be averaged. Specifically, the position No. 1 in the first bloom filter table corresponding to the first participant, the position No. … in the second bloom filter table corresponding to the second participant, and the value corresponding to the position No. 1 in the tenth bloom filter table corresponding to the tenth participant are averaged.
In an alternative embodiment of the present invention,
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information.
The query encryption information determined by the first encryption algorithm may include a polynomial, which is different from the first initial encryption information in that it is a polynomial constructed on the basis of the first initial encryption information, which is a polynomial constructed on the basis of the correspondence.
In an alternative embodiment of the present invention,
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
Illustratively, taking the second characteristic information including ten bloom filter tables, each bloom filter table including ten positions as an example, replacing the value of the position No. 1 in the first bloom filter table in the second initial encryption information with the value of the position No. 1 in the first bloom filter table in the second characteristic information.
S105, the inquiring party determines privacy exchange information according to the inquiry encryption information and the corresponding relation.
In an alternative embodiment of the present invention,
the multiple participants substitute the private data of the multiple participants into the inquiry encryption information to determine an inquiry result;
and comparing whether the query result is matched with the corresponding relation, and if so, determining privacy intersection information.
Illustratively, multiple parties may substitute their own private data into the query encryption information, ultimately outputting w= { w_1, &., w_m }, blinding the final output by y_j = w_j-r_0;
and comparing the final output blinded result y_j with the result F (k, x_1j) blinded to the participant private data, and if the results are matched, indicating that the x_1j is in the intersection of the participants.
The multiparty security computing privacy intersection method is applied to a query party and a participant, wherein the query party is any one of the participants, and the method comprises the following steps:
all the participants map privacy data of all the participants into mapping data based on a commonly selected mapping function, and a corresponding relation of the mapping data is constructed;
constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the inquiring party shares the initial encryption information to other participators in a secret sharing mode;
the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information;
and the inquiring party determines privacy intersection information according to the inquiry encryption information and the corresponding relation.
According to the multiparty security calculation privacy intersection method, the inquiry encryption information can be determined through the initial encryption information, privacy intersection is conducted through the two types of information, the fact that any party cannot infer information of other parties from the obtained information is guaranteed, privacy intersection is conducted under the condition that part of parties collude is supported, the fact that data do not leak is guaranteed, security privacy is guaranteed, privacy intersection can be achieved under the condition that the scales of the data of different parties are different is supported, and the fact that the data are available and invisible is truly achieved. In addition, the method of the embodiment of the disclosure can be compatible with scenes in which partial participants abandon privacy intersection midway, and is suitable for abundant scenes.
Fig. 6 schematically illustrates a structural diagram of a multiparty secure computing privacy intersection device according to an embodiment of the present disclosure, as shown in fig. 6, the device includes,
a first unit 61, configured to map privacy data of all participants into mapping data based on a commonly selected mapping function, and construct a correspondence of the mapping data;
a second unit 62, configured to construct initial encrypted information by an encryption algorithm according to the correspondence;
a third unit 63, configured to share the initial encrypted information to other parties by the querying party in a secret sharing manner;
a fourth unit 64, configured to determine query encryption information according to the initial encryption information and feature information corresponding to the initial encryption information by the querying party;
and a fifth unit 65, configured to determine privacy intersection information according to the query encryption information and the correspondence by the querying party.
In an alternative embodiment of the present invention,
the encryption algorithm includes a first encryption algorithm, the initial encryption information includes first initial encryption information,
the second unit 62 is further configured to:
and respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm according to the corresponding relation to construct the first initial encryption information.
In an alternative embodiment of the present invention,
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the fourth unit 64 is further configured to:
and the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information.
In an alternative embodiment of the present invention,
the second unit 62 is further configured to:
the first initial encryption information is constructed as shown in the following formula (1):
（1）
wherein,
wherein,representing a first intermediate parameter, ">Representing a second intermediate parameter, ">Indicating the total number of parameters.
In an alternative embodiment of the present invention,
the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the second unit 62 is further configured to:
and constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, the predetermined encryption function and the predetermined encryption table.
In an alternative embodiment of the present invention,
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the fourth unit 64 is further configured to:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
In an alternative embodiment, the second unit 62 is further configured to:
the second initial encryption information is constructed as shown in the following formula (2):
(2)
wherein,representing a first intermediate parameter, ">Representing the mapping function, k representing the number of the mapping function, GBF (t) representing the number at the position of the array t corresponding to the second encryption algorithm.
The beneficial effects of the device embodiments of the present disclosure may refer to the beneficial effects of the foregoing method embodiments, and are not described herein.
In a third aspect of the embodiments of the present disclosure,
there is provided an electronic device including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to invoke the instructions stored in the memory to perform the aforementioned method.
In a fourth aspect of embodiments of the present disclosure,
there is provided a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the foregoing method.
The present disclosure also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the device may read the execution instructions from the readable storage medium, the execution instructions being executed by the at least one processor to cause the device to implement the methods provided by the various embodiments described above.
The readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media can be any available media that can be accessed by a general purpose or special purpose computer. For example, a readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the readable storage medium. In the alternative, the readable storage medium may be integral to the processor. The processor and the readable storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuits, ASIC for short). In addition, the ASIC may reside in a user device. The processor and the readable storage medium may reside as discrete components in a communication device. The readable storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tape, floppy disk, optical data storage device, etc.
In the above embodiments of the terminal or the server, it should be understood that the processor may be a central processing unit (english: central Processing Unit, abbreviated as CPU), or may be other general purpose processors, digital signal processors (english: digital Signal Processor, abbreviated as DSP), application specific integrated circuits (english: application Specific Integrated Circuit, abbreviated as ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present disclosure may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in a processor for execution.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present disclosure, and not for limiting the same; although the present disclosure has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present disclosure.
Claims (6)
1. A multiparty secure computing privacy intersection method, characterized in that the method is applied to a querying party and a participating party, wherein the querying party is any one of the participating parties, the method comprising:
all the participants map privacy data of all the participants into mapping data based on a commonly selected mapping function, and a corresponding relation of the mapping data is constructed;
the mapping function comprises a first mapping function and a second mapping function;
the first mapping function maps the privacy data of the participant to first intermediate data;
the second mapping function maps the privacy data of the participant to second intermediate data;
constructing the first intermediate data and the second intermediate data as a corresponding relationship;
constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the inquiring party shares the initial encryption information to other participators in a secret sharing mode;
the inquiring party determines inquiry encryption information according to the initial encryption information and the characteristic information corresponding to the initial encryption information;
the inquiring party determines privacy intersection information according to the inquiry encryption information and the corresponding relation, and the encryption algorithm comprises a first encryption algorithm or a second encryption algorithm;
when the encryption algorithm comprises a first encryption algorithm, the initial encryption information comprises first initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
according to the corresponding relation, respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm to construct the first initial encryption information;
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information;
when the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, a predetermined encryption function and an encryption table;
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
2. The method of claim 1, the method of constructing the first initial encryption information comprising constructing the first initial encryption information according to a method shown in the following formula (1):
（1）
wherein,
the parameters used in the process of constructing the first initial encryption information comprise a first intermediate parameter and a second intermediate parameter;
the first intermediate parameter comprises an abscissa of a vector corresponding to the privacy data; the second intermediate parameter comprises the ordinate of the privacy data corresponding vector,representing a first intermediate parameter, ">Representing a second intermediate parameter, ">Indicating the total number of parameters.
3. The method according to claim 2, wherein the method of constructing the second initial encryption information includes constructing the second initial encryption information according to a method shown in the following formula (2):
(2)
wherein,representing a first intermediate parameter, ">Representing the mapping function, k representing the number of the mapping function, GBF (t) representing the number at the position of the array t corresponding to the second encryption algorithm.
4. A method according to any one of claim 1 to 3, wherein,
the first mapping function and the second mapping function belong to two functions of different parameters in the same class of functions.
5. A multiparty secure computing privacy intersection device, wherein the device is applied to a querying party and a participating party, the querying party being any one of the participating parties, the device comprising:
the first unit is used for mapping privacy data of all the participants into mapping data based on the commonly selected mapping function, and constructing a corresponding relation of the mapping data;
the mapping function comprises a first mapping function and a second mapping function;
the first mapping function maps the privacy data of the participant to first intermediate data;
the second mapping function maps the privacy data of the participant to second intermediate data;
constructing the first intermediate data and the second intermediate data as a corresponding relationship;
the second unit is used for constructing initial encryption information through an encryption algorithm according to the corresponding relation;
the third unit is used for sharing the initial encryption information to other participants by the inquiring party in a secret sharing mode;
a fourth unit, configured to determine query encryption information according to the initial encryption information and feature information corresponding to the initial encryption information by the querying party;
a fifth unit, configured to determine privacy intersection information according to the query encryption information and the correspondence by the query party, where the encryption algorithm includes a first encryption algorithm or a second encryption algorithm;
when the encryption algorithm comprises a first encryption algorithm, the initial encryption information comprises first initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
according to the corresponding relation, respectively inserting corresponding characteristic values into the mapping data through the first encryption algorithm to construct the first initial encryption information;
the characteristic information comprises first characteristic information, wherein the first characteristic information is used for indicating the average value of coefficients corresponding to each item in the first initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
the inquiring party determines to inquire the encrypted information through the first encryption algorithm according to the first initial encrypted information and the first characteristic information;
when the encryption algorithm includes a second encryption algorithm, the initial encryption information includes second initial encryption information,
the method for constructing the initial encryption information through the encryption algorithm according to the corresponding relation comprises the following steps:
constructing the second initial encryption information through the second encryption algorithm according to the corresponding relation, a predetermined encryption function and an encryption table;
the characteristic information includes second characteristic information for indicating an average value of values of each party at the same position in the second initial encryption information;
the method for determining the inquiry encryption information by the inquiry party according to the initial encryption information and the characteristic information corresponding to the initial encryption information comprises the following steps:
and the inquiring party replaces the value of the same position as the second characteristic information in the second initial encryption information by the value of the second characteristic information to determine the inquiring encryption information.
6. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to invoke the instructions stored in the memory to perform the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210287748.9A CN114520721B (en) | 2022-03-22 | 2022-03-22 | Multiparty secure computing privacy exchange method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210287748.9A CN114520721B (en) | 2022-03-22 | 2022-03-22 | Multiparty secure computing privacy exchange method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114520721A CN114520721A (en) | 2022-05-20 |
| CN114520721B true CN114520721B (en) | 2024-03-29 |
Family
ID=81600086
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210287748.9A Active CN114520721B (en) | 2022-03-22 | 2022-03-22 | Multiparty secure computing privacy exchange method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114520721B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114553593A (en) * | 2022-03-22 | 2022-05-27 | 杭州博盾习言科技有限公司 | Multi-party secure computation privacy intersection method, device, equipment and storage medium |
| CN114978512B (en) * | 2022-07-18 | 2022-09-27 | 华控清交信息科技(北京)有限公司 | Privacy intersection method and device and readable storage medium |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641603A (en) * | 2020-05-15 | 2020-09-08 | 北京青牛技术股份有限公司 | Privacy set intersection data interaction method and system based on homomorphic encryption |
| CN111931207A (en) * | 2020-08-07 | 2020-11-13 | 北京百度网讯科技有限公司 | Method, device and equipment for obtaining privacy set intersection and storage medium |
| CN112699386A (en) * | 2020-12-22 | 2021-04-23 | 杭州趣链科技有限公司 | Method and equipment for acquiring private data intersection, electronic device and storage medium |
| WO2021114819A1 (en) * | 2019-12-11 | 2021-06-17 | 支付宝(杭州)信息技术有限公司 | Methods for generating and executing smart contract transaction and device |
| CN113065155A (en) * | 2021-03-26 | 2021-07-02 | 杭州宇链科技有限公司 | Privacy set intersection method based on trusted execution environment assistance |
| CN113079137A (en) * | 2021-03-22 | 2021-07-06 | 华控清交信息科技(北京)有限公司 | Multi-party privacy intersection method and privacy data processing system |
| CN113179150A (en) * | 2021-04-26 | 2021-07-27 | 杭州宇链科技有限公司 | Homomorphic privacy set intersection method based on order preserving function |
| CN113312641A (en) * | 2021-06-02 | 2021-08-27 | 杭州趣链科技有限公司 | Multipoint and multiparty data interaction method, system, electronic device and storage medium |
| CN113518092A (en) * | 2021-07-22 | 2021-10-19 | 西安电子科技大学 | Set intersection method for realizing multi-party privacy |
| CN113672949A (en) * | 2021-07-27 | 2021-11-19 | 美库尔商务信息咨询(上海)有限公司 | Data transmission method and system for protecting advertisement multiparty privacy |
| CN113708930A (en) * | 2021-10-20 | 2021-11-26 | 杭州趣链科技有限公司 | Data comparison method, device, equipment and medium for private data |
| WO2021237437A1 (en) * | 2020-05-26 | 2021-12-02 | 云图技术有限公司 | Data processing method and apparatus employing secure multi-party computation, and electronic device |
| CN113868693A (en) * | 2021-07-27 | 2021-12-31 | 朱玮 | Query method and system for privacy protection of data in anti-money laundering |
| CN113962401A (en) * | 2021-11-24 | 2022-01-21 | 杭州博盾习言科技有限公司 | Federal learning system, and feature selection method and device in federal learning system |
| CN114020793A (en) * | 2021-11-11 | 2022-02-08 | 四川新网银行股份有限公司 | Method, device, equipment and storage medium for querying private data among multiple mechanisms |
| CN114036572A (en) * | 2021-11-29 | 2022-02-11 | 支付宝(杭州)信息技术有限公司 | Privacy intersection method and device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016122513A1 (en) * | 2015-01-29 | 2016-08-04 | Hewlett Packard Enterprise Development Lp | Data analytics on encrypted data elements |
| EP3580685B1 (en) * | 2018-04-19 | 2021-03-24 | Google LLC | Security measures for determination of private set intersections |
| US11178117B2 (en) * | 2018-12-18 | 2021-11-16 | International Business Machines Corporation | Secure multiparty detection of sensitive data using private set intersection (PSI) |
| US20220121731A1 (en) * | 2019-12-20 | 2022-04-21 | Cambrian Designs, Inc. | System & Method for Implementing a Digital Data Marketplace |
-
2022
- 2022-03-22 CN CN202210287748.9A patent/CN114520721B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021114819A1 (en) * | 2019-12-11 | 2021-06-17 | 支付宝(杭州)信息技术有限公司 | Methods for generating and executing smart contract transaction and device |
| CN111641603A (en) * | 2020-05-15 | 2020-09-08 | 北京青牛技术股份有限公司 | Privacy set intersection data interaction method and system based on homomorphic encryption |
| WO2021237437A1 (en) * | 2020-05-26 | 2021-12-02 | 云图技术有限公司 | Data processing method and apparatus employing secure multi-party computation, and electronic device |
| CN111931207A (en) * | 2020-08-07 | 2020-11-13 | 北京百度网讯科技有限公司 | Method, device and equipment for obtaining privacy set intersection and storage medium |
| CN112699386A (en) * | 2020-12-22 | 2021-04-23 | 杭州趣链科技有限公司 | Method and equipment for acquiring private data intersection, electronic device and storage medium |
| CN113079137A (en) * | 2021-03-22 | 2021-07-06 | 华控清交信息科技(北京)有限公司 | Multi-party privacy intersection method and privacy data processing system |
| CN113065155A (en) * | 2021-03-26 | 2021-07-02 | 杭州宇链科技有限公司 | Privacy set intersection method based on trusted execution environment assistance |
| CN113179150A (en) * | 2021-04-26 | 2021-07-27 | 杭州宇链科技有限公司 | Homomorphic privacy set intersection method based on order preserving function |
| CN113312641A (en) * | 2021-06-02 | 2021-08-27 | 杭州趣链科技有限公司 | Multipoint and multiparty data interaction method, system, electronic device and storage medium |
| CN113518092A (en) * | 2021-07-22 | 2021-10-19 | 西安电子科技大学 | Set intersection method for realizing multi-party privacy |
| CN113672949A (en) * | 2021-07-27 | 2021-11-19 | 美库尔商务信息咨询(上海)有限公司 | Data transmission method and system for protecting advertisement multiparty privacy |
| CN113868693A (en) * | 2021-07-27 | 2021-12-31 | 朱玮 | Query method and system for privacy protection of data in anti-money laundering |
| CN113708930A (en) * | 2021-10-20 | 2021-11-26 | 杭州趣链科技有限公司 | Data comparison method, device, equipment and medium for private data |
| CN114020793A (en) * | 2021-11-11 | 2022-02-08 | 四川新网银行股份有限公司 | Method, device, equipment and storage medium for querying private data among multiple mechanisms |
| CN113962401A (en) * | 2021-11-24 | 2022-01-21 | 杭州博盾习言科技有限公司 | Federal learning system, and feature selection method and device in federal learning system |
| CN114036572A (en) * | 2021-11-29 | 2022-02-11 | 支付宝(杭州)信息技术有限公司 | Privacy intersection method and device |
Non-Patent Citations (3)
| Title |
|---|
| Towards Practical Homomorphic Encryption in Cloud Computing;Adil Bouti ect.;《2015 IEEE Fourth Symposium on Network Cloud Computing and Applications (NCCA)》;全文 * |
| 机会网络中用户属性隐私安全的高效协作者资料匹配协议;李永凯;刘树波;杨召唤;刘梦君;;通信学报(第12期);全文 * |
| 隐私保护机器学习的密码学方法;蒋瀚;刘怡然;宋祥福;王皓;郑志华;徐秋亮;;电子与信息学报;20200515(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114520721A (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114520721B (en) | Multiparty secure computing privacy exchange method, device, equipment and storage medium | |
| Elkhiyaoui et al. | CHECKER: On-site checking in RFID-based supply chains | |
| CN112508722B (en) | Policy information verification method and device based on zero knowledge proof | |
| CN114553593A (en) | Multi-party secure computation privacy intersection method, device, equipment and storage medium | |
| CN111738361A (en) | Joint training method and device for business model | |
| JP4740253B2 (en) | A secure delegation method for computing bilinear applications | |
| CN114329527A (en) | Intersection data acquisition method, equipment and system | |
| US11265166B2 (en) | Distributed machine learning via secure multi-party computation and ensemble learning | |
| CN115189878B (en) | Shared data sorting method based on secret sharing and electronic equipment | |
| CN113672949A (en) | Data transmission method and system for protecting advertisement multiparty privacy | |
| CN111241596B (en) | Block chain asset account recovery method and device | |
| CN111784337B (en) | Authority verification method and system | |
| CN111783108B (en) | Data query and calculation method and system, and storage medium | |
| CN115733602A (en) | Method and device for unbalanced privacy set intersection | |
| CN111783109B (en) | Data query method, system and storage medium | |
| CN115801253B (en) | Multi-party secret sharing method for secure multi-party calculation and electronic equipment | |
| CN110807211A (en) | Method, system, readable medium and electronic device for safely acquiring user intersection | |
| Omote et al. | An anonymous auction protocol with a single non-trusted center using binary trees | |
| CN115473633A (en) | Method and device for cooperatively generating SM2 digital signature by multiple parties | |
| CN114553395A (en) | Longitudinal federal feature derivation method in wind control scene | |
| CN110851487B (en) | Data statistics method and device | |
| Rao | Paras-A Private NFT Protocol | |
| CN115952529B (en) | User data processing method, computing device and storage medium | |
| TWI706370B (en) | Data statistics method and device | |
| WO2020200306A1 (en) | Data query and calculation method and system, and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |