CN116910818B - Data processing method, device, equipment and storage medium based on privacy protection - Google Patents

Data processing method, device, equipment and storage medium based on privacy protection Download PDF

Info

Publication number
CN116910818B
CN116910818B CN202311181317.5A CN202311181317A CN116910818B CN 116910818 B CN116910818 B CN 116910818B CN 202311181317 A CN202311181317 A CN 202311181317A CN 116910818 B CN116910818 B CN 116910818B
Authority
CN
China
Prior art keywords
data table
vector
target
initial
vector element
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
Application number
CN202311181317.5A
Other languages
Chinese (zh)
Other versions
CN116910818A (en
Inventor
宋一民
蔡超超
邹振华
单进勇
刘卓涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Shudu Technology Co ltd
Original Assignee
Beijing Shudu Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Shudu Technology Co ltd filed Critical Beijing Shudu Technology Co ltd
Priority to CN202311181317.5A priority Critical patent/CN116910818B/en
Publication of CN116910818A publication Critical patent/CN116910818A/en
Application granted granted Critical
Publication of CN116910818B publication Critical patent/CN116910818B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Medical Informatics (AREA)
  • Storage Device Security (AREA)

Abstract

The application discloses a data processing method, device and equipment based on privacy protection and a storage medium. The method comprises the following steps: acquiring a first initial data table held by a first participant; based on the associated random number of the first original data table, performing full arrangement processing on other vector elements except the first vector element in the first original data table to obtain an arranged first original data table; inserting the first vector element into a target insertion position in the arranged first initial data table to obtain an updated first initial data table; acquiring a target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second participants based on the confusing transmission protocol; and encrypting the vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table. The scheme provided by the application reduces the calculation cost and the transmission cost of privacy protection based on vector element insertion.

Description

Data processing method, device, equipment and storage medium based on privacy protection
Technical Field
The application belongs to the field of data security, and particularly relates to a data processing method, device, equipment and storage medium based on privacy protection.
Background
With the development of communication technology, information security is receiving more and more attention. In order to ensure information security, different measures are taken in different technical fields, for example, in a dynamic update scene of a secret sharing outsourced database, privacy protection needs to be performed on vector elements inserted into a data table.
For the problem of Two-way vector element insertion (Two-party Oblivious Vector Insertion) of privacy protection, it is common to set vector data (e.g., data in a data table) to be shared privately between Two parties (e.g., servers). In a scenario where the vector length of the vector data is equal, if a vector element is newly added to the vector data (for example, data is newly added to the data table), the vector data inserted with the vector element is also shared in secret between the two parties. In the process of cooperation of two participants, the plaintext information of any vector element needs to be ensured not to be revealed.
In the related art, privacy protection of vector data after inserting vector elements is generally implemented based on a full arrangement method of vector elements for privacy protection. However, the vector element full arrangement method based on privacy protection needs to generate the associated random number when the vector data changes, which increases the calculation cost and transmission cost of privacy protection.
Based on this, a privacy preserving method is needed to reduce the computation cost and transmission cost of the vector element insertion process.
Disclosure of Invention
The embodiment of the application provides a data processing method, device, equipment and storage medium based on privacy protection, which can reduce the calculation cost and transmission cost of privacy protection based on vector element insertion, thereby reducing the protection cost of privacy protection.
In a first aspect, an embodiment of the present application provides a data processing method based on privacy protection, where the method is applied to a first participant, and includes: acquiring a first initial data table, wherein the first initial data table is a data table obtained by inserting a first vector element into an initial position in a first original data table held by a first participant, and the first vector element is a secret fragment held by the first participant in a secret fragment obtained by secret sharing of newly-added data; the sum of the secret fragments held by the first participant and the secret fragments held by the second participant is newly added data; based on the associated random number corresponding to the first original data table, performing full arrangement processing on other vector elements except the first vector element in the first original data table to obtain an arranged first original data table; inserting the first vector element into a target insertion position in the arranged first initial data table, and performing position offset processing on the target insertion position in the arranged first initial data table and the vector element after the target insertion position to obtain an updated first initial data table; acquiring a target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second participants based on the confusing transmission protocol; and encrypting the vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table.
In a second aspect, an embodiment of the present application provides a data processing apparatus based on privacy protection, applied to a first party, the apparatus including: the first acquisition module is used for acquiring a first initial data table, wherein the first initial data table is a data table obtained by inserting a first vector element into an initial position in a first initial data table held by a first participant, the first vector element is a secret fragment held by the first participant in secret sharing of newly-added data; the sum of the secret fragments held by the first participant and the secret fragments held by the second participant is newly added data; the first arrangement module is used for carrying out full arrangement processing on other vector elements except the first vector element in the first initial data table based on the associated random number corresponding to the first initial data table to obtain an arranged first initial data table; the first inserting module is used for inserting the first vector element into the target inserting position in the arranged first initial data table, and carrying out position offset processing on the target inserting position in the arranged first initial data table and the vector element after the target inserting position to obtain an updated first initial data table; the key acquisition module is used for acquiring a target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second party based on the hybrid transmission protocol; the first encryption module is used for encrypting the vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table.
In a third aspect, an embodiment of the present application provides an electronic device, including: a processor and a memory storing computer program instructions; the processor when executing the computer program instructions implements the privacy preserving-based data processing method as described in the first aspect.
In a fourth aspect, an embodiment of the present application provides a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the privacy-preserving data processing method according to the first aspect.
In a fifth aspect, embodiments of the present application provide a computer program product, instructions in which, when executed by a processor of an electronic device, cause the electronic device to perform the privacy-preserving-based data processing method of the first aspect.
As can be seen from the above, in the present application, only the vector elements in the data table before the new vector elements are inserted are fully arranged in the process of adding the vector elements to the data table held by the participant. Because the data table before the new vector element is inserted is not changed, the data table can be continuously updated by using the associated random number corresponding to the data table before the new vector element is inserted, and the new associated random number does not need to be regenerated. Therefore, compared with the scheme for realizing the privacy protection of the vector data after inserting the vector elements by the vector element full arrangement method based on the privacy protection, the scheme provided by the application has lower calculation cost, thereby reducing the calculation cost of the vector element inserting method based on the privacy protection.
In addition, in the privacy protection calculation process among the multiple participants, the privacy protection among the multiple participants is realized by adopting the confusing transmission protocol, a public key is not required to be calculated, and the complexity of data transmission among the multiple participants is reduced, so that the transmission cost is reduced.
Therefore, the scheme provided by the application reduces the calculation cost and the transmission cost of privacy protection based on vector element insertion, and further reduces the protection cost of privacy protection.
Drawings
In order to more clearly illustrate the technical solution of the embodiments of the present application, the drawings that are needed to be used in the embodiments of the present application will be briefly described, and it is possible for a person skilled in the art to obtain other drawings according to these drawings without inventive effort.
FIG. 1 is a diagram illustrating vector element insertion provided by one embodiment of the present application;
FIG. 2 is a flow chart of a data processing method based on privacy protection according to an embodiment of the present application;
FIG. 3 is a diagram of a hybrid transport protocol according to one embodiment of the present application;
FIG. 4 is a schematic diagram of a data processing apparatus based on privacy protection according to another embodiment of the present application;
Fig. 5 is a schematic structural diagram of an electronic device according to another embodiment of the present application.
Detailed Description
Features and exemplary embodiments of various aspects of the present application will be described in detail below, and in order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described in further detail below with reference to the accompanying drawings and the detailed embodiments. It should be understood that the particular embodiments described herein are meant to be illustrative of the application only and not limiting. It will be apparent to one skilled in the art that the present application may be practiced without some of these specific details. The following description of the embodiments is merely intended to provide a better understanding of the application by showing examples of the application.
It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The terms that may be used in the present application are explained as follows:
(1) The two-way vector element insertion, the element insertion is performed on the vector shared between the two participants, the element to be inserted is also shared between the two participants, and the insertion site is provided by one of the participants. The process needs to ensure that the value of any element in the vector is not revealed, nor is the insertion site provided by one of the participants revealed to the other.
(2) The two-direction vector elements are fully arranged, the vector shared by the two participants is fully arranged, the full arrangement is provided by one participant, and the process needs to ensure that the value of any element in the vector is not revealed, and the full arrangement relation provided by one participant is not revealed to the other participant.
(3) Homomorphic encryption, a public key encryption technique supporting ciphertext-based operations.
(4) The protocol is a cryptographic protocol running between two parties, and the sender provides several messagesThe receiver provides a choice c and the final receiver receives +.>The sender does not receive any message.
(5) Secret sharing, dataSplitting into several secret fragments, the distribution of the values of each fragment being random, but adding up to +. >. For two-party secret sharing, will +.>Split into two secret pieces->And->Make->Wherein the data in the secret sharing state is denoted +.>。
(6) ORAM, oblivious Random Access Machine, inadvertent random Access machine, two participants respectivelyAnd->In the case of->Holding a database->Is the visitor to the database, ORAM can guarantee +.>Access records to entries of the database are not revealed to +.>I.e. the specific location of the database entry being read and written is not revealed.
For ease of understanding, the inventive concept of the solution provided by the present application will be explained first before explaining the solution provided by the present application.
Two-way vector element interpolation for privacy protectionThe input problem is set by input vector dataIn two participants->And->Secret sharing between, i.e. each vector element is split into two secret fragments, each consisting of +.>And->Holding. In vector data->Is>In the case of (1) the party is set>Providing insertion site index->The two parties cooperate to calculate such that the vector data +.>Is inserted into the original +.>The position of the vector element, original +.>The elements and the following elements are shifted backwards by one vector slot, and finally the inserted vector data is output >，/>Also need to be in +.>And->And secret sharing between.
It should be noted that the privacy protection of the process requires that the collaborative computing process cannot reveal the plaintext information of any vector element, nor reveal itProvided insertion site->。
At present, the academic world and the industry lack special solutions to the problem of vector element insertion, and a two-direction vector element full-array protocol (simply referred to as a vector element full-array protocol in the present application), a homomorphic encryption technology and an ORAM technology may solve the problem of vector element insertion, but all the three schemes have certain limitations.
For vector element full permutation protocols, vector element insertion may represent a particular vector element full permutationVector element insertion is schematically shown in fig. 1. By performing vector element insertion operations->The nth element (e.g., the last element in FIG. 1) of the vector data may be arranged to be +.>The groove is provided with +.>The individual elements to->The elements are sequentially shifted backwards by one slot, and the positions of the other elements are unchanged. Therefore, solving the problem of vector element insertion through the vector element full arrangement protocol has certain feasibility.
The execution of the vector element full-permutation protocol mainly comprises two phases, namely a preprocessing phase and an online phase, wherein the preprocessing phase generates associated random numbers for the online phase, the online phase consumes the associated random numbers, and the full-permutation operation is completed. However, this preprocessing-online computing mode requires that the full permutation performed in the online phase be assumed to be fixed, so that the associated random numbers can be prepared for multiple online computations by one preprocessing. In a practical scenario, the vector and full permutation are typically dynamic, and once the vector elements change, the associated random numbers that were not used before will no longer be applicable, and the effect of preprocessing, online computing will be compromised. Moreover, the complexity of the computational transmission overhead of the process is . Since the original purpose of designing the vector element insertion protocol is to avoid re-executing the preprocessing process of the vector element full arrangement protocol to reduce the calculation and transmission costs, the above objective cannot be achieved if the vector element insertion is completed by using the vector element full arrangement.
For homomorphic encryption techniques, participantsSecret fragments of vector elements held by it>Homomorphic encryption is performed, and then homomorphic ciphertext ++>Send to the participant->；/>Secret fragments of local vector elements +.>Homomorphic ciphertext with the received>Adding to obtain ciphertext vector->Then, element insertion is carried out on the ciphertext vector to obtain +.>。/>Local random generation->And (3) the same as->Subtracting to obtain->And sends the calculation result to +.>。/>Decryption to obtain。
Homomorphic encryption based schemes have higher computational and transmission costs. Because the scheme is to insert the ciphertext vector, each vector element needs to be encrypted independently, so that higher encryption, decryption and ciphertext addition and subtraction calculation cost are brought, and higher ciphertext-plaintext expansion ratio and transmission cost are also meant.
For ORAM technology, it can be applied to the updating of cryptographic outsourced databases. Setting up a secret sharing of a database between two servers ORAM may enable queries and updates to a single database entry without revealing the location of the operated on entry. Where database entries are organized in vector form, ORAM may ensure that update operations on a single vector element do not reveal the location of that vector element. An intuitive idea for solving the vector element insertion problem using ORAM technology is to rewrite each element in the vector based on ORAM, which may update the values of the vector elements or may remain unchanged. The transmission cost of the method isThe calculation cost is->Therefore, this scheme is not practical.
In summary, the problem of vector element insertion is intuitively solved by the related art, which has a large calculation and transmission cost, and cannot meet the requirement of the delta update vector element full arrangement, so that the method is not feasible.
In order to solve the problems in the prior art, the embodiment of the application provides a data processing method, device and equipment based on privacy protection and a storage medium. The following first describes a data processing method based on privacy protection provided by the embodiment of the present application.
The data processing method based on privacy protection provided by the embodiment of the application can be applied to a data processing system, wherein the data processing system at least comprises a data provider, a first participant and a second participant, the data provider is used for providing newly-added data and splitting the newly-added data into two secret fragments, and the split two secret fragments are acquired by the two participants in a secret sharing mode; the two parties may be devices, e.g., servers. The two participants can realize privacy protection of the data provided by the data provider through a secret sharing mode.
First, the data processing method based on privacy protection provided by the embodiment of the present application may be applied to a first participant, where the first participant may be any one of a plurality of participants included in a data processing system. Fig. 2 is a schematic flow chart of a data processing method based on privacy protection according to an embodiment of the present application. As shown in fig. 2, the method comprises the steps of:
step S201, a first initial data table is acquired.
In step S201, the first initial data table is a data table obtained after inserting the first vector element into the initial position in the first original data table held by the first participant, that is, the first initial data table is a data table held by the first participant after inserting the first vector element, and the first original data table is a data table held by the first participant before inserting the first vector element. The data table held by the first party is expressed in a vector mode, and each row of data in the data table held by the first party corresponds to one vector element in the vector.
In addition, the first vector element is a secret piece held by the first participant in the secret pieces obtained by secret sharing of the newly added data, and the sum of the secret piece held by the first participant and the secret piece held by the second participant is the newly added data.
Furthermore, after the first participant obtains the first vector element provided by the data provider, the first participant inserts the first vector element into an initial position of the first original data table, where the initial position is typically in a last row of the first original data table, that is, in a last slot of a vector corresponding to the first original data table.
In one example, in a dynamic update scenario for a secret shared outsourced database, the first party and the second party may be databases in different servers. The data provider splits the newly added data into two secret fragments and distributes the fragments to the two participants respectively, so that the first participant obtains the first vector element. The first participant then inserts the first vector element into the last row of the first original data table, resulting in the first original data table. At this time, the vector length corresponding to the data table held by the first participant is changed from n (the length of the first original data table) to n+1.
Step S202, based on the associated random number corresponding to the first original data table, performing full arrangement processing on other vector elements except the first vector element in the first original data table to obtain an arranged first original data table.
In step S202, the associated random number is generated by the first party and the second party cooperating through the preprocessing stage of the vector element full arrangement protocol, and if the initial vector held by the first party (i.e. the vector corresponding to the first original data table) is the dynamic vectorThe corresponding full arrangement is +.>The associated random number may be represented by the following formula:
（1）
in the case of the formula (1),for associating random numbers +.>And->Is->Random vectors with equal length.
As an example, if the vector is before the associated random number is usedChanges from->Become->(i.e., the vector corresponding to the first initial data table), is +.>At->A new vector obtained by adding a vector element, i.e.)>Is +.>The new element is->Correspond to->Is +.>. If the newly added vector element does not affect the whole arrangement relation of other original elements, i.e. ignore +.>When (I)>And->Equal.
That is, in step S202, the associated random number based on the preprocessingFor a pair ofPerforming full permutation to obtain a first initial data table after permutation, wherein the vector +.>For being +.>And (5) a vector formed by the vector.
In the process of adding vector elements into the data table held by the participant, the application only performs full arrangement on the vector elements in the data table before the new vector elements are inserted. Because the data table before the new vector element is inserted is not changed, the data table can be continuously updated by using the associated random number corresponding to the data table before the new vector element is inserted, and the new associated random number does not need to be regenerated. Therefore, compared with the scheme for realizing the privacy protection of the vector data after inserting the vector elements by the vector element full arrangement method based on the privacy protection, the scheme provided by the application has lower calculation cost, thereby reducing the calculation cost of the vector element inserting method based on the privacy protection.
Step S203, inserting the first vector element into the target insertion position in the arranged first initial data table, and performing position offset processing on the target insertion position in the arranged first initial data table and the vector element after the target insertion position to obtain an updated first initial data table.
In step S203, the target insertion position is k in fig. 1, and the target insertion position can be determined by sum. It can be seen that the vector element insertion to be realized by the application can be disassembled into a composite full arrangement, namelyWherein->Corresponding to step S202 for front->Full arrangement of individual elements->Corresponding to the insert operation in step S203.
Note that since the associated random numbers that have been prepared by the full permutation preprocessing are multiplexed in step S202, incremental updating of the vector (i.e., the data table) can be achieved by step S203.
Step S204, the target encryption key corresponding to the vector element in the updated first initial data table is obtained from the encryption keys provided by the second party based on the hybrid transmission protocol.
In step S204, the second party holds a second initial data table, which is a data table after inserting the second vector element into the target insertion position of the second original data table held by the second party. For newly added data The first vector element held by the first party is +.>The second vector element held by the second party is +.>Wherein->。
In one example, the second party randomly generates a length and vector locallyEqual length (i.e. containing random elements) random vector +.>. Subsequently, for->The second party calculates three random variables,, />,/>. The first party may select a random variable from the three random variables as the target encryption key using a one-out-of-three hybrid transmission protocol according to the target insertion location of the first vector element.
It is easy to note that in step S204, in the process of performing privacy protection calculation between the multiple participants, the privacy protection between the multiple participants is implemented by using the confusing transmission protocol, so that the public key is not required to be calculated, and the complexity of performing data transmission between the multiple participants is reduced, thereby reducing the transmission cost.
Step S205, encrypting vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table.
In step S205, the first party, after obtaining the target encryption key, combines the target encryption key with the local Is performed specifically by the first initial data table updated by the target encryption key pair +.>Encryption is performed to obtain a first target data table +.>The method comprises the steps of carrying out a first treatment on the surface of the Second target data table obtained by second party +.>As->Wherein the updated first initial data table +.>For being +.>And (5) a vector formed by the vector.
Based on the above-mentioned schemes defined in step S201 to step S205, it can be known that in the process of adding vector elements to the data table held by the participant, only the vector elements in the data table before the new vector elements are inserted are fully arranged. Because the data table before the new vector element is inserted is not changed, the data table can be continuously updated by using the associated random number corresponding to the data table before the new vector element is inserted, and the new associated random number does not need to be regenerated. Therefore, compared with the scheme for realizing the privacy protection of the vector data after inserting the vector elements by the vector element full arrangement method based on the privacy protection, the scheme provided by the application has lower calculation cost, thereby reducing the calculation cost of the vector element inserting method based on the privacy protection.
In addition, in the privacy protection calculation process among the multiple participants, the privacy protection among the multiple participants is realized by adopting the confusing transmission protocol, a public key is not required to be calculated, and the complexity of data transmission among the multiple participants is reduced, so that the transmission cost is reduced.
Therefore, the scheme provided by the application reduces the calculation cost and the transmission cost of privacy protection based on vector element insertion, and further reduces the protection cost of privacy protection.
The method provided by the present application is explained in detail below with reference to the hybrid transport protocol shown in fig. 3. Wherein, in figure 3,for the first party->Is the second party. As can be seen from fig. 3, the second party may provide the encryption key to the first party, which may provide the encryption key from the second party based on the transport protocol at the base of the first party,and acquiring a target encryption key corresponding to the vector element in the updated first initial data table.
Specifically, the first party firstly obtains the element position of the target vector element in the updated first initial data table, and then obtains the target encryption key corresponding to the element position from the encryption keys provided by the second party through a banel transmission protocol based on the position relation between the element position and the target insertion position.
The target vector element is any one of a plurality of vector elements included in the updated first initial data table.
In the process of acquiring a target encryption key corresponding to the element position from the encryption keys provided by the second participant through a confusing transmission protocol based on the position relation between the element position and the target insertion position, the first participant can determine a key index corresponding to the target vector element based on the position relation between the element position and the target insertion position; and then obtaining a target encryption key corresponding to the key index from the encryption keys provided by the second party through the confusing transmission protocol.
In one example, at the second partyIn the scenario of providing three encryption keys, for，/>Use of the alternative transport protocol from the second party +.>One of the provided plurality of encryption keys is selected as a target encryption key, wherein the calculation mode of the key index of the three selected encryption keys is shown in the formula 2:
（2）
in the formula (2), c is a key index, k is a target insertion position, and i is a position of a target vector element in the updated first initial data table; 0. 1, 2 correspond to three encryption keys provided by the second party, respectively.
In the application, the process of indexing the three-one key is converted into the two parallel two-one key so as to improve the efficiency of the key indexing.
Specifically, a first party first determines an index array corresponding to a key index, and then obtains a target encryption key corresponding to the index array from encryption keys provided by a second party through a hybrid transmission protocol, wherein the target encryption key is composed of key elements contained in a plurality of key arrays.
In one example, the second party is set upThe three encryption keys provided are +.>Second party->Generating random numbers +.>. The first array corresponding to the first alternative encryption key is +.>The second array corresponding to the second alternative encryption key is +.>. First participant->The corresponding index array may be expressed as +.>The calculation mode is as follows:
（3）
in equation 3, when c=0,，/>at this time, the target encryption key is composed of the first element in the first array and the second element in the second array, i.e., the target encryption key is +.>The method comprises the steps of carrying out a first treatment on the surface of the c=1, < >>，/>At this time, the target encryption key is composed of the second element in the first array and the first element in the second array, i.e., the target encryption key is +. >The method comprises the steps of carrying out a first treatment on the surface of the c=2, < >>，/>At this time, the target encryption key is composed by default of the second element in the second array, i.e., the target encryption key is +.>。
In one example, the target encryption key is determined by the second party from an encryption key array based on a confusing transmission protocol, the encryption key array is generated by a second initial data table held by the second party and a second target data table, the second initial data table is a secret fragment obtained by secret sharing of the newly added data, and the second party holds the secret fragment; the second target data table is obtained by randomly sampling the second initial data table.
I.e. the second partyLocal random generation of a length sum +.>Equal length (i.e. comprising->Individual random elements) random vector +.>The random vector->Namely, the vector corresponding to the second target data table. Wherein the random vector->The sampling range of each element in (a) is the ring where the secret sharing fragments are located (+.>) Namely, the second initial data table is randomly sampled to obtain a random vector +.>。
In the present application, the encryption key array includes at least a first key element, a second key element, and a third key element. The first key element is obtained by the second party by calculating the difference between a first initial vector element and a second initial vector element, wherein the first initial vector element is a vector element corresponding to a first element position in a second initial data table, the second initial vector element is a vector element corresponding to the first element position, and the first element position is any element position in the second initial data table; the second key element is obtained by the second party by calculating the difference between a third initial vector element and a second initial vector element, wherein the third initial vector element is a vector element corresponding to the last element position of the first element position in the second initial data table, and the first element position is a non-initial position in the second initial data table; the third key element is obtained by the second party by calculating the difference between a fourth initial vector element and a second initial vector element, wherein the fourth initial vector element is a vector element corresponding to the target insertion position in the second initial data table.
In one example, as shown in FIG. 3, the first key element isThe second key element isThe third key element is +.>. Wherein, when->When (I)>. The three key elements correspond to the +.>。
In one example, the encryption key array includes at least a first array, a second array, the first array composed of first elements and second elements, the second array composed of target random numbers and third key elements; the target random number m is randomly generated by the second party, the first element is the difference between the first key element and the target random number, and the second element is the difference between the second key element and the target random number. I.e. the first array isThe second array corresponding to the second alternative encryption key is +.>。
After the target encryption key is determined, forFirst party->The updated first initial data table is +.>Encryption is carried out to obtain a first target data table +.>Wherein->From the following componentsThe composition is as follows:
for the followingSecond party->Will->Set to->I.e. the second target data table is。
From the above, the scheme provided by the application can perform incremental update on the vector element full arrangement protocol so as to maximally reuse the existing associated random number when the vector element and the full arrangement are changed. Specifically, the application converts the incremental updating process into the problem of inserting two vector elements of privacy protection, and designs an efficient vector element inserting protocol which has lower calculation cost and transmission cost compared with the process of re-executing full-arrangement preprocessing calculation, thereby solving the limitation of the existing full-arrangement protocol of vector elements based on a preprocessing-online calculation mode and enabling the full-arrangement protocol to support dynamic vectors and full arrangement. In addition, the scheme provided by the application can be applied to application scenes with similar privacy calculation requirements, for example, the scene of dynamic update of the outsourced database of secret sharing.
Compared with the prior art, the scheme provided by the application has at least the following advantages:
(1) Less computational cost. Compared with the technical scheme based on homomorphic encryption, the scheme provided by the application does not depend on public key cryptography calculation and only depends on symmetric cryptography (OT) calculation, so that the scheme has lower calculation cost; compared with the scheme that the vector element full arrangement protocol or the ORAM protocol is used for completing the vector element insertion, the scheme provided by the application realizes the optimization on the calculation complexity, namely the calculation complexity of the scheme provided by the application is thatWhile the complexity of the vector element full arrangement isThe ORAM protocol performs vector element insertion with a complexity of +.>。
(2) Low transmission cost. Since the scheme based on homomorphic encryption needs to use public key cryptography for calculation, a larger ciphertext-plaintext expansion ratio exists, and accordingly, the scheme is brought aboutThe transmission cost is relatively high; the transmission complexity for completing the vector element insertion based on the vector element full arrangement protocol and the ORAM protocol is. In contrast, the transmission complexity of the scheme provided by the application is thatAnd because of using the symmetrical cipher, there is no cipher text-plaintext expansion ratio, therefore, the scheme provided by the application has obvious advantage in terms of transmission cost.
In summary, the scheme provided by the application makes it possible to incrementally update the vector element full permutation protocol with the calculation and transmission overhead of its linear complexity, i.e. has lower calculation cost and transmission cost compared with the calculation process of re-executing full permutation preprocessing.
The embodiment of the application also provides a data processing device based on privacy protection, as shown in fig. 4, the device comprises: a first acquisition module 401, a first arrangement module 402, a first insertion module 403, a key acquisition module 404, and a first encryption module 405.
The first obtaining module 401 is configured to obtain a first initial data table, where the first initial data table is a data table obtained by inserting a first vector element into an initial position in a first original data table held by a first participant, and the first vector element is a secret fragment held by the first participant in a secret fragment obtained by secret sharing of the newly added data; the sum of the secret fragments held by the first participant and the secret fragments held by the second participant is newly added data; the first permutation module 402 is configured to perform a full permutation process on other vector elements except the first vector element in the first initial data table based on the associated random number corresponding to the first initial data table, to obtain a permuted first initial data table; a first inserting module 403, configured to insert a first vector element into a target insertion position in the arranged first initial data table, and perform a position offset process on the target insertion position in the arranged first initial data table and the vector element after the target insertion position, to obtain an updated first initial data table; a key obtaining module 404, configured to obtain, from the encryption keys provided by the second party, a target encryption key corresponding to the vector element in the updated first initial data table based on the hybrid transmission protocol; the first encryption module 405 is configured to encrypt the vector elements in the updated first initial data table based on the target encryption key, so as to obtain a first target data table.
As described above, in the present application, only the vector elements in the data table before the new vector elements are inserted are fully arranged in the process of adding the new vector elements to the data table held by the participant. Because the data table before the new vector element is inserted is not changed, the data table can be continuously updated by using the associated random number corresponding to the data table before the new vector element is inserted, and the new associated random number does not need to be regenerated. Therefore, compared with the scheme for realizing the privacy protection of the vector data after inserting the vector elements by the vector element full arrangement method based on the privacy protection, the scheme provided by the application has lower calculation cost, thereby reducing the calculation cost of the vector element inserting method based on the privacy protection.
In addition, in the privacy protection calculation process among the multiple participants, the privacy protection among the multiple participants is realized by adopting the confusing transmission protocol, a public key is not required to be calculated, and the complexity of data transmission among the multiple participants is reduced, so that the transmission cost is reduced.
Therefore, the scheme provided by the application reduces the calculation cost and the transmission cost of privacy protection based on vector element insertion, and further reduces the protection cost of privacy protection.
In one example, the key acquisition module includes: the first acquisition module and the second acquisition module. The first acquisition module is used for acquiring the element positions of the target vector elements in the updated first initial data table, wherein the target vector elements are any one of a plurality of vector elements contained in the updated first initial data table; and the second acquisition module is used for acquiring the target encryption key corresponding to the element position from the encryption keys provided by the second participant through a confusing transmission protocol based on the position relation between the element position and the target insertion position.
In one example, the second acquisition module includes: the index determining module and the third obtaining module. The index determining module is used for determining a key index corresponding to the target vector element based on the position relation between the element position and the target insertion position; and the third acquisition module is used for acquiring the target encryption key corresponding to the key index from the encryption keys provided by the second party through the hybrid transmission protocol.
In one example, the third acquisition module includes: an array determining module and a fourth obtaining module. The array determining module is used for determining an index array corresponding to the key index; and a fourth obtaining module, configured to obtain, from the encryption keys provided by the second party, a target encryption key corresponding to the index array through a hybrid transmission protocol, where the target encryption key is composed of key elements included in the plurality of key arrays.
In one example, the target encryption key is determined by the second party from an encryption key array based on a confusing transmission protocol, the encryption key array is generated by a second initial data table held by the second party and a second target data table, the second initial data table is a secret fragment obtained by secret sharing of the newly added data, and the second party holds the secret fragment; the second target data table is obtained by randomly sampling the second initial data table.
In one example, the encryption key array includes at least a first key element, a second key element, a third key element;
the first key element is obtained by the second party by calculating the difference between a first initial vector element and a second initial vector element, wherein the first initial vector element is a vector element corresponding to a first element position in a second initial data table, the second initial vector element is a vector element corresponding to the first element position, and the first element position is any element position in the second initial data table;
the second key element is obtained by the second party by calculating the difference between a third initial vector element and a second initial vector element, wherein the third initial vector element is a vector element corresponding to the last element position of the first element position in the second initial data table, and the first element position is a non-initial position in the second initial data table;
The third key element is obtained by the second party by calculating the difference between a fourth initial vector element and a second initial vector element, wherein the fourth initial vector element is a vector element corresponding to the target insertion position in the second initial data table.
In one example, the encryption key array includes at least a first array, a second array, the first array composed of first elements and second elements, the second array composed of target random numbers and third key elements; the target random number is randomly generated by the second party, the first element is the difference between the first key element and the target random number, and the second element is the difference between the second key element and the target random number.
The data processing device based on privacy protection provided by the embodiment of the application can realize each process realized by the foregoing method embodiment, and in order to avoid repetition, the description is omitted here.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a software functional unit. In addition, the specific names of the functional units and modules are only for distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.
Fig. 5 shows a schematic hardware structure of an electronic device according to an embodiment of the present application.
The electronic device may include a processor 501 and a memory 502 storing computer program instructions.
In particular, the processor 501 may include a Central Processing Unit (CPU), or an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or may be configured as one or more integrated circuits that implement embodiments of the present application.
Memory 502 may include mass storage for data or instructions. By way of example, and not limitation, memory 502 may comprise a Hard Disk Drive (HDD), floppy Disk Drive, flash memory, optical Disk, magneto-optical Disk, magnetic tape, or universal serial bus (Universal Serial Bus, USB) Drive, or a combination of two or more of the foregoing. Memory 502 may include removable or non-removable (or fixed) media, where appropriate. Memory 502 may be internal or external to the integrated gateway disaster recovery device, where appropriate. In a particular embodiment, the memory 502 is a non-volatile solid state memory.
The memory may include Read Only Memory (ROM), random Access Memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. Thus, in general, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software comprising computer-executable instructions and when the software is executed (e.g., by one or more processors) it is operable to perform the operations described with reference to methods in accordance with aspects of the present disclosure.
The processor 501 reads and executes the computer program instructions stored in the memory 502 to implement any one of the privacy-preserving-based data processing methods of the above embodiments.
In one example, the electronic device may also include a communication interface 503 and a bus 510. As shown in fig. 5, the processor 501, the memory 502, and the communication interface 503 are connected to each other by a bus 510 and perform communication with each other.
The communication interface 503 is mainly used to implement communication between each module, apparatus, unit and/or device in the embodiments of the present application.
Bus 510 includes hardware, software, or both that couple components of the electronic device to one another. By way of example, and not limitation, the buses may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an infiniband interconnect, a Low Pin Count (LPC) bus, a memory bus, a micro channel architecture (MCa) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a video electronics standards association local (VLB) bus, or other suitable bus, or a combination of two or more of the above. Bus 510 may include one or more buses, where appropriate. Although embodiments of the application have been described and illustrated with respect to a particular bus, the application contemplates any suitable bus or interconnect.
In addition, in combination with the privacy protection-based data processing method in the above embodiment, the embodiment of the present application may be implemented by providing a computer readable storage medium. The computer readable storage medium has stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement any of the privacy preserving-based data processing methods of the above embodiments.
In addition, in combination with the privacy protection-based data processing method in the above embodiment, the embodiment of the present application may be implemented by providing a computer program product. The instructions in the computer program product, when executed by a processor of an electronic device, cause the electronic device to perform a data processing method implementing any of the above embodiments based on privacy protection.
It should be understood that the application is not limited to the particular arrangements and instrumentality described above and shown in the drawings. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method processes of the present application are not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between steps, after appreciating the spirit of the present application.
The functional blocks shown in the above-described structural block diagrams may be implemented in hardware, software, firmware, or a combination thereof. When implemented in hardware, it may be, for example, an electronic circuit, an Application Specific Integrated Circuit (ASIC), suitable firmware, a plug-in, a function card, or the like. When implemented in software, the elements of the application are the programs or code segments used to perform the required tasks. The program or code segments may be stored in a machine readable medium or transmitted over transmission media or communication links by a data signal carried in a carrier wave. A "machine-readable medium" may include any medium that can store or transfer information. Examples of machine-readable media include electronic circuitry, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio Frequency (RF) links, and the like. The code segments may be downloaded via computer networks such as the internet, intranets, etc.
It should also be noted that the exemplary embodiments mentioned in this disclosure describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above-described steps, that is, the steps may be performed in the order mentioned in the embodiments, or may be performed in a different order from the order in the embodiments, or several steps may be performed simultaneously.
Aspects of the present disclosure are described above with reference to flowchart illustrations and/or block diagrams of privacy-based data processing methods, apparatus, devices, and storage media according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions/acts specified in the flowchart and/or block diagram block or blocks. Such a processor may be, but is not limited to being, a general purpose processor, a special purpose processor, an application specific processor, or a field programmable logic circuit. It will also be understood that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware which performs the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In the foregoing, only the specific embodiments of the present application are described, and it will be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the systems, modules and units described above may refer to the corresponding processes in the foregoing method embodiments, which are not repeated herein. It should be understood that the scope of the present application is not limited thereto, and any equivalent modifications or substitutions can be easily made by those skilled in the art within the technical scope of the present application, and they should be included in the scope of the present application.

Claims (10)

1. A data processing method based on privacy protection, applied to a first party, the method comprising:
acquiring a first initial data table, wherein the first initial data table is a data table obtained by inserting a first vector element into an initial position in a first original data table held by the first participant, the first vector element is a secret fragment obtained by secret sharing of newly-added data, and the secret fragment held by the first participant; the sum of the secret fragments held by the first participant and the secret fragments held by the second participant is the newly added data;
based on the associated random number corresponding to the first original data table, performing full arrangement processing on other vector elements except the first vector element in the first original data table to obtain an arranged first original data table;
inserting the first vector element into a target insertion position in the arranged first initial data table, and performing position offset processing on the target insertion position and the vector element after the target insertion position in the arranged first initial data table to obtain an updated first initial data table;
Acquiring a target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second participants based on a confusing transmission protocol;
and encrypting the vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table.
2. The method of claim 1, wherein obtaining the target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second party based on the hybrid transport protocol comprises:
acquiring element positions of target vector elements in the updated first initial data table, wherein the target vector elements are any one of a plurality of vector elements contained in the updated first initial data table;
and acquiring a target encryption key corresponding to the element position from encryption keys provided by the second party through the hybrid transmission protocol based on the position relation between the element position and the target insertion position.
3. The method of claim 2, wherein obtaining, via the native transport protocol, a target encryption key corresponding to the element location from encryption keys provided by the second party based on a positional relationship between the element location and the target insertion location, comprises:
Determining a key index corresponding to the target vector element based on a positional relationship between the element position and the target insertion position;
and acquiring a target encryption key corresponding to the key index from the encryption keys provided by the second party through the confusing transmission protocol.
4. The method of claim 3, wherein obtaining, via the confusing transmission protocol, a target encryption key corresponding to the key index from among the encryption keys provided by the second party, comprises:
determining an index array corresponding to the key index;
and acquiring a target encryption key corresponding to the index array from the encryption keys provided by the second party through the confusing transmission protocol, wherein the target encryption key consists of key elements contained in a plurality of key arrays.
5. The method of claim 4, wherein the target encryption key is determined by the second party based on the confusing transmission protocol from an encryption key array generated from a second initial data table and a second target data table held by the second party, the second initial data table being among secret fragments obtained by secret sharing of the newly added data, the secret fragments held by the second party; the second target data table is obtained by randomly sampling the second initial data table.
6. The method of claim 5, wherein the encryption key array comprises at least a first key element, a second key element, and a third key element;
the first key element is obtained by the second party by calculating the difference between a first initial vector element and a second initial vector element, wherein the first initial vector element is a vector element corresponding to a first element position in the second initial data table, the second initial vector element is a vector element corresponding to the first element position, and the first element position is any element position in the second initial data table;
the second key element is obtained by the second party by calculating the difference between a third initial vector element and the second initial vector element, wherein the third initial vector element is a vector element corresponding to the last element position of the first element position in the second initial data table, and the first element position is a non-initial position in the second initial data table;
the third key element is obtained by the second party by calculating the difference between a fourth initial vector element and the second initial vector element, wherein the fourth initial vector element is a vector element corresponding to the target insertion position in the second initial data table.
7. The method of claim 6, wherein the encryption key array comprises at least a first array, a second array, the first array consisting of a first element and a second element, the second array consisting of a target random number and the third key element;
the target random number is randomly generated by the second party, the first element is the difference between the first key element and the target random number, and the second element is the difference between the second key element and the target random number.
8. A privacy protection-based data processing apparatus for application to a first party, the apparatus comprising:
the first acquisition module is used for acquiring a first initial data table, wherein the first initial data table is a data table obtained by inserting a first vector element into an initial position in a first original data table held by the first participant, the first vector element is a secret fragment obtained by secret sharing of newly added data, and the secret fragment held by the first participant; the sum of the secret fragments held by the first participant and the secret fragments held by the second participant is the newly added data;
The first arrangement module is used for carrying out full arrangement processing on other vector elements except the first vector elements in the first initial data table based on the associated random number corresponding to the first initial data table to obtain an arranged first initial data table;
the first inserting module is used for inserting the first vector element into a target inserting position in the arranged first initial data table, and performing position offset processing on the target inserting position and the vector element after the target inserting position in the arranged first initial data table to obtain an updated first initial data table;
the key acquisition module is used for acquiring a target encryption key corresponding to the vector element in the updated first initial data table from the encryption keys provided by the second participants based on a hybrid transmission protocol;
and the first encryption module is used for encrypting the vector elements in the updated first initial data table based on the target encryption key to obtain a first target data table.
9. An electronic device, characterized in that the electronic device comprises: a processor and a memory storing computer program instructions;
The processor, when executing the computer program instructions, implements a privacy-preserving-based data processing method as claimed in any one of claims 1 to 7.
10. A computer-readable storage medium, on which computer program instructions are stored which, when executed by a processor, implement a privacy-based data processing method as claimed in any one of claims 1 to 7.
CN202311181317.5A 2023-09-13 2023-09-13 Data processing method, device, equipment and storage medium based on privacy protection Active CN116910818B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311181317.5A CN116910818B (en) 2023-09-13 2023-09-13 Data processing method, device, equipment and storage medium based on privacy protection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311181317.5A CN116910818B (en) 2023-09-13 2023-09-13 Data processing method, device, equipment and storage medium based on privacy protection

Publications (2)

Publication Number Publication Date
CN116910818A CN116910818A (en) 2023-10-20
CN116910818B true CN116910818B (en) 2023-11-21

Family

ID=88367270

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311181317.5A Active CN116910818B (en) 2023-09-13 2023-09-13 Data processing method, device, equipment and storage medium based on privacy protection

Country Status (1)

Country Link
CN (1) CN116910818B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3264669A1 (en) * 2016-06-30 2018-01-03 Huawei Technologies Co., Ltd. System and method for searching over encrypted data using homomorphic encryption
CN108521326A (en) * 2018-04-10 2018-09-11 电子科技大学 A kind of Linear SVM model training algorithm of the secret protection based on vectorial homomorphic cryptography
CN112632602A (en) * 2020-12-18 2021-04-09 平安科技（深圳）有限公司 Block chain coin mixing method and device, terminal and storage medium
CN112737772A (en) * 2020-12-25 2021-04-30 山东师范大学 Security statistical method, terminal device and system for private set intersection data
CN114282688A (en) * 2022-03-02 2022-04-05 支付宝(杭州)信息技术有限公司 Two-party decision tree training method and system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3264669A1 (en) * 2016-06-30 2018-01-03 Huawei Technologies Co., Ltd. System and method for searching over encrypted data using homomorphic encryption
CN108521326A (en) * 2018-04-10 2018-09-11 电子科技大学 A kind of Linear SVM model training algorithm of the secret protection based on vectorial homomorphic cryptography
CN112632602A (en) * 2020-12-18 2021-04-09 平安科技（深圳）有限公司 Block chain coin mixing method and device, terminal and storage medium
CN112737772A (en) * 2020-12-25 2021-04-30 山东师范大学 Security statistical method, terminal device and system for private set intersection data
CN114282688A (en) * 2022-03-02 2022-04-05 支付宝(杭州)信息技术有限公司 Two-party decision tree training method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种隐私保护的可逆布鲁姆过滤器;谢鲲;施文;;计算机工程与科学(06);全文 *

Also Published As

Publication number Publication date
CN116910818A (en) 2023-10-20

Similar Documents

Publication Publication Date Title
Zhang et al. DeepPAR and DeepDPA: privacy preserving and asynchronous deep learning for industrial IoT
CN108418686B (en) Multi-distributed SM9 decryption method and medium, and key generation method and medium
CN109088726B (en) SM2 algorithm-based collaborative signing and decrypting method and system for two communication parties
US20210243005A1 (en) Fully homomorphic encryption method and device and computer readable storage medium
WO2014109828A2 (en) Method for secure substring search
Cao et al. Related-key differential cryptanalysis of the reduced-round block cipher GIFT
Zong et al. Towards key-recovery-attack friendly distinguishers: application to GIFT-128
CN116324778A (en) Updatable private collection intersections
CN116204909A (en) Vector element mapping method, electronic device and computer readable storage medium
CN116633526B (en) Data processing method, device, equipment and medium
CN111798236B (en) Transaction data encryption and decryption methods, devices and equipment
CN116910818B (en) Data processing method, device, equipment and storage medium based on privacy protection
CN115765969B (en) Method, device and storage medium for solving interaction of hidden set based on homomorphic encryption
CN115828310B (en) Data query method and device based on privacy calculation and storage medium
CN104601323B (en) Solves the method for socialism millionaires&#39; problem based on BDD
Deepthi et al. Cryptanalysis for reduced round Salsa and ChaCha: revisited
CN115422579A (en) Data encryption storage and query method and system after storage
Goumidi et al. Hybrid chaos-based image encryption approach using block and stream ciphers
CN115426111A (en) Data encryption method and device, electronic equipment and storage medium
CN114465708A (en) Private data processing method, device, system, electronic equipment and storage medium
CN116915405B (en) Data processing method, device, equipment and storage medium based on privacy protection
CN112836239A (en) Method and device for cooperatively determining target object data by two parties for protecting privacy
CN116956354B (en) Data query method, device, data source equipment, query party equipment and system
Liu et al. Improved impossible differential attack on reduced version of Camellia with FL/FL− 1 functions
CN115801234B (en) Data inadvertent transmission method based on state secret

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