Privacy set intersection method, system, device and equipment and storage medium

By mapping the encrypted set data into set vectors for intersection calculation, the problem of low interception efficiency in the prior art is solved, processing efficiency and security are improved, and communication resource occupation is reduced.

CN119071002APending Publication Date: 2024-12-03JINGDONG TECH HLDG CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310605512.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-25
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

The existing privacy set interception method is relatively low, the calculation complexity of public key encryption method is high, and the communication resources are occupied by a large number of inadvertent transmission methods, resulting in inefficient efficiency.

Method used

By mapping the encrypted set data into a set vector, transmitting it to the computing node for intersection calculation, and returning the intersection vector, the data node parses the intersection data, reducing the amount of calculation and communication data, and avoiding multiple data transmissions.

Benefits of technology

It improves the processing efficiency of privacy collection interception, saves communication resources, enhances data security, and ensures data security without leakage.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119071002A_ABST
    Figure CN119071002A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of data processing, in particular to a privacy set intersection method, system and device, equipment and a storage medium. The privacy set intersection method taking the data node as the execution main body comprises the following steps: acquiring encrypted set data to be processed; mapping the encrypted set data into a set vector corresponding to the encrypted set data; the set vectors are transmitted to a computing node, and the computing node is used for obtaining the set vectors transmitted by the at least two data nodes respectively and intersecting the at least two set vectors to obtain an intersection vector; obtaining an intersection vector returned by the computational node; and analyzing the intersection vector to obtain intersection data. The method and device are used for solving the problem that in the prior art, the privacy set intersection efficiency is low.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of data processing technology, and in particular to a privacy set intersection method, system, device, equipment and storage medium. Background Art

[0002] Private set intersection (PSI) refers to two parties holding their own sets jointly calculating the common intersection of two sets. After the calculation is completed, one or both parties can obtain the correct intersection, and will not obtain any information from the other party's set other than the intersection. Currently, public key encryption and oblivious transmission are commonly used to implement private set intersection protocols. However, the public key encryption method will generate a large amount of modular exponentiation operations on big data, which has a high computational complexity and leads to low efficiency in private set intersection. The oblivious transmission method splits the original data into multiple bit data strings, and then each bit data string needs to be transmitted separately multiple times, which takes up a lot of communication resources and also leads to low efficiency in private set intersection. Summary of the invention

[0003] The present disclosure provides a privacy set intersection method, system, device, equipment and storage medium to solve the defect of low privacy set intersection efficiency in the prior art.

[0004] The present disclosure provides a privacy set intersection method, which is applied to any one of at least two data nodes, including: obtaining encrypted set data to be processed; mapping the encrypted set data to a set vector corresponding to the encrypted set data; transmitting the set vector to a computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two of the data nodes respectively, and to intersect at least two of the set vectors to obtain an intersection vector; obtaining the intersection vector returned by the computing node; and parsing the intersection vector to obtain intersection data.

[0005] According to a privacy set intersection method provided by the present disclosure, the obtaining of the encrypted set data to be processed includes: obtaining a negotiation key, and obtaining the original set data stored by the data node, wherein the negotiation key is a key obtained by negotiation between at least two of the data nodes; and encrypting the original set data by using the negotiation key to obtain the encrypted set data.

[0006] According to a privacy set intersection method provided by the present disclosure, the encrypted set data is mapped to a set vector corresponding to the encrypted set data, including: based on a preset vector length, mapping the encrypted set data to an initial vector, wherein the initial vector is a bit vector generated based on the mapping of the encrypted set data; obtaining a random vector, wherein the random vector is a randomly generated bit vector; and performing XOR processing on the initial vector and the random vector to obtain the set vector corresponding to the encrypted set data.

[0007] According to a privacy set intersection method provided by the present disclosure, the obtaining of a random vector includes: when the data node is a randomly determined starting data node, based on the initial vector, generating the random vector having the same length as the initial vector; and distributing the random vector to each of the data nodes related to the computing node.

[0008] The present disclosure also provides a privacy set intersection method, which is applied to a computing node, including: obtaining set vectors respectively transmitted by at least two data nodes; intersecting at least two of the set vectors to obtain an intersection vector; returning the intersection vector to each of the data nodes intersected; wherein the data node is used to obtain encrypted set data to be processed, map the encrypted set data to a set vector corresponding to the encrypted set data, transmit the set vector to a computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain intersection data.

[0009] According to a privacy set intersection method provided by the present disclosure, the intersection of at least two set vectors to obtain an intersection vector includes: performing AND processing on at least two set vectors to obtain the intersection vector.

[0010] The present disclosure also provides a privacy set intersection system, including a computing node and at least two data nodes; the data node is used to obtain encrypted set data to be processed; the encrypted set data is mapped to a set vector corresponding to the encrypted set data; the set vector is transmitted to the computing node; the intersection vector is obtained returned by the computing node; the intersection vector is parsed to obtain intersection data; the computing node is used to obtain set vectors respectively transmitted by at least two data nodes; the at least two set vectors are intersected to obtain an intersection vector; and the intersection vector is returned to each of the data nodes intersected.

[0011] The present disclosure also provides a data node device for privacy set intersection, including: a first acquisition module, used to obtain encrypted set data to be processed; a vectorization module, used to map the encrypted set data into a set vector corresponding to the encrypted set data; a transmission module, used to transmit the set vector to a computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two of the data nodes respectively, and to intersect at least two of the set vectors to obtain an intersection vector; a second acquisition module, used to obtain the intersection vector returned by the computing node; and a parsing module, used to parse the intersection vector to obtain intersection data.

[0012] The present disclosure also provides a computing node device for privacy set intersection, including: a third acquisition module, used to obtain set vectors transmitted respectively by at least two data nodes; an intersection module, used to intersect at least two of the set vectors to obtain an intersection vector; a return module, used to return the intersection vector to each of the data nodes for intersection; wherein the data node is used to obtain encrypted set data to be processed, map the encrypted set data to a set vector corresponding to the encrypted set data, transmit the set vector to a computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain intersection data.

[0013] The present disclosure also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the privacy set intersection method described in any one of the above methods is implemented.

[0014] The present disclosure also provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the privacy set intersection method described in any one of the above methods is implemented.

[0015] The privacy set intersection method, system, device, equipment and storage medium provided by the present disclosure are that the data node maps the encrypted set data to be processed into a set vector, and then transmits the set vector to the computing node. The computing node intersects the set vectors transmitted by at least two data nodes respectively, obtains the intersection vector, and returns the intersection vector to each data node for intersection. After the data node obtains the intersection vector, it parses and obtains the intersection data. In the above process, the data node vectorizes the encrypted set data and transmits the set vector to the computing node for vector intersection, which reduces the amount of data for intersection calculation and improves the processing efficiency of privacy set intersection. At the same time, what is transmitted between the data node and the computing node is the set vector and the intersection vector, and the amount of data transmission is reduced; and in one set intersection process, there is no need to perform three or more data transmissions between the data node and the computing node, which saves communication resources and further improves the processing efficiency of privacy set intersection. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present disclosure or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0017] Figure 1 It is a schematic diagram of the principle of the PSI protocol based on public key encryption provided by the present disclosure;

[0018] Figure 2 is a schematic diagram of the principle of the PSI protocol based on oblivious transfer provided by the present disclosure;

[0019] Figure 3 It is a schematic diagram of the process steps implemented by the data node during the implementation of the privacy set intersection method provided by the present disclosure;

[0020] Figure 4 is an example diagram of vector confusion intersection provided by the present disclosure;

[0021] Figure 5 It is a schematic diagram of the process steps implemented by the computing nodes in the process of implementing the privacy set intersection method provided by the present disclosure;

[0022] Figure 6 It is a schematic diagram of the structure of the privacy set intersection system provided by the present disclosure;

[0023] Figure 7 This is a specific principle example diagram of the privacy set intersection system provided by the present disclosure;

[0024] Figure 8 It is a structural schematic diagram of a data node device for privacy set intersection provided by the present disclosure;

[0025] Fig. 9 It is a structural schematic diagram of a computing node device for privacy set intersection provided by the present disclosure;

[0026] Fig.10 It is a schematic diagram of the structure of an electronic device provided by the present disclosure. DETAILED DESCRIPTION

[0027] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, rather than all of the embodiments. Based on the embodiments in the embodiments of the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the embodiments of the present disclosure.

[0028] The implementation methods of private set intersection (PSI) mainly include public key encryption and oblivious transmission. The following is a detailed analysis of the two methods:

[0029] First, the PSI protocol based on public key encryption.

[0030] Taking the RSA protocol as an example, the PSI protocol of public key encryption is introduced. The RSA protocol was proposed by Ronald Rivest, Adi Shamir and Leonard Adleman and is an asymmetric encryption algorithm named after the surnames of the three people.

[0031] like Figure 1 As shown, institution A and institution B represent two parties that need to perform privacy set intersection.

[0032] Step 1: Institution B sends the public key (E, N) to Institution A; Institution A uses the public key E to encrypt the random number r to generate Y A , the calculation formula is as follows:

[0033] Y A =r E *Hash(A ID );

[0034] Among them, A ID It represents the identity of institution A; Hash represents the hash value; r represents a random number.

[0035] Step 2: Institution A calculates Y A Then send it to institution B. Institution B uses private key D to A To decrypt, the calculation formula is as follows:

[0036] Z A =(Y A ) D =r*Hash(A ID ) D ;

[0037] Where D stands for decryption.

[0038] At the same time, institution B decrypts the hash value of institution B’s identity to generate Z B , the calculation formula is as follows:

[0039] Z B =Hash(B ID ) D ;

[0040] Among them, B ID Indicates the identity of institution B.

[0041] Step 3: Institution B will A and Z B Sent to Institution A.

[0042] Institution A based on Z A Eliminate the random number r and get D A , the calculation formula is as follows:

[0043] D A =Z A / r;

[0044] Then based on D A With Z B Perform set intersection to obtain the ciphertext intersection I, and the calculation formula is as follows:

[0045] I=D A ∩Z B ;

[0046] Step 4: After institution A obtains the ciphertext intersection I, it sends the ciphertext intersection I to institution B.

[0047] In the above process, the Y sent in step 2 A It is generated by encrypting the public key E of organization B. To ensure security, the secret key length of the public key needs to be more than 2048 bits. The length of the generated ciphertext is also close to 2048 bits. Therefore, Y A is a very large ciphertext set, Z A , Z B Therefore, a large amount of modular exponentiation operations of big data will be generated here, with high computational complexity and requiring a high degree of computational assistance.

[0048] Second, the PSI protocol based on oblivious transfer.

[0049] Taking the oblivious transfer (OT) provided by the KKRT16 development tool as an example, the PSI protocol of oblivious transfer is introduced.

[0050] like Figure 2As shown in the figure, institution A and institution B represent two parties that need to intersect their privacy sets. Institution A sends local original data (X, {H 1 , H 2 , ..., H h}), hash processing is performed according to the preset β (represented by hashing), where X, H 1 , H 2 , ..., H h represents different original data elements, and β represents the number of bin files. If the hashed data set T 1 Any data bucket T 1 [i] If there is a null value, fill it with a random number, up to max β values, where i is a positive integer and max β It is a value preset according to the number of local original data and β.

[0051] Organization A traverses each data bucket and splits the original value contained in each data bucket into t μbit data substrings, namely:

[0052] v=T1[i][1]‖...‖T1[i][t];

[0053] Among them, v represents the data substring after splitting.

[0054] Institution B sends local original data (Y, {H 1 , H 2 , ..., H h}), hash processing is performed according to the preset β (represented by hashing), where Y, H 1 , H 2 , ..., H h represents different original data elements, and β represents the number of bin files. If the hashed data set T 2 Any data bucket T 2 [i] If there is a null value, fill it with a random number, up to max β values, where i is a positive integer and max β It is a value preset according to the number of local original data and β.

[0055] Organization B traverses each data bucket and splits the original value contained in each data bucket into t μbit data substrings, where μ represents the number of bits occupied by each data substring, that is:

[0056] w=T2[i][1]‖...‖T1[i][t];

[0057] Among them, v represents the data substring after splitting.

[0058] For any data bucket, institution B transmits the kth data substring w[k] to institution A to execute the OT algorithm, where N=2 μ . Wherein, k takes values ​​from 1 to t one by one.

[0059] OT algorithm is executed to obtain the result m 1 [k],……,m N [k] is transmitted to institution A; the OT algorithm is executed to obtain the result m wk [k] is transmitted to institution B.

[0060] Institution A performs the following calculation:

[0061]

[0062]

[0063] Among them, vk takes values ​​from 1 to N one by one, and j traverses from 1 to max β , and finally we get the (Let) data set V, where dummmy represents a null value.

[0064] Institution A randomly arranges the data in data set V and transmits it to institution B.

[0065] Institution B performs the following calculations:

[0066]

[0067] Among them, j traverses from 1 to max β , wk takes the value of N.

[0068] Institution B compares the randomly arranged V with the dataset M 2 [i][j] calculates the intersection result, that is: V∩M 2 [i][j], complete the intersection process.

[0069] In the above process, t times of N-choose-1 are required based on the OT algorithm, so the communication assistance degree is relatively high.

[0070] Based on the above, the present disclosure provides a privacy set intersection method to avoid high computational assistance and communication assistance. The method is implemented based on a computing node and at least two data nodes, wherein each data node refers to each node that needs to perform privacy set intersection, and the computing node is a node specially set for computing, and the computing node does not store the set data that needs to be intersected.

[0071] Firstly, taking any one of at least two data nodes as the execution subject, the privacy set intersection method provided by the present disclosure is introduced.

[0072] In one embodiment, if Figure 3 As shown in the figure, the process steps implemented by the data node during the implementation of the privacy set intersection method are as follows:

[0073] Step 301, obtaining encrypted set data to be processed.

[0074] In this embodiment, the data node that needs to perform the private set intersection has the original set data stored locally. In order to avoid data leakage, the local original set data is first encrypted before the intersection process is performed, so as to obtain the encrypted set data to be processed.

[0075] In one embodiment, the encrypted set data to be processed is obtained, and the specific process is as follows: obtaining a negotiated key and obtaining the original set data stored by the data node, wherein the negotiated key is a key obtained by negotiation between at least two data nodes; encrypting the original set data with the negotiated key to obtain the encrypted set data.

[0076] In this embodiment, each data node that needs to perform privacy set intersection needs to encrypt the local original set data respectively. The key used by each data node to encrypt the original set data is the negotiated key obtained by each data node. Each data node uses the negotiated key to encrypt the locally stored original set data, thereby obtaining the encrypted set data corresponding to each data node.

[0077] Furthermore, the negotiation key is obtained through negotiation between at least two data nodes as follows:

[0078] Randomly determine a first data node among at least two data nodes;

[0079] The first data node locally generates a first node key corresponding to the first data node;

[0080] Determining a second data node that has not participated in the key negotiation, the first data node transmitting the first node key to the second data node;

[0081] The second data node locally generates a second node key corresponding to the second data node based on the first node key;

[0082] Determine a next third data node that has not participated in the key negotiation, and the second data node transmits the second node key to the third data node;

[0083] The third data node locally generates a third node key corresponding to the third data node based on the second node key;

[0084] And so on, until all data nodes that do not participate in key negotiation are traversed;

[0085] The last determined data node that does not participate in the key negotiation generates a negotiation key negotiated by all data nodes, and transmits the negotiation key to other data nodes.

[0086] After each data node obtains the negotiated key, it encrypts the local original set data using the negotiated key.

[0087] It should be noted that the negotiation key is not transmitted to the computing node. Therefore, the computing node cannot decrypt the data or vectors transmitted by each data node, which improves data security.

[0088] Step 302: Map the encrypted set data to a set vector corresponding to the encrypted set data.

[0089] In this embodiment, in order to reduce the amount of data calculation and the amount of data transmission, the encrypted set data is mapped into a set vector.

[0090] In one embodiment, the encrypted set data is mapped to a set vector corresponding to the encrypted set data. The specific implementation process is as follows: based on a preset vector length, the encrypted set data is mapped to an initial vector, wherein the initial vector is a bit vector generated based on the mapping of the encrypted set data; a random vector is obtained, wherein the random vector is a randomly generated bit vector; the initial vector and the random vector are XORed to obtain a set vector corresponding to the encrypted set data.

[0091] In this embodiment, during the data vectorization process, the encrypted set data is first mapped to an initial vector based on a preset vector length. The preset vector length can be set based on actual conditions and needs, for example, according to the computing resource size of the computing node, or according to the actual required computing accuracy.

[0092] For multiple data nodes associated with a computing node, each data node can use the same preset vector length to map the encrypted set data corresponding to each data node respectively, so that the initial vector length generated by the mapping of each data node is consistent, simplifying the subsequent intersection process of computing nodes and improving the efficiency of privacy set intersection.

[0093] In this embodiment, when the data node maps the encrypted set data to the initial vector, the encrypted set data is mapped to the initial vector based on a preset mapping function, and the initial vector is a bit vector. Specifically, the initial vector is a bit vector with a certain number of bits.

[0094] Then, based on the initial vector, a random vector is obtained. The initial vector is obfuscated by XORing the initial vector and the random vector, thereby obtaining the set vector corresponding to the encrypted set data. Through random limited obfuscation, the computing node cannot directly reverse quantize the set vector to obtain the original set data stored by each data node, further ensuring the security of the data.

[0095] In this embodiment, the initial vector, the random vector and the set vector are all bit vectors, so that the bit-by-bit calculation process can be implemented and the amount of data calculation can be reduced.

[0096] In one embodiment, when obtaining a random vector, when the data node is a randomly determined starting data node, a random vector having the same length as the initial vector is generated based on the initial vector; and the random vector is distributed to each data node related to the computing node.

[0097] In this embodiment, for multiple data nodes associated with the computing node, a starting data node is determined in each data node, and then the starting data node generates a random vector with the same length as the initial vector based on the initial vector corresponding to the starting data node. When the vector lengths preset by each data node are consistent, the random vector generated by the starting data node is consistent with the lengths of the initial vectors corresponding to other data nodes. The starting data node distributes the random vector to each data node associated with the computing node, and each data node that receives the random vector uses the random vector to perform XOR processing on the local initial vector to obtain a local set vector. In other words, when the data node is not the starting data node, the random vector transmitted by the starting data node is obtained; the set vector corresponding to the encrypted set data is obtained by performing XOR processing on the initial vector and the random vector.

[0098] It should be noted that the starting data node does not transmit the random vector to the calculation vector, thereby ensuring the effect of vector obfuscation and improving data security.

[0099] In a specific embodiment, Figure 4 As shown, data node A and data node B are different data nodes. Data node A stores encrypted set data X, which contains n×1 data units (the data units in X are denoted as x i ). Data node B stores the encrypted set data Y after encryption. The encrypted set data Y contains m×1 data units (the data unit in Y is recorded as y i ). Now we need to find the intersection of encrypted set data X and encrypted set data Y.

[0100] Data node A uses a preset mapping function h(x i) Map the encrypted set data X to the initial vector A V Data node B uses a preset mapping function h(y i ) Map the encrypted set data Y to the initial vector B V .

[0101] Data node A generates a vector with the same initial vector A V A random vector R of the same length is generated, and the random vector R is sent to data node B.

[0102] Data node A to initial vector A V Perform bitwise XOR calculation with random vector R to generate set vector A r , denoted as Data node A will collect vector A r Sent to the compute nodes.

[0103] Data node B to initial vector B V Perform bitwise XOR calculation with random vector R to generate set vector B r , denoted as Data node B will collect vector B r Sent to the compute nodes.

[0104] Calculate the node pair set vector A r and the set vector B r Perform bitwise AND calculation, denoted as A r ∧B r , and obtain the intersection vector. The computing node returns the intersection vector to data node A and data node B.

[0105] Data node A is based on the initial vector A V The intersection vector is parsed and the calculation logic is as follows: Then the final intersection data is obtained through decryption and other processes.

[0106] Similarly, data node B is based on the initial vector B V The intersection vector is parsed and the calculation logic is as follows: Then the final intersection data is obtained through decryption and other processes.

[0107] Secure intersection based on bit vector obfuscation technology. First, the data node uses vectors to represent the original data set, which greatly reduces the amount of data transmission. The bitwise AND calculation when computing the intersection also greatly reduces the amount of calculation. At the same time, we obfuscate the vector so that the computing node cannot know the initial vector in the data node, further ensuring the security of the data.

[0108] Step 303: transmit the set vector to a computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two data nodes respectively, and to intersect at least two set vectors to obtain an intersection vector.

[0109] In this embodiment, each data node transmits the local set vector to the computing node, which performs intersection calculation. Furthermore, when the set vectors transmitted by each data node are multiple bit vectors of the same length, the computing node performs AND processing on at least two set vectors that need to be intersected to obtain the intersection vector. The bit-based AND calculation of the computing node greatly reduces the amount of data calculation, thereby improving the efficiency of the intersection of the privacy set.

[0110] Step 304: Obtain the intersection vector returned by the computing node.

[0111] In this embodiment, after obtaining the intersection vector, the computing node returns the intersection vector to the data node. The intersection result based on the set vector is the intersection vector, and the intersection result returned by the computing node to the data node is also the intersection vector, thereby reducing the amount of data transmitted in communication while ensuring data security.

[0112] Step 305, parse the intersection vector to obtain intersection data.

[0113] In this embodiment, after the data node obtains the intersection vector, it parses the intersection vector based on the preset inverse mapping relationship to obtain the intersection data. Further, the inverse mapping relationship corresponds to the acquisition process of the above-mentioned set vector. When the set vector is encrypted, mapped, and randomly obfuscated, the intersection vector is correspondingly deobfuscated, demapped, and decrypted by a random vector to obtain the final intersection data.

[0114] In this embodiment, there may be conflicts after bit vector intersection, such as different ciphertext data is mapped to the same bit, which may lead to inaccurate intersection results. We need to further accurately intersect the results after intersection, for example, using the Cuckoo Search (CS) algorithm to do the next step of accurate intersection.

[0115] However, it should be emphasized that the method provided by the present disclosure occupies less communication resources and less computing resources through bit vector intersection, and obtains an inaccurate intersection that is smaller than the original data, wherein the PSI matching rate of the two sides is usually much less than 0.5, which will significantly reduce the communication resources and computing resources required for the next step of accurate intersection. Therefore, the method provided by the present disclosure is conducive to improving the efficiency of intersection.

[0116] Next, the privacy set intersection method provided by the present invention is introduced with the computing node as the execution subject.

[0117] In one embodiment, if Figure 5 As shown in Figure 2, the process steps implemented by the computing nodes during the implementation of the privacy set intersection method are as follows:

[0118] Step 501, obtaining set vectors transmitted respectively by at least two data nodes;

[0119] Step 502, intersecting at least two set vectors to obtain an intersection vector;

[0120] Step 503: Return the intersection vector to each data node for which intersection is sought.

[0121] Among them, the data node is used to obtain the encrypted set data to be processed, map the encrypted set data into a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

[0122] In this embodiment, each data node associated with the computing node transmits the locally generated intersection vector to the computing node, and the computing node completes the intersection calculation.

[0123] In this embodiment, the computing node may intersect the set vectors transmitted by at least two data nodes according to a preset rule, and then return the intersection vector obtained by the intersection to each data node for which the intersection is obtained.

[0124] In one embodiment, when the intersection vector is obtained by intersecting at least two set vectors, AND processing is performed on the at least two set vectors to obtain the intersection vector.

[0125] In this embodiment, when the intersection vector transmitted by each data node to the computing node is a bit vector, the computing node performs bitwise AND calculation on at least two set vectors to implement the process of solving the intersection.

[0126] The privacy set intersection method implemented with computing nodes as the execution body can be compared with the privacy set intersection method implemented with data nodes as the execution body, and the repeated parts will not be repeated.

[0127] The privacy set intersection method provided by the present disclosure is that the data node maps the encrypted set data to be processed into a set vector, and then transmits the set vector to the computing node. The computing node intersects the set vectors transmitted by at least two data nodes respectively, obtains the intersection vector, and returns the intersection vector to each data node for intersection. After the data node obtains the intersection vector, it parses and obtains the intersection data. In the above process, the data node vectorizes the encrypted set data and transmits the set vector to the computing node for vector intersection, which reduces the amount of data for intersection calculation and improves the processing efficiency of privacy set intersection. At the same time, what is transmitted between the data node and the computing node is the set vector and the intersection vector, and the amount of data transmission is reduced; and in one set intersection process, there is no need to perform three or more data transmissions between the data node and the computing points, which saves communication resources and further improves the processing efficiency of privacy set intersection.

[0128] Furthermore, the security of this method is significantly improved. First, there is no direct interaction of original data between data nodes, and they cannot do evil alone or in collusion. Secondly, the computing nodes cannot decrypt the data. Combined with the vector obfuscation based on random vectors, the computing nodes cannot do evil alone. Thirdly, a single data node can use one-way encryption technology, and even if the server and the client collude, they still cannot crack the data.

[0129] Based on the secure intersection of bit vector and obfuscation technology, the data node first uses the bit vector to represent the original set data, which greatly reduces the amount of data transmission; the bitwise AND calculation when the computing node intersects also greatly reduces the amount of calculation. At the same time, the data node obfuscates the vector based on the random vector, so that the computing node cannot know the initial vector, further ensuring the security of the data.

[0130] The present disclosure also provides a privacy set intersection system, such as Figure 6 As shown, the privacy set intersection system includes a computing node and at least two data nodes; the data node is used to obtain the encrypted set data to be processed; the encrypted set data is mapped into a set vector corresponding to the encrypted set data; the set vector is transmitted to the computing node; the intersection vector is obtained from the computing node; the intersection vector is parsed to obtain the intersection data; the computing node is used to obtain the set vectors respectively transmitted by at least two data nodes; the at least two set vectors are intersected to obtain the intersection vector; and the intersection vector is returned to each data node for intersection.

[0131] In one embodiment, a data node is used to obtain a negotiated key and original set data stored in the data node, wherein the negotiated key is a key negotiated by at least two data nodes; the original set data is encrypted using the negotiated key to obtain encrypted set data.

[0132] In one embodiment, a data node is used to map encrypted set data to an initial vector based on a preset vector length, wherein the initial vector is a bit vector generated based on the mapping of the encrypted set data; obtain a random vector, wherein the random vector is a randomly generated bit vector; and perform XOR processing on the initial vector and the random vector to obtain a set vector corresponding to the encrypted set data.

[0133] In one embodiment, the data node is used to generate a random vector having the same length as the initial vector based on the initial vector when the data node is a randomly determined starting data node; and distribute the random vector to each data node related to the computing node.

[0134] In one embodiment, the computing node is used to perform AND processing on at least two set vectors to obtain an intersection vector.

[0135] In a specific embodiment, Figure 7 As shown, the privacy set intersection system includes a computing node, a data node A, a data node B and a data node C.

[0136] Data node A locally stores the original set data x; data node B locally stores the original set data y; data node C locally stores the original set data v.

[0137] The negotiated key is used for data encryption. The process by which data nodes A, B, and C negotiate to obtain the negotiated key is as follows:

[0138] Determine data node A as the starting data node;

[0139] Data node A randomly generates the node key k of data node A a =g a , and the node key k of data node A a =g a Transmitted to data node B, where k a represents the node key of data node A, g a Indicates that data node A generates k a The calculation logic of

[0140] Data node B is based on the node key k of data node A. a =g a , generate the node key k of data node B ab =g ab , and the node key k of data node B ab =g ab Transmitted to data node C, where k ab represents the node key of data node B, g ab Indicates that data node B is based on ka Generate k ab The calculation logic of

[0141] Data node C is based on the node key k of data node B. ab =g ab , generate the node key k of data node C abc =g abc At this point, all data nodes have been traversed, and the node key k ab =g abc To negotiate the key k = g abc , where k abc represents the node key of data node C, g abc Indicates that data node C is based on k ab Generate k abc The calculation logic of k represents the final negotiated key obtained after traversing all data nodes;

[0142] Data node C will negotiate the key k = g abc Transmitted to data node A and data node B respectively;

[0143] Data nodes A, B, and C negotiate the key k=g abc Encrypt the original collection data stored locally.

[0144] After data node A encrypts the original set data x with the negotiated key k, it undergoes vectorization and vector obfuscation, and the obtained set vector is recorded as f(x, k); data node A transmits f(x, k) to the computing node. After data node B encrypts the original set data y with the negotiated key k, it undergoes vectorization and vector obfuscation, and the obtained set vector is recorded as f(y, k); data node B transmits f(y, k) to the computing node. After data node C encrypts the original set data v with the negotiated key k, it undergoes vectorization and vector obfuscation, and the obtained set vector is recorded as f(v, k); data node C transmits f(v, k) to the computing node.

[0145] The computing node performs intersection calculation based on the set vector f(x, k), the set vector f(y, k) and the set vector f(v, k) as needed, and then returns the intersection vector to the data node. For example, the computing node performs bitwise AND calculation based on the set vector f(x, k) and the set vector f(y, k) to complete the intersection process, obtain the intersection vector f(x∩y, k), and return the intersection vector f(x∩y, k) to the data node A and / or the data node B. For another example, the computing node performs bitwise AND calculation based on the set vector f(x, k) and the set vector f(v, k) to complete the intersection process, obtain the intersection vector f(x∩v, k), and return the intersection vector f(x∩v, k) to the data node A and / or the data node C. For another example, the computing node performs bitwise AND calculation based on the set vector f(x,k), the set vector f(y,k) and the set vector f(v,k), completes the intersection process of the three vectors, obtains the intersection vector f(x∩y∩v,k), and returns the intersection vector f(x∩y∩v,k) to data node A, data node B and / or data node C.

[0146] The implementation process of the privacy set intersection system provided by the present disclosure and the privacy set intersection method can be compared with each other, and the repeated parts will not be repeated.

[0147] The following is a description of the data node device for privacy set intersection provided by the embodiment of the present disclosure. The data node device for privacy set intersection described below and the privacy set intersection method described above with the data node as the execution subject can be referred to each other. Figure 8 As shown, a data node device for privacy set intersection includes:

[0148] The first acquisition module 801 is used to acquire the encrypted set data to be processed;

[0149] A vectorization module 802, used for mapping the encrypted set data into a set vector corresponding to the encrypted set data;

[0150] A transmission module 803 is used to transmit the set vector to a computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two data nodes respectively, and to intersect at least two set vectors to obtain an intersection vector;

[0151] The second acquisition module 804 is used to acquire the intersection vector returned by the computing node;

[0152] The parsing module 805 is used to parse the intersection vector and obtain intersection data.

[0153] In one embodiment, the first acquisition module 801 is used to obtain a negotiated key and original set data stored in a data node, wherein the negotiated key is a key obtained through negotiation between at least two data nodes; the original set data is encrypted using the negotiated key to obtain encrypted set data.

[0154] In one embodiment, the vectorization module 802 is used to map the encrypted set data into an initial vector based on a preset vector length, wherein the initial vector is a bit vector generated based on the mapping of the encrypted set data; obtain a random vector, wherein the random vector is a randomly generated bit vector; and perform XOR processing on the initial vector and the random vector to obtain a set vector corresponding to the encrypted set data.

[0155] In one embodiment, the vectorization module 802 is used to generate a random vector having the same length as the initial vector based on the initial vector when the data node is a randomly determined starting data node; and distribute the random vector to each data node related to the computing node.

[0156] The following describes the computing node device for privacy set intersection provided by the embodiment of the present disclosure. The computing node device for privacy set intersection described below and the privacy set intersection method with computing nodes as the execution subject described above can be referred to each other. Fig. 9 As shown, a computing node device for privacy set intersection includes:

[0157] A third acquisition module 901 is used to acquire set vectors respectively transmitted by at least two data nodes;

[0158] An intersection module 902 is used to intersect at least two set vectors to obtain an intersection vector;

[0159] A return module 903 is used to return the intersection vector to each data node for which intersection is sought;

[0160] The data node is used to obtain the encrypted set data to be processed, map the encrypted set data into a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

[0161] In one embodiment, the intersection module 902 is used to perform AND processing on at least two of the set vectors to obtain the intersection vector.

[0162] Fig.10 An example of a physical structure diagram of an electronic device is shown in FIG. Fig.10As shown, the electronic device may include: a processor 1001, a communication interface 1002, a memory 1003 and a communication bus 1004, wherein the processor 1001, the communication interface 1002 and the memory 1003 communicate with each other through the communication bus 1004. The processor 1001 may call the logic instructions in the memory 1003 to execute a privacy set intersection method with the data node as the execution subject, the method comprising: obtaining the encrypted set data to be processed; mapping the encrypted set data to a set vector corresponding to the encrypted set data; transmitting the set vector to the computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two data nodes respectively, and to intersect at least two set vectors to obtain an intersection vector; obtaining the intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data;

[0163] Alternatively, a privacy set intersection method is executed with a computing node as the execution subject, the method comprising: obtaining set vectors respectively transmitted by at least two data nodes, obtaining an intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data; intersecting at least two set vectors to obtain an intersection vector; returning the intersection vector to each data node intersected; wherein the data node is used to obtain encrypted set data to be processed, map the encrypted set data to a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

[0164] In addition, the logic instructions in the above-mentioned memory 1003 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present disclosure. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a disk or an optical disk.

[0165] On the other hand, the present disclosure further provides a computer program product, the computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer, the computer can execute the privacy set intersection method provided by the above methods with the data node as the execution subject, the method comprising: obtaining the encrypted set data to be processed; mapping the encrypted set data to a set vector corresponding to the encrypted set data; transmitting the set vector to a computing node, wherein the computing node is used to obtain the set vectors respectively transmitted by at least two data nodes, and intersect at least two set vectors to obtain an intersection vector; obtaining the intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data;

[0166] Alternatively, a computer can execute the privacy set intersection method provided by the above methods with a computing node as the execution subject, the method comprising: obtaining set vectors respectively transmitted by at least two data nodes, obtaining an intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data; intersecting at least two set vectors to obtain an intersection vector; returning the intersection vector to each data node intersected; wherein the data node is used to obtain the encrypted set data to be processed, map the encrypted set data to a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

[0167] In another aspect, the present disclosure further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the processor executes the above-mentioned privacy set intersection method with the data node as the execution subject, the method comprising: obtaining the encrypted set data to be processed; mapping the encrypted set data to a set vector corresponding to the encrypted set data; transmitting the set vector to a computing node, wherein the computing node is used to obtain the set vectors respectively transmitted by at least two data nodes, and intersect the at least two set vectors to obtain an intersection vector; obtaining the intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data;

[0168] Alternatively, when the computer program is executed by the processor, it is implemented to execute the above-mentioned privacy set intersection method with the computing node as the execution subject, the method including: obtaining set vectors transmitted by at least two data nodes respectively, and obtaining the intersection vector returned by the computing node; parsing the intersection vector to obtain intersection data; intersecting at least two set vectors to obtain the intersection vector; returning the intersection vector to each data node intersected; wherein the data node is used to obtain the encrypted set data to be processed, map the encrypted set data to the set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, and parse the intersection vector to obtain the intersection data.

[0169] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0170] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0171] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure, rather than to limit them. Although the present disclosure has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present disclosure.

Claims

1. A method for finding the intersection of private sets, characterized in that: Applied to any one of the at least two data nodes, comprising: Get the encrypted collection data to be processed; Mapping the encrypted set data to a set vector corresponding to the encrypted set data; Transmitting the set vector to a computing node, wherein the computing node is used to obtain the set vectors transmitted by at least two of the data nodes respectively, and to intersect at least two of the set vectors to obtain an intersection vector; Obtaining the intersection vector returned by the computing node; The intersection vector is parsed to obtain intersection data.

2. The method for finding intersection of private sets according to claim 1, characterized in that: The step of obtaining the encrypted set data to be processed includes: Acquire a negotiated key, and acquire the original set data stored by the data node, wherein the negotiated key is a key obtained through negotiation between at least two of the data nodes; The original set data is encrypted using the negotiated key to obtain the encrypted set data.

3. The privacy set intersection method according to claim 1, characterized in that: Mapping the encrypted set data to a set vector corresponding to the encrypted set data includes: Based on a preset vector length, mapping the encrypted set data to an initial vector, wherein the initial vector is a bit vector generated based on the mapping of the encrypted set data; Obtaining a random vector, wherein the random vector is a randomly generated bit vector; The initial vector and the random vector are subjected to XOR processing to obtain the set vector corresponding to the encrypted set data.

4. The method for finding intersection of private sets according to claim 3, characterized in that: The obtaining of a random vector comprises: In a case where the data node is a randomly determined starting data node, generating the random vector having the same length as the initial vector based on the initial vector; The random vector is distributed to each of the data nodes associated with the computing node.

5. A method for finding the intersection of private sets, characterized in that: Applied to compute nodes, including: Obtaining set vectors transmitted respectively by at least two data nodes; Intersecting at least two of the set vectors to obtain an intersection vector; Returning the intersection vector to each of the data nodes for intersection; Among them, the data node is used to obtain the encrypted set data to be processed, map the encrypted set data into a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

6. The method for finding intersection of private sets according to claim 5, characterized in that: The step of intersecting at least two of the set vectors to obtain an intersection vector comprises: Perform AND processing on at least two of the set vectors to obtain the intersection vector.

7. A private set intersection system, characterized in that: Includes a computing node and at least two data nodes; The data node is used to obtain the encrypted set data to be processed; map the encrypted set data to a set vector corresponding to the encrypted set data; transmit the set vector to the computing node; obtain the intersection vector returned by the computing node; and parse the intersection vector to obtain intersection data; The computing node is used to obtain set vectors respectively transmitted by at least two data nodes; to intersect at least two of the set vectors to obtain an intersection vector; and to return the intersection vector to each of the data nodes intersected.

8. A data node device for privacy set intersection, characterized in that: include: A first acquisition module, used to acquire the encrypted set data to be processed; A vectorization module, used for mapping the encrypted set data into a set vector corresponding to the encrypted set data; A transmission module, used to transmit the set vector to a computing node, wherein the computing node is used to obtain the set vectors respectively transmitted by at least two of the data nodes, and to intersect at least two of the set vectors to obtain an intersection vector; A second acquisition module, used to acquire the intersection vector returned by the computing node; The parsing module is used to parse the intersection vector to obtain intersection data.

9. A computing node device for privacy set intersection, characterized in that: include: A third acquisition module, used to acquire set vectors respectively transmitted by at least two data nodes; An intersection module, used for finding the intersection of at least two of the set vectors to obtain an intersection vector; A returning module, used for returning the intersection vector to each of the data nodes for which intersection is sought; Among them, the data node is used to obtain the encrypted set data to be processed, map the encrypted set data into a set vector corresponding to the encrypted set data, transmit the set vector to the computing node, obtain the intersection vector returned by the computing node, parse the intersection vector, and obtain the intersection data.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the privacy set intersection method as described in any one of claims 1 to 6 is implemented.

11. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the privacy set intersection method as described in any one of claims 1 to 6 is implemented.