Query method and device for business objects

By using Bloom filter and homomorphic encryption technology in query scenarios, the problem of data privacy leakage in query scenarios is solved, and efficient privacy protection of query processes and results is achieved.

CN115098545BActive Publication Date: 2024-11-12ANT BLOCKCHAIN TECHNOLOGY (SHANGHAI) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210738903.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-27
Publication Date
2024-11-12
Estimated Expiration
2042-06-27

AI Technical Summary

Technical Problem

In the query scenario, when the two parties participating in the query are independent of each other, direct plain text interaction will lead to the leakage of data privacy, especially when querying whether a business object exists on the list, it is difficult for the privacy of the data party and the query party to be in the privacy of the data party and the query party to be in trouble. Protect.

Method used

Using Bloom filter and homomorphic encryption technology, the query party maps the target object's identification to the position number of the Bloom filter, and randomly selects the obfuscated position number to form a position number set and a cipher essay collection, and sends a query request to the data party. The data party querys element values ​​based on the Bloom filter and performs homomorphic operations to ensure the privacy of the query results.

Benefits of technology

It effectively protects the data privacy of both parties involved, while improving query efficiency and ensuring the accuracy and privacy of query results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115098545B_ABST
    Figure CN115098545B_ABST
Patent Text Reader

Abstract

The embodiment of this specification provides a query method for business objects, in which the query party randomly selects some positions in the Bloom filter, obfuscates the position information of the target business object to be queried in the Bloom filter, and includes the obfuscated position information and the corresponding ciphertext information in the query request and sends it to the data party; the data party uses the Bloom filter that determines the element value based on the object list to process the query request and obtain the query result ciphertext; thus, the query party decrypts the received query result ciphertext to obtain the query result plaintext, which indicates whether the target business object is in the object list or not. In this way, the data privacy of the query party and the data party can be protected, and the query efficiency can be effectively improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] One or more embodiments of the present specification relate to the field of computer technology, and in particular, to a method and device for querying a business object. Background Art

[0002] In many fields, there is a query scenario, that is, to query whether a business object exists in a certain list. For example, a trading system queries whether a user is on a list of dishonest persons. However, when the two parties involved in the query are independent of each other, direct plaintext interaction will lead to data privacy leakage. For example, the querying party will leak which user needs to be queried, or the data party will leak a large amount of privacy information of irrelevant users after directly providing the list to the querying party.

[0003] Therefore, there is an urgent need for a solution that can protect the data privacy of both parties in the above query scenario. Summary of the invention

[0004] One or more embodiments of the present specification describe a method and device for querying business objects, which can protect the data privacy of both parties of the interaction and ensure high query efficiency.

[0005] According to a first aspect, a query method for a business object is provided, which is applied to a query party, comprising: mapping a target object identifier to be queried to k first position numbers of a Bloom filter, and randomly selecting m second position numbers to form a position number set; for each first position number, determining a first ciphertext obtained by homomorphically encrypting a first value, and for each second position number, determining a second ciphertext obtained by homomorphically encrypting a second value to form a ciphertext set; sending a query request for the target object to a data party, which includes the position number set and the corresponding ciphertext set; receiving a query result ciphertext, which is obtained by the data party querying the element value of the corresponding position from the Bloom filter according to each position number in the position number set, and performing a homomorphic operation on the queried element value and the ciphertext set; the element value of the Bloom filter is determined according to the position mapped by the identifier of each object in the object set; decrypting the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

[0006] In one embodiment, mapping the target object identifier to be queried to k first position numbers of the Bloom filter includes: processing the target object identifier respectively by using k preset mapping functions to obtain the k first position numbers.

[0007] In a specific embodiment, the k mapping functions are implemented as k hash functions; wherein, the k first position numbers are obtained by respectively processing the target object identifier using the preset k mapping functions, including: respectively processing the target object identifier using the k hash functions to obtain k hash values; and respectively taking the modulus of the length of the Bloom filter for the k hash values ​​to obtain the k first position numbers.

[0008] In one embodiment, the second value is 0, and the first value is different from the second value.

[0009] In one embodiment, each element value in the Bloom filter is initialized to a third value, and the element value in the position mapped by the identifier of each object is replaced by a fourth value.

[0010] In a specific embodiment, the fourth value is 0, and the third value is different from the fourth value.

[0011] In a more specific embodiment, when the query result plain text is 0, it indicates that the target object is located in the object set; when the query result plain text is not 0, it indicates that the target object is not located in the object set.

[0012] In one embodiment, the object set consists of business objects in a blacklist.

[0013] In one embodiment, the target object is an individual user or an enterprise user.

[0014] According to a second aspect, a query method for business objects is provided, which is applied to a data party and includes: determining an element value in the Bloom filter according to the position after mapping the identifier of each object in the object set to the Bloom filter; receiving a query request for the target object from the query party, which includes a position number set and a corresponding ciphertext set; the position number set includes k first position numbers that map the target object identifier to the Bloom filter, and m second position numbers randomly selected; the ciphertext set includes a first ciphertext corresponding to each first position number, which is obtained by homomorphically encrypting the first value, and also includes a second ciphertext corresponding to each second position number, which is obtained by homomorphically encrypting the second value; according to each position number in the position number set, querying the element value of the corresponding position from the Bloom filter; performing homomorphic operations on the queried element value and the ciphertext set to obtain a query result ciphertext; sending the query result ciphertext to the query party so that the query party decrypts the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

[0015] In one embodiment, determining the element value in the Bloom filter based on mapping the identifier of each object in the object set to the position of the Bloom filter includes: initializing each element value in the Bloom filter to a third value; and setting the element value corresponding to the position where the identifier of each object in the object set is mapped to the Bloom filter to a fourth value.

[0016] In a specific embodiment, the element value corresponding to the position of the Bloom filter mapped to the identifier of each object in the object set is set to a fourth value, including: using k preset mapping functions to process the identifiers of each object respectively to obtain k third position numbers; setting the element values ​​corresponding to the k third position numbers in the Bloom filter to the fourth value.

[0017] In one embodiment, a homomorphic operation is performed on the queried element value and the ciphertext set to obtain the query result ciphertext, including: for each position number, calculating the first product of the corresponding ciphertext and the corresponding queried element value; and determining the query result ciphertext according to the sum of the first products.

[0018] In a more specific embodiment, determining the query result ciphertext according to the sum of the first products includes: calculating a second product between the sum and a locally generated random number as the query result ciphertext.

[0019] According to a third aspect, a query device for business objects is provided, the device being integrated in the querying party, comprising: a position mapping unit configured to map the target object identifier to be queried to k first position numbers of the Bloom filter; a position random selection unit configured to randomly select m second position numbers to form a position number set; a position ciphertext determination unit configured to determine, for each first position number, a first ciphertext obtained by homomorphically encrypting a first value, and, for each second position number, determine a second ciphertext obtained by homomorphically encrypting a second value to form a ciphertext set; a query request sending unit configured to send a query request to the data party. A query request for a target object, including the position number set and the corresponding ciphertext set; a result ciphertext receiving unit, configured to receive the query result ciphertext, which is obtained by the data party querying the element value of the corresponding position from the Bloom filter according to each position number in the position number set, and performing a homomorphic operation on the queried element value and the ciphertext set; the element value of the Bloom filter is determined according to the position mapped by the identifier of each object in the object set; a decryption unit, configured to decrypt the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

[0020] According to a fourth aspect, a query device for a business object is provided, the device being integrated in a data party, comprising: a filter determination unit configured to determine an element value in the Bloom filter according to a position after mapping an identifier of each object in an object set to the Bloom filter; a query request receiving unit configured to receive a query request for a target object from a query party, the query request comprising a position number set and a corresponding ciphertext set; the position number set comprising k first position numbers for mapping the target object identifier to the Bloom filter, and m second position numbers randomly selected; the ciphertext set comprising first ciphertext numbers corresponding to each first position number; The ciphertext is obtained by homomorphically encrypting the first value, and also includes second ciphertexts corresponding to each second position number, which is obtained by homomorphically encrypting the second value; a query unit is configured to query the element value of the corresponding position from the Bloom filter according to each position number in the position number set; a homomorphic operation unit is configured to perform homomorphic operation on the queried element value and the ciphertext set to obtain a query result ciphertext; a result ciphertext sending unit is configured to send the query result ciphertext to the query party, so that the query party decrypts the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

[0021] According to a fifth aspect, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed in a computer, the computer is caused to execute the method of the first aspect or the second aspect.

[0022] According to a sixth aspect, a computing device is provided, including a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, the method of the first aspect or the second aspect is implemented.

[0023] The above method and device provided by the embodiment of this specification are used to introduce a Bloom filter for the scenario of querying whether a certain object is in the object list. Since a random mapping function is used in the Bloom filter, due to the unidirectionality of the random mapping function, there are many possible original images, so that the query party only needs to select a small number of obfuscated position numbers to obtain excellent anonymity effects. At the same time, the data party uses a Bloom filter to process query requests for target objects, effectively reducing the amount of data involved in the query process, thereby effectively improving the query efficiency; furthermore, homomorphic operations are introduced, the query party determines the ciphertext corresponding to each target position and each obfuscated position, and the data party performs homomorphic operations on the element values ​​queried for the target position and the obfuscated position and the ciphertext, thereby ensuring that the transmission and calculation of data will not lead to the leakage of data privacy. In this way, effective protection of data privacy in the data party and the query party is achieved, while ensuring high query efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0025] Figure 1 A schematic diagram of a query scenario according to an embodiment is shown;

[0026] Figure 2 A schematic diagram of two-party interaction for querying a business object according to an embodiment is shown;

[0027] Figure 3 A schematic diagram of a binary array in a Bloom filter according to an embodiment is shown;

[0028] Figure 4 A schematic diagram of the structure of a query device for a business object according to an embodiment is shown;

[0029] Figure 5 A schematic diagram of the structure of a query device for business objects according to another embodiment is shown. DETAILED DESCRIPTION

[0030] The solution provided in this specification is described below in conjunction with the accompanying drawings.

[0031] The embodiments of this specification disclose a query solution that can protect the data privacy of both parties in the query scenario. Specifically, the querying party can only know whether the business object it wants to query is in the object list held by the data party, but cannot obtain other information; the data party cannot obtain information about which business object the querying party specifically queries.

[0032] Figure 1 FIG. 2 shows a query scenario diagram according to an embodiment. Figure 1 As shown, the query party randomly selects some positions in the Bloom filter, obfuscates the position information of the target business object to be queried in the Bloom filter, and includes the obfuscated position information and the corresponding ciphertext information in the query request and sends it to the data party; the data party uses the Bloom filter that determines the element value based on the object list to process the query request and obtains the query result ciphertext; then, the query party decrypts the received query result ciphertext to obtain the query result plaintext, which indicates whether the target business object is in the object list or not.

[0033] The implementation steps of the above solution are introduced below in combination with more embodiments.

[0034] Figure 2The following is a schematic diagram of two parties interacting with each other to query a business object according to an embodiment. The two parties include a query party with a query requirement and a data party holding a list of objects. It should be noted that the query party and the data party are independent of each other and can be implemented as any device, platform or equipment cluster with computing and processing capabilities. Figure 2 As shown, the process of interaction between the two parties includes the following steps:

[0035] Step S210, the data party determines the element value in the Bloom filter according to the position after mapping the identifier of each object in the object set to the Bloom filter. It should be noted that the objects in the object set are located in the above-mentioned object list, and the object set and object list in this article can be interchangeable.

[0036] In one embodiment, the business objects in the object list may be individual users or corporate users, etc. The object list includes the object identifier of the business object, such as the individual user's ID number, or mobile phone number, or the internal ID assigned to it by the business system, and for example, the corporate user's organizational code, etc.

[0037] In this step, the element value of each position in the Bloom filter is first initialized to the third value, and then, for the identifier of each object in the above object set, it is processed using the preset k random mapping functions to obtain the corresponding k third position numbers, so that the element values ​​at the k third positions corresponding to the k third position numbers in the Bloom filter are set to the fourth value. It should be noted that k is a positive integer, and the specific value can be set according to the query accuracy, etc. The larger the value, the higher the accuracy; in addition, the fourth value is different from the third value.

[0038] In one embodiment, the value range of the random mapping function is the same as the number of positions (or simply the number of bits or length) of the Bloom filter. In this case, the output of the random mapping function can be directly used as the corresponding position number. In another embodiment, when the two are different, the function value output by the random mapping function can be modulo the number of bits of the Bloom filter, and the obtained modulus value can be used as the corresponding position number. On the other hand, in one embodiment, the random mapping function can be implemented as a hash function.

[0039] It should be noted that when Bloom filters are used conventionally, they are all initialized to 0, and then the corresponding positions are set to 1 when inserting objects. Preferably, the embodiment of this specification adopts a different method from the conventional one, firstly all Bloom filters are initialized to a non-zero value (for example, 1), and then the corresponding positions are set to 0 when inserting objects, so that the subsequent judgment of query results can be more accurate and efficient.

[0040] For example, Figure 3The Bloom filter shown includes 10 positions, which are numbered from 1 to 10. It should be understood that the positions can be numbered from 0 to 9 as long as they are different from each other. Figure 3 As shown, the values ​​of all positions in the Bloom filter are initialized to 1. It is assumed that the predetermined k random mapping functions are 2 hash functions, and the object set includes two object identifiers, denoted as id1 and id2. It is further assumed that Hash1(id1)=2, Hash2(id1)=6, Hash1(id2)=10, Hash2(id2)=6. At this time, the element values ​​corresponding to position numbers 2, 6, and 10 are changed from 1 to 0.

[0041] From the above, the data party can determine the element value at each position in the Bloom filter.

[0042] Before, after, or simultaneously with the above step S210, in step S220, the querying party maps the target object identifier to be queried to k first position numbers of the Bloom filter, and randomly selects m second position numbers to form a position number set.

[0043] It should be noted that the target object identifier is a single object identifier; the method by which the querying party determines the position number corresponding to the target object identifier is the same as the method by which the position number of the object identifier is determined in the data party.

[0044] Specifically, the querying party uses the above k random mapping functions to process the target object identifiers respectively to obtain k first position numbers. It can be understood that the k random mapping functions can be pre-negotiated by the querying party and the data party, for example, one party sets the k random mapping functions and sends them to the other party.

[0045] In one embodiment, the k random mapping functions are implemented as k hash functions. Accordingly, the querying party may first use the k hash functions to process the target object identifiers respectively to obtain k hash values, and then take the k hash values ​​modulo the length of the Bloom filter respectively to obtain the k first position numbers. Figure 3 For a related example, assuming that the target object is identified as id1, two first position numbers can be obtained, namely 2 and 6. In this way, k first position numbers can be obtained.

[0046] In addition, the querying party also randomly selects m second position numbers to confuse the above k first position numbers. Wherein m is a positive integer, and the specific value can be set according to actual needs. The larger the value, the stronger the security. In one embodiment, m second position numbers can be randomly selected from other position numbers in the Bloom filter except the above k first position numbers. Exemplarily, assuming that the length of the Bloom filter is 10, m=2, and the above k first position numbers are 2 and 6, at this time, 2 second position numbers 1 and 7 can be randomly selected. In this way, m second position numbers can be randomly selected.

[0047] Furthermore, a position number set may be constructed using k first position numbers corresponding to the target object identifier and m second position numbers used for obfuscation. Exemplarily, the position number set is {1, 2, 6, 7}.

[0048] From the above, the querying party can obtain a position number set, so that in step S230, the querying party determines the first ciphertext obtained by homomorphically encrypting the first value for each first position number, and determines the second ciphertext obtained by homomorphically encrypting the second value for each second position number, to form a ciphertext set.

[0049] It can be understood that homomorphic encryption is a form of encryption that allows people to perform specific forms of algebraic operations on ciphertext to obtain a result that is still encrypted, and the result obtained by decrypting it is the same as the result of the same operation on the plaintext.

[0050] It should be noted that the k first position numbers can be one or more. For each first position number, a homomorphic encryption algorithm is used to encrypt the first value, and the ciphertexts obtained by performing different homomorphic encryptions on the first value are usually different. Similarly, the second ciphertexts corresponding to the second position numbers are usually different. In addition, the homomorphic encryption algorithm used in the embodiments of this specification can satisfy additive semi-homomorphism or multiplicative semi-homomorphism, or can satisfy full homomorphism. Exemplarily, the homomorphic encryption algorithm used is Paillier or Elgamal.

[0051] In a preferred embodiment, the first value can be set to a non-zero value (such as 1 or 2), and the second value can be set to a zero value. In this way, the efficiency of subsequent operations can be improved. Exemplarily, the first value and the second value are set to 1 and 0 respectively. At this time, the ciphertext corresponding to the first position number can be uniformly abbreviated as E(1), and the ciphertext corresponding to the second position number can be uniformly abbreviated as E(0). Exemplarily, assuming that the position number set is {1,2,6,7} determined in the above example, where 2 and 6 belong to the first position number of the target object, and 1 and 7 belong to the second position number for obfuscation, at this time, the corresponding ciphertext set can be determined to be {E(0), E(1), E(1), E(0)}.

[0052] From the above, the querying party can determine the ciphertext set corresponding to the position number set. Thus, in step S240, the querying party sends a query request for the target object to the data party, which includes the position number set and the corresponding ciphertext set. Thus, the data party can know the position number set and the ciphertext corresponding to each position number in the position number set. Thus, in step S250, the data party queries the element value of the corresponding position from the Bloom filter according to each position number in the position number set.

[0053] For example, the position number set is {1,2,6,7}, and Figure 3 By querying the Bloom filter shown in , the corresponding element values ​​1, 0, 0, 1 can be obtained.

[0054] Afterwards, in step S260, the data party performs homomorphic operations on the queried element values ​​and the ciphertext set to obtain the query result ciphertext. Specifically, an element value set is formed for the element values ​​queried for each position number in the position number set, thereby performing homomorphic operations on the element value set and the ciphertext set to obtain the query result ciphertext. It should be noted that the algebraic formula of the homomorphic operation can be adaptively designed according to the above-mentioned homomorphic encryption algorithm. In one embodiment, the above-mentioned homomorphic encryption algorithm satisfies additive homomorphism, thereby, the inner product of the element value set and the ciphertext set can be performed to obtain the inner product result. Exemplarily, assuming that the queried element values ​​are 1, 0, 0, 1, and the corresponding ciphertexts are E(0), E(1), E(1), E(0), based on this, the inner product operation can be performed: 1*E(0)+0*E(1)+0*E(1)+1*E(0) to obtain the inner product operation result. It can be seen that according to the properties of additive homomorphism, in fact, 1*E(0)+0*E(1)+0*E(1)+1*E(0)=E(1*0+1*1+0*1+1*0)=E(0). In this way, by performing homomorphic operations on the element value set and the ciphertext set, the first operation result can be obtained.

[0055] Furthermore, in one embodiment, the above-mentioned first operation result can be directly used as the query result ciphertext. In another embodiment, the data party uses the locally generated random number and the first operation result to perform a homomorphic operation, and then uses the obtained operation result as the query result ciphertext. In this way, the leakage of additional information in the Bloom filter can be prevented. In one embodiment, the first operation result is the above-mentioned inner product result. At this time, the random number and the inner product result can be multiplied by plaintext, so that the result of the plaintext multiplication is used as the query result ciphertext. Exemplarily, the random number is denoted as r, and it is assumed that the inner product result is E(0), thereby r*E(0) can be calculated.

[0056] From the above, the data party can obtain the query result ciphertext for the query request. Then, in step S270, the data party sends the query result ciphertext to the query party.

[0057] Therefore, in step S280, the querying party decrypts the received query result ciphertext to obtain the query result plaintext, which indicates whether the target object is located in the object set. It can be understood that the decryption is homomorphic decryption, and the homomorphic decryption method is compatible with the homomorphic encryption method. In addition, the designed discrimination rule, that is, the rule for determining whether the query result indicates that the target object is located in or not located in the object set, is compatible with the above-mentioned homomorphic encryption and homomorphic operation methods.

[0058] According to one embodiment, the first value encrypted to obtain the ciphertext corresponding to the position number of the target object is a non-zero value, and the second value encrypted to obtain the ciphertext corresponding to the obfuscated position number is 0; the third value used for initialization in the above-mentioned Bloom filter is a non-zero value, and the fourth value when the object is inserted is 0. The above-mentioned homomorphic encryption algorithm satisfies additive homomorphism. At this time, the above-mentioned discrimination rule can be designed as follows: if the plaintext of the query result is 0, it indicates that the target object is located in the object set; if the plaintext of the query result is not 0, it indicates that the target object is not located in the object set.

[0059] Exemplarily, the query result ciphertext r*E(0) is decrypted, because r*E(0)=E(r*0)=E(0), thus, the decrypted query result plaintext is 0, at this time, indicating that the target object identifier, such as id1, is in the object list held by the data party. Exemplarily, assuming that the query result ciphertext is r*E(2), the query result plaintext obtained by decryption is 2r, which is not 0, at this time, indicating that the target object identifier is not in the object list held by the data party.

[0060] In this way, the querying party can know whether the target object is in the object list maintained by the data party, such as a blacklist.

[0061] In summary, the query method for business objects disclosed in the embodiments of this specification is adopted. For the scenario of querying whether a certain object is in the object list, a Bloom filter is introduced. Since a random mapping function is used in the Bloom filter, due to the unidirectionality of the random mapping function, there are many possible original images, so that the query party only needs to select a small number of obfuscated position numbers to obtain excellent anonymity effects. At the same time, the data party uses a Bloom filter to process query requests for target objects, which effectively reduces the amount of data involved in the query process, thereby effectively improving the query efficiency; furthermore, homomorphic operations are introduced, and the query party determines the ciphertext corresponding to each target position and each obfuscated position, and the data party performs homomorphic operations on the element values ​​queried for the target position and the obfuscated position and the ciphertext, thereby ensuring that the transmission and calculation of data will not lead to the leakage of data privacy. In this way, effective protection of data privacy in the data party and the query party is achieved, while ensuring high query efficiency.

[0062] Corresponding to the above query method, the embodiments of this specification also disclose a query device. Figure 4 FIG. 1 is a schematic diagram showing a structure of a query device for a business object according to an embodiment, wherein the device is integrated in the query side. Figure 4 As shown, the device 400 includes:

[0063] The position mapping unit 410 is configured to map the target object identifier to be queried to k first position numbers of the Bloom filter; the position random selection unit 420 is configured to randomly select m second position numbers to form a position number set; the position ciphertext determination unit 430 is configured to determine, for each first position number, a first ciphertext obtained by homomorphically encrypting the first value, and for each second position number, determine a second ciphertext obtained by homomorphically encrypting the second value to form a ciphertext set; the query request sending unit 440 is configured to send a query request for the target object to the data party, which includes The ciphertext receiving unit is configured to receive the query result ciphertext, which is obtained by the data party querying the element value of the corresponding position from the Bloom filter according to each position number in the position number set, and performing a homomorphic operation on the queried element value and the ciphertext set; the element value of the Bloom filter is determined according to the position mapped by the identifier of each object in the object set; the decryption unit 450 is configured to decrypt the query result ciphertext to obtain the query result plaintext, which indicates whether the target object is located in the object set.

[0064] In one embodiment, the position mapping unit 410 is specifically configured to: obtain the k first position numbers by respectively processing the target object identifiers using k preset mapping functions.

[0065] In a specific embodiment, the k mapping functions are implemented as k hash functions; the position mapping unit 410 is specifically configured as: using the k hash functions to respectively process the target object identifier to obtain k hash values; taking the k hash values ​​modulo the length of the Bloom filter to obtain the k first position numbers.

[0066] In one embodiment, the second value is 0, and the first value is different from the second value.

[0067] In one embodiment, each element value in the Bloom filter is initialized to a third value, and the element value in the position mapped by the identifier of each object is replaced by a fourth value.

[0068] In a specific embodiment, the fourth value is 0, and the third value is different from the fourth value.

[0069] In a more specific embodiment, when the query result plain text is 0, it indicates that the target object is located in the object set; when the query result plain text is not 0, it indicates that the target object is not located in the object set.

[0070] In one embodiment, the object set consists of business objects in a blacklist.

[0071] In one embodiment, the target object is an individual user or an enterprise user.

[0072] Figure 5 FIG. 2 shows a schematic diagram of a query device for a business object according to another embodiment, wherein the device is integrated in a data source. Figure 5 As shown, the device 500 includes:

[0073] The filter determination unit 510 is configured to determine the element value in the Bloom filter according to the position after the identifier of each object in the object set is mapped to the Bloom filter; the query request receiving unit 520 is configured to receive a query request for the target object from the query party, which includes a position number set and a corresponding ciphertext set; the position number set includes k first position numbers that map the target object identifier to the Bloom filter, and m second position numbers randomly selected; the ciphertext set includes the first ciphertext corresponding to each first position number, which is obtained by homomorphically encrypting the first value, and also includes each The second ciphertext corresponding to the second position number is obtained by homomorphically encrypting the second value; the query unit 530 is configured to query the element value of the corresponding position from the Bloom filter according to each position number in the position number set; the homomorphic operation unit 540 is configured to perform homomorphic operation on the queried element value and the ciphertext set to obtain the query result ciphertext; the result ciphertext sending unit 550 is configured to send the query result ciphertext to the query party, so that the query party decrypts the query result ciphertext to obtain the query result plaintext, which indicates whether the target object is located in the object set.

[0074] In one embodiment, the filter determination unit 510 is specifically configured to: initialize each element value in the Bloom filter to a third value; and set the element value corresponding to the position where the identifier of each object in the object set is mapped to the Bloom filter to a fourth value.

[0075] In a specific embodiment, the filter determination unit 510 is further configured to: process the identifiers of each object separately using k preset mapping functions to obtain k third position numbers; and set the element values ​​in the Bloom filter corresponding to the k third position numbers to the fourth value.

[0076] In one embodiment, the homomorphic operation unit 540 is specifically configured to: for each position number, calculate the first product of the corresponding ciphertext and the corresponding queried element value; and determine the query result ciphertext according to the sum of the first products.

[0077] In one embodiment, the homomorphic operation unit 540 is further configured to: calculate a second product between the sum value and a locally generated random number as the query result ciphertext.

[0078] According to another embodiment, there is also provided a computer-readable storage medium having a computer program stored thereon, which, when executed in a computer, causes the computer to execute a combination of Figure 2 The method described.

[0079] According to another embodiment of the present invention, a computing device is provided, including a memory and a processor, wherein the memory stores executable code, and when the processor executes the executable code, the Figure 2 The method described. Those skilled in the art should be aware that in one or more of the above examples, the functions described in the present invention can be implemented by hardware, software, firmware, or any combination thereof. When implemented by software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium.

[0080] The specific implementation methods described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific implementation method of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solution of the present invention should be included in the scope of protection of the present invention.

Claims

1. A query method for a business object, the method being applied to a querying party, comprising: Map the target object identifier to be queried to k first position numbers of the Bloom filter, and randomly select m second position numbers to form a position number set; For each first position number, determine a first ciphertext obtained by homomorphically encrypting the first value, and for each second position number, determine a second ciphertext obtained by homomorphically encrypting the second value, to form a ciphertext set; Sending a query request for the target object to the data party, including the position number set and the corresponding ciphertext set; Receiving the query result ciphertext, which is obtained by the data party querying the element value of the corresponding position from the Bloom filter according to each position number in the position number set, and performing homomorphic operation on the queried element value and the ciphertext set; the element value of the Bloom filter is determined according to the position mapped by the identifier of each object in the object set; The query result ciphertext is decrypted to obtain a query result plaintext, which indicates whether the target object is located in the object set.

2. The method according to claim 1, wherein: Mapping the target object identifier to be queried to the k first position numbers of the Bloom filter includes: The k first position numbers are obtained by respectively processing the target object identifiers using k preset mapping functions.

3. The method according to claim 2, wherein: The k mapping functions are implemented as k hash functions; wherein the k first position numbers are obtained by respectively processing the target object identifiers using the preset k mapping functions, including: Using the k hash functions to process the target object identifiers respectively to obtain k hash values; The k hash values ​​are respectively modulo the length of the Bloom filter to obtain the k first position numbers.

4. The method according to claim 1, wherein: The second value is 0, and the first value is different from the second value.

5. The method according to claim 1, wherein: Each element value in the Bloom filter is initialized to a third value, and the element value in the position mapped by the identifier of each object is replaced by a fourth value.

6. The method according to claim 5, wherein: The fourth value is 0, and the third value is different from the fourth value.

7. The method according to claim 6, wherein: When the query result plain text is 0, it indicates that the target object is located in the object set; when the query result plain text is not 0, it indicates that the target object is not located in the object set.

8. The method according to claim 1, wherein: The object set consists of business objects in the blacklist.

9. The method according to claim 1, wherein: The target object is an individual user or an enterprise user.

10. A query method for a business object, the method being applied to a data entity, comprising: Determine the element value in the Bloom filter according to the position after mapping the identifier of each object in the object set to the Bloom filter; Receive a query request for a target object from a query party, which includes a position number set and a corresponding ciphertext set; the position number set includes k first position numbers that map the target object identifier to the Bloom filter, and m second position numbers that are randomly selected; the ciphertext set includes a first ciphertext corresponding to each first position number, which is obtained by homomorphically encrypting the first value, and also includes a second ciphertext corresponding to each second position number, which is obtained by homomorphically encrypting the second value; According to each position number in the position number set, query the element value of the corresponding position from the Bloom filter; Performing homomorphic operations on the queried element value and the ciphertext set to obtain the query result ciphertext; The query result ciphertext is sent to the query party, so that the query party decrypts the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

11. The method according to claim 10, wherein: Determining the element value in the Bloom filter according to the position after mapping the identifier of each object in the object set to the Bloom filter includes: Initializing each element value in the Bloom filter to a third value; The element value corresponding to the position where the identifier of each object in the object set is mapped to the Bloom filter is set to the fourth value.

12. The method according to claim 11, wherein: Mapping the identifier of each object in the object set to the element value corresponding to the position of the Bloom filter to the fourth value includes: For the identification of each object, use k preset mapping functions to process it respectively to obtain k third position numbers; The element values ​​corresponding to the k third position numbers in the Bloom filter are set to the fourth value.

13. The method according to claim 10, wherein: Perform homomorphic operations on the queried element value and the ciphertext set to obtain the query result ciphertext, including: For each position number, calculate a first product of the corresponding ciphertext and the corresponding queried element value; The query result ciphertext is determined according to the sum of the first products.

14. The method according to claim 13, wherein: Determining the query result ciphertext according to the sum of the first products includes: A second product between the sum value and a locally generated random number is calculated as the query result ciphertext.

15. A query device for a business object, the device being integrated in a querying party, comprising: A position mapping unit, configured to map the target object identifier to be queried to k first position numbers of the Bloom filter; A position random selection unit is configured to randomly select m second position numbers to form a position number set; a position ciphertext determination unit configured to determine, for each first position number, a first ciphertext obtained by homomorphically encrypting the first value, and, for each second position number, determine a second ciphertext obtained by homomorphically encrypting the second value, to form a ciphertext set; A query request sending unit, configured to send a query request for a target object to a data party, including the position number set and the corresponding ciphertext set; A result ciphertext receiving unit is configured to receive the query result ciphertext, which is obtained by the data party after querying the element value of the corresponding position from the Bloom filter according to each position number in the position number set, and performing a homomorphic operation on the queried element value and the ciphertext set; the element value of the Bloom filter is determined according to the position mapped by the identifier of each object in the object set; The decryption unit is configured to decrypt the query result ciphertext to obtain a query result plaintext, which indicates whether the target object is located in the object set.

16. A query device for a business object, the device being integrated in a data entity, comprising: a filter determination unit configured to determine an element value in the Bloom filter according to a position after mapping an identifier of each object in the object set to the Bloom filter; A query request receiving unit is configured to receive a query request for a target object from a querying party, the query request including a position number set and a corresponding ciphertext set; the position number set includes k first position numbers that map the target object identifier to the Bloom filter, and m second position numbers that are randomly selected; the ciphertext set includes a first ciphertext corresponding to each first position number, which is obtained by homomorphically encrypting the first value, and also includes a second ciphertext corresponding to each second position number, which is obtained by homomorphically encrypting the second value; A query unit, configured to query an element value at a corresponding position from the Bloom filter according to each position number in the position number set; A homomorphic operation unit configured to perform a homomorphic operation on the queried element value and the ciphertext set to obtain a query result ciphertext; The result ciphertext sending unit is configured to send the query result ciphertext to the query party, so that the query party decrypts the query result ciphertext to obtain a query result plaintext indicating whether the target object is located in the object set.

17. A computer-readable storage medium having a computer program stored thereon, wherein: When the computer program is executed in a computer, the computer is caused to execute the method according to any one of claims 1 to 14.

18. A computing device comprising a memory and a processor, wherein: The memory stores executable codes, and when the processor executes the executable codes, the method according to any one of claims 1 to 14 is implemented.