A method, system, device and storage medium for improving online efficiency of privacy queries

By decomposing privacy queries into offline and online stages, and using intermediate values ​​to quickly determine the database data location and decrypt the query data, the inefficiency problem of existing technologies is solved, and efficient privacy queries and privacy protection are achieved.

CN114186103BActive Publication Date: 2025-10-14CHINA ZHESHANG BANK
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202111459494.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-02
Publication Date
2025-10-14
Estimated Expiration
2041-12-02

AI Technical Summary

Technical Problem

Existing privacy query algorithms are inefficient in large databases, especially because they need to traverse all data, resulting in a complexity of O(n), which cannot meet practical application requirements.

Method used

The privacy query is decomposed into two parts: offline and online. In the offline stage, the intermediate value of the full data is obtained through the algorithm. In the online stage, the intermediate value is used to quickly determine the data location and request the data, and the query data is decrypted in combination with the intermediate value of the offline stage.

Benefits of technology

It improves the efficiency of privacy queries, reduces the computational complexity of the online stage, saves offline computing workload during repeated queries, and meets the needs of financial services and privacy protection.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114186103B_ABST
    Figure CN114186103B_ABST
Patent Text Reader

Abstract

The application discloses a method, system, device and storage medium for improving online efficiency of privacy query, specifically, the privacy query is divided into offline and online two parts, the offline part refers to that the user query is carried out offline to prepare relevant data and calculate, and the online part refers to that the data is requested in real time on the database. In the offline part, the client obtains the 'intermediate value' of the full data through an algorithm, in the online stage, the client knows the position of the data to be queried in the database through the 'intermediate value', the client initiates a request to the database to obtain the data, and the data items to be queried are obtained through the combination of the previous intermediate value. The application can protect the privacy of data query and improve the efficiency of data query. The efficiency bottleneck of database privacy query is solved, and the demand of financial business privacy protection can be well supported. Especially when the bank jointly models and portraits the customers and enterprises, the privacy and performance can be ensured.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of database query, and in particular to a method, system, device and storage medium for improving the online efficiency of privacy query. Background Art

[0002] A private query on a database refers to querying something on the database without leaving any clues for others to know the query content. The current existing privacy query algorithm needs to traverse all data, so the algorithm complexity is O(n). In practical applications, especially in large databases, efficiency becomes a bottleneck. The present invention proposes a database private query algorithm that can improve the efficiency of private queries. Specifically, it decomposes the private query into two parts, offline and online. In the offline part, the client obtains the "intermediate value" of the full data through the algorithm. In the online stage, the client knows the location of the data to be queried in the database through the "intermediate value". The client initiates a request to the data segment to obtain the data. By combining the previous intermediate value, the data item to be queried is obtained, thereby realizing private query and improving query efficiency. The algorithm complexity is Summary of the Invention

[0003] This invention addresses the shortcomings of existing technologies and proposes a method for improving the efficiency of privacy queries. Specifically, this method breaks privacy queries into two parts: offline and online. The offline part involves the offline data preparation and calculations performed by the user query, while the online part involves real-time data requests from the database. In the offline part, the client uses an algorithm to obtain the "intermediate value" of the full data set. In the online part, the client uses this "intermediate value" to determine the location of the data to be queried in the database. The client then initiates a request to the database, combining the previously obtained intermediate values ​​to obtain the desired data item.

[0004] The object of the present invention is achieved through the following technical solutions: a method for improving the online efficiency of privacy query, which is divided into an online stage and an offline stage;

[0005] (1) Offline stage: The user initiates a request to query the target data ID in the database and obtains the intermediate value from the database. The data in the database is x = (x1,...,x n )∈{0,1} n Specifically:

[0006] (1.1) The user randomly selects from the database index {1,…,n} A set of disjoint database indexes, denoted as Each S j There are database index value, and Send to offline server;

[0007] (1.2) The offline server performs a j Calculate the median value x i Represents the i-th data in the database, Send to the user;

[0008] (1.3) User save and

[0009] (2) Online stage: After the user obtains the query results from the database, they can quickly decrypt them by combining the intermediate values ​​in the offline stage; the details are as follows:

[0010] (2.1) The user finds the set S containing the index i of the query target j , and calculate:

[0011]

[0012] (2.2) User in S j Remove the i * elements, and remove the set S of elements j 'Send to the online server;

[0013] (2.3) Online server computing

[0014] (2.4) Finally, the user calculates x i =m j -a mod 2, get the decrypted query data.

[0015] Furthermore, the offline phase refers to the offline data preparation and calculation work of user queries, and the online phase refers to the real-time data request from the user to the database.

[0016] Furthermore, the intermediate values ​​obtained in the offline phase can be reused, saving the workload of offline calculation again when the query results are repeatedly requested.

[0017] The present invention also provides a system for improving the online efficiency of privacy query, which includes an offline module and an online module;

[0018] The offline module includes an index value acquisition unit and an offline server;

[0019] The index value acquisition unit is used to randomly select from the database index {1, ..., n} A set of disjoint database indexes, denoted as Each S j There are database index value, and sending to an offline server;

[0020] The offline server calculates an intermediate value for each S j calculating an intermediate value x i represents the i-th data in the database, and sending to the user;

[0021] The online module includes an index set calculation unit and an online server;

[0022] The index set calculation unit is used to obtain a set S j containing the index i of the query target, and calculate:

[0023]

[0024] Remove the i j element in S * , and send the set S j ' without the element to the online server;

[0025] The online server calculates and sends the result to the user, and the user calculates x i = m j -a mod 2 to obtain the decrypted query data.

[0026] Further, the offline module is used for user query offline data preparation and calculation work, and the online module is used for user real-time data request on the database.

[0027] Further, the intermediate value obtained by the offline module can be reused, and the workload of offline calculation is saved when the query result is repeated.

[0028] The application also provides a device, which comprises:

[0029] One or more processors;

[0030] Memory for storing one or more programs;

[0031] When the one or more programs are executed by the one or more processors, the one or more processors execute the above-mentioned method for improving online efficiency of privacy query.

[0032] The application also provides a computer-readable storage medium for storing one or more computer programs, wherein the one or more computer programs comprise program codes, and when the computer program runs on a computer, the program codes are used to execute the above-mentioned method for improving online efficiency of privacy query.

[0033] Beneficial effects of the present invention: The present invention proposes a method for improving the efficiency of privacy query, which can protect the privacy of data query and improve the efficiency of data query. The complexity of the database privacy query algorithm is This solution addresses the bottleneck in database privacy query efficiency and effectively supports the privacy protection needs of financial services. This is especially true when banks conduct joint modeling and profiling of customers and businesses, ensuring both privacy and performance. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 Schematic diagram of the process of the present invention. DETAILED DESCRIPTION

[0035] The specific embodiments of the present invention are further described in detail below with reference to the accompanying drawings.

[0036] like Figure 1 As shown, the method for improving the online efficiency of privacy query provided by the present invention is divided into an online stage and an offline stage;

[0037] In the offline phase, users request the target data ID and obtain the intermediate value from the database;

[0038] In the online phase, after the user obtains the query results from the database server, they can quickly decrypt them in combination with the intermediate values ​​in the offline phase.

[0039] In this way, computationally intensive tasks are completed offline. Intermediate values ​​generated offline can be reused, eliminating the need for offline computations when querying results repeatedly. This significantly increases the efficiency of privacy-focused computing algorithms.

[0040] For example, there is an offline server and an online server, both servers are connected to a database, and the data is x=(x1,...,x n )∈{0,1} n .

[0041] The offline steps are as follows:

[0042] 1. User randomly selects from database index {1,…,n} A set of disjoint database indexes, denoted as Each S j There are database index value, and Send to offline server;

[0043] 2. Offline server for each S j Calculate the median value x i Represents the i-th data in the database, Send to the user;

[0044] 3. User save and

[0045] The online steps are as follows:

[0046] 1. The user finds a set S containing the target index i j , the user first calculates:

[0047]

[0048] Target i in S j The probability of the set is Then i is not in S j The probability of

[0049] 2.Users in S j Remove the i * elements, and remove the set S of elements j 'Send to the online server;

[0050] 3. Online Server Computing Because S j Only elements, so the time complexity of the online step is

[0051] 4. Finally, the user calculates x i =m j -a mod 2, get the decrypted query data.

[0052] On the other hand, the present invention also provides a system for improving the online efficiency of privacy query, which includes an offline module and an online module;

[0053] The offline module includes an index value acquisition unit and an offline server;

[0054] The index value acquisition unit is used to randomly select from the database index {1, ..., n} A set of disjoint database indexes, denoted as Each S j There are database index value, and Send to offline server;

[0055] The offline server is responsible for each S j Calculate the median value x i Represents the i-th data in the database, Send to the user;

[0056] The online module includes an index set calculation unit and an online server;

[0057] The index set calculation unit is configured to obtain a set S containing an index i of a query target j , and calculate:

[0058]

[0059] In S j , remove the i * element, and send the set S j ' with the removed element to the online server;

[0060] The online server calculates and sends the result to the user, who calculates x i = m j -a mod 2 to obtain the decrypted query data.

[0061] A specific application of the present application is as follows:

[0062] As a representative of traditional financial institutions, banks must involve joint modeling with external data in the evolution of technology empowerment. First, banks find that the inventory users need to complete the portrait label in order to serve the loss recall and cross-marketing scenarios, which is very dependent on external data of the bank. And private query can ensure that the bank avoids user information caching when querying external data. And small and micro enterprise loans and other scenarios of credit assessment of individuals or enterprises also need to rely on external data sources for joint modeling evaluation. Private query can prevent customer information leakage, and the method for improving the efficiency of private query can improve system efficiency.

[0063] In the management of the mother fund, the real return of each fund needs to be calculated. The fund's holding information is a very important private information, which represents the fund's value judgment and strategy orientation, and is also the core secret of the fund company. The contradiction here is that on the one hand, the mother fund needs information sharing for management, on the other hand, the fund itself needs to protect these commercial information, and the traditional method will inevitably lead to the fact that the demands of one party cannot be met. Using private query technology can meet the interests of both parties, and even make the fund information effectively government-regulated to prevent market structural risks, while ensuring that commercial information is not leaked. The method for improving the efficiency of private query can improve the performance of private query, and thus improve the overall response speed and throughput of the system.

[0064] In particular, according to embodiments disclosed herein, the method for improving the efficiency of online privacy queries described in any of the above embodiments can be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program including program code for executing the method for improving the efficiency of online privacy queries.

[0065] As another aspect, the present application further provides a computer-readable storage medium, which may be included in the system of the above-described embodiment, or may be a standalone computer-readable storage medium not incorporated into a device. The computer-readable storage medium stores one or more programs, which are used by one or more processors to execute a method for improving the efficiency of online privacy queries described in the present application.

[0066] Those skilled in the art will appreciate that the embodiments of the present application can be provided as methods, systems or computer program products. Therefore, the present application can adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0067] The present application is described with reference to a method for improving the efficiency of online privacy queries, a system for improving the efficiency of online privacy queries, and a flowchart and / or block diagram of a computer program product according to an embodiment of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the process Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0068] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0069] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 The steps for the function specified in one or more boxes.

[0070] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered by the scope of protection of the claims of the present invention.

Claims

1. A method for improving the efficiency of online privacy query, characterized in that: Divided into online stage and offline stage; (1) Offline stage: The user initiates a request to query the target data ID in the database and obtains the intermediate value from the database. The data in the database is x = (x1, ..., x n )∈{0,1} n Specifically: (1.1) The user randomly selects from the database index {1, ..., n} A set of disjoint database indexes, denoted as Each S j There are database index value, and Send to offline server; (1.2) The offline server performs a j Calculate the median value x i Represents the i-th data in the database, Send to the user; (1.3) User save and (2) Online stage: After the user obtains the query results from the database, they can quickly decrypt them by combining the intermediate values ​​in the offline stage; the details are as follows: (2.1) The user finds the set S containing the index i of the query target j , and calculate: (2.2) User in S j Remove the i * elements, and remove the set S of elements j 'Send to the online server; (2.3) Online server computing (2.4) Finally, the user calculates x i =m j -a mod 2, get the decrypted query data.

2. A method for improving the online efficiency of privacy query according to claim 1, characterized in that: The offline phase refers to the offline data preparation and calculation work of user queries, and the online phase refers to the real-time data request from the database by the user.

3. The method for improving the online efficiency of privacy query according to claim 1, characterized in that: The intermediate values ​​obtained during the offline phase can be reused, saving the workload of offline calculation again when the query results are repeatedly requested.

4. A system for improving the efficiency of online privacy queries, characterized by: The system includes offline modules and online modules; The offline module includes an index value acquisition unit and an offline server; The index value acquisition unit is used to randomly select from the database index {1, ..., n} A set of disjoint database indexes, denoted as Each S j There are database index value, and Send to offline server; The offline server is responsible for each S j Calculate the median value x i Represents the i-th data in the database, Send to the user; The online module includes an index set calculation unit and an online server; The index set calculation unit is used to obtain a set S of indexes i containing the query target j , and calculate: In S j Remove the i * elements, and remove the set S of elements j 'Send to the online server; The online server calculates And send the result to the user, the user calculates x i =m j -a mod2, get the decrypted query data.

5. The system for improving online privacy query efficiency according to claim 4, characterized in that: The offline module is used for user queries to perform related data preparation and calculation work offline, and the online module is used for users to request data from the database in real time.

6. The system for improving online privacy query efficiency according to claim 4, characterized in that: The intermediate values ​​obtained by the offline module can be reused, saving the workload of offline calculation again when the query result is repeated.

7. A device, characterized in that The device comprises: one or more processors; a memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors are caused to perform the method according to any one of claims 1 to 3.

8. A computer-readable storage medium for storing one or more computer programs, wherein the one or more computer programs include program codes. When the computer programs are run on a computer, the program codes are used to execute the method for improving the online efficiency of privacy queries as described in any one of claims 1 to 3.

Citation Information

Patent Citations

  • Inter-mechanism real-time private data query method and device and storage medium

    CN113672980A

  • Methods and Systems for Prioritizing Entities in Search Results

    US20180150525A1