Dynamic updating method for preprocessing PIR of single server
By introducing incremental preprocessing technology and dynamic update of Hint tables, the problem of redoing offline preprocessing when database changes in the existing technology is solved, dynamic updates of the database and efficient privacy protection are realized, and communication costs and storage space are reduced. need.
Patent Information
- Application Number
- CN202410967920.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-18
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-07-18
AI Technical Summary
When the existing single-server preprocessing PIR technology changes, it is necessary to re-use the high-cost offline preprocessing stage, resulting in increased communication costs and client storage space, and cannot support the dynamic update operation of the database.
Introducing incremental preprocessing technology, during the dynamic database update stage, the server judges the number of update operations, feedbacks the update results to the client, and the client updates the main hint table and the alternate hint table, supports the database addition, deletion and modification operations, and uses alternate in the update stage. The hint table replaces the consumption item and generates a new backup item when it re-enters the offline preprocessing phase.
It reduces the total communication cost and client computing time, reduces the client storage space requirements, and realizes dynamic update operations of the database. The update cost is proportional to the database changes rather than to the database size.
Smart Images

Figure CN118964367A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of network security, and in particular relates to a dynamic updating method for preprocessing PIR of a single server. Background Art
[0002] Private Information Retrieval (PIR) is a privacy-preserving technique that aims to allow users to retrieve information from a database without revealing the specific information content they are retrieving. In today's cloud-based information systems, many files and databases are stored on external data storage servers, a trend that is increasing. Although outsourcing databases can save maintenance costs and improve information retrieval efficiency, their security and confidentiality face significant risks. PIR imposes a computationally linear lower bound because the database must operate on all objects to answer a query. After all, omitting even one object when answering a query would leak that the client is not interested in that object. To address this issue, one existing PIR technology route follows the idea of preprocessing the database in an offline phase to generate hints, which are then used in the online phase to answer one or more queries through sublinear computation and communication. "PIANO: Extremely Simple, Single-Server PIR with Sublinear Server Computation," constructs a single-server preprocessed Private Information Retrieval (PIR) scheme with sublinear overhead that strikes an optimal trade-off between client storage and server computation. It achieves The server and client share the computation and Online communication and requires Client-side storage. Unlike previous single-server PIR schemes that rely on heavy encryption mechanisms (such as homomorphic encryption), this scheme relies only on pseudo-random functions (PRFs). In the offline preprocessing phase, the client downloads the entire database block by block in a streaming manner, and uses the pseudo-random function (PRF) key to generate an offset vector for each data block to construct the main hint table and the backup hint table. In the online query phase, the client determines the data block and pseudo-random offset vector where the query element is located, and sends the processed pseudo-random set to the server. The server returns the corresponding element set, and the client recovers the required element through XOR operation. In the update phase, the client replaces the consumed items in the main hint table with the backup hint table. The backup hint table prepared in the preprocessing phase supports multiple queries, achieving efficient privacy-preserving queries and updates. PIANO is the first practical single-server sublinear time PIR scheme, with performance 10-300 times higher than the state-of-the-art single-server PIR. Compared with the most famous dual-server PIR scheme, PIANO has comparable performance and is much simpler in construction.
[0003] However, if the database changes, the costly offline phase must be redone under all existing schemes. Prior art literature Zhou, A. Park, W. Zheng and E. Shi, "PIANO: Extremely Simple, Single-Server PIR with Sublinear Server Computation," in 2024 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 2024 pp. 58-58. Appendix A.2. Supporting Dynamic Databases discloses an update scheme with high communication overhead: each time Q is updated, a preprocessing phase needs to be performed for a database of size Q. Each time 2Q is updated, a preprocessing phase needs to be performed for a database of size 2Q. And so on, the total communication cost is high. Local storage overhead: Each time the client performs the preprocessing phase for a layer, additional local space is required to store hints, and the local space of the client increases. Summary of the invention
[0004] In order to solve the above problems existing in the prior art, the present invention provides a method for dynamically updating a single server preprocessing PIR. The technical problem to be solved by the present invention is achieved by the following technical solutions:
[0005] The present invention provides a method for dynamically updating a single server preprocessing PIR, comprising:
[0006] In the offline preprocessing stage, the client downloads a data block from the server and extracts the elements of the data block from the downloaded data block according to the pre-generated offset vector; the main hint table and the backup hint table are constructed using the elements extracted from all data blocks;
[0007] In the database dynamic update stage, the server determines whether the number of update operations on its own database has reached Q times. If so, it feeds back the update result of the database to the client; the client updates its own main hint table and backup hint table according to the update result;
[0008] In the online query stage, the client determines the data block where the element to be queried is located and its offset vector, removes the offset vector of the element position from the pseudo-random set and sends it to the server, and the server traverses all possible positions to obtain the corresponding element set; the client performs an XOR operation on the elements in the element set to restore the element to be queried;
[0009] In the update phase, the client updates the item corresponding to the element to be queried in the main hint table, and replaces the item corresponding to the element to be queried with a spare item in the spare hint table; when the items in the spare hint table are exhausted, the offline preprocessing phase is re-entered.
[0010] Beneficial effects:
[0011] The present invention provides a method for dynamically updating a single-server preprocessed PIR, including an offline preprocessing stage, a database dynamic update stage, an online query stage, and an update stage. Based on the existing single-server preprocessing private information retrieval solution piano, the present invention adds support for dynamic database operations and supports database addition, deletion, and modification operations. Unlike the heavy preprocessing work of the comparative solution, the present invention introduces incremental preprocessing technology, allowing the original preprocessing to continue to be used after the database is changed, while generating an update cost proportional to the number of changes, rather than proportional to the size of the database. Compared with the prior art, the present invention reduces the total communication cost, client computing time, and client storage space.
[0012] The present invention will be further described in detail below with reference to the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0013] Figure 1 It is a flow chart of a method for dynamically updating a single server preprocessing PIR provided by the present invention;
[0014] Figure 2 It is a structural schematic diagram of a method for dynamically updating a single server preprocessing PIR provided by the present invention;
[0015] Figure 3 The latest update operation provided by the present invention is the processing flow intention of the increase operation. DETAILED DESCRIPTION
[0016] The present invention is further described in detail below with reference to specific embodiments, but the embodiments of the present invention are not limited thereto.
[0017] Combination Figures 1 to 3 The present invention provides a method for dynamically updating a single server preprocessing PIR, comprising:
[0018] In the offline preprocessing stage, the client downloads a data block from the server and extracts the elements of the data block from the downloaded data block according to the pre-generated offset vector; the main hint table and the backup hint table are constructed using the elements extracted from all data blocks;
[0019] In this stage, the client downloads data blocks from the server's database in a streaming manner and stores them locally. The database includes multiple data blocks. Each time a data block is downloaded, the data block is processed according to a pre-generated pseudo-random offset vector set to extract the corresponding elements from the data block. The data blocks after processing are deleted from the local computer. The main hint table and the backup hint table are constructed using the elements of all data blocks.
[0020] It is worth noting that each time a data block is downloaded, the client processes the data block. The processing process requires the use of the PRF key to generate a pseudo-random offset vector in advance, and the processing process is repeated until the data block is processed. Of course, the main hint table and the backup hint table will be constructed during the processing.
[0021] In the database dynamic update stage, the server determines whether the number of update operations on its own database has reached Q times. If so, it feeds back the update result of the database to the client; the client updates its own main hint table and backup hint table according to the update result;
[0022] It is worth noting that when the database changes, the server checks these updates every time a certain number of update operations are accumulated or a query request is received. The server sends the latest operation on the same element to the client. For the add operation, the server sends the newly added data item, and the client increases the number of columns of the pseudo-random offset vector. If the pseudo-random offset vector of the data item is in the pseudo-random set, the main hint table and the backup hint table are updated at the same time. For the replace operation, the client updates the main hint table and the backup hint table according to the change of the new and old values. For the delete operation, the client updates the main hint table and the backup hint table according to the deleted data.
[0023] In the online query stage, the client determines the data block where the element to be queried is located and its offset vector, removes the offset vector of the element position from the pseudo-random set and sends it to the server, and the server traverses all possible positions to obtain the corresponding element set; the client performs an XOR operation on the elements in the element set to restore the element to be queried;
[0024] It is worth noting that the client determines the data block where the element to be queried is located and its pseudo-random offset vector. The client queries the pseudo-random set where the element is located. After removing the pseudo-random offset vector of the element, the pseudo-random set is sent to the server. The server traverses all possible positions, calculates and sends back the corresponding database element set. The client uses this data to restore the value of the required element through XOR operation.
[0025] In the update phase, the client updates the item corresponding to the element to be queried in the main hint table, and replaces the item corresponding to the element to be queried with a spare item in the spare hint table; when the items in the spare hint table are exhausted, the offline preprocessing phase is re-entered.
[0026] It is worth noting that the client updates the consumed items in the main hint table. It replaces the used items in the main hint table with a backup hint from the backup hint table. When the backup hint table is exhausted, the preprocessing operation needs to be performed again.
[0027] Based on the existing single-server preprocessing private information retrieval (PIR) solution piano, the present invention adds support for dynamic database operations and supports database addition, deletion and modification operations. Unlike the existing solutions that perform heavy preprocessing work multiple times, the present invention introduces incremental preprocessing technology of pseudo-random offset vector sets, allowing the original preprocessing to continue to be used after the database is changed, while generating an update cost proportional to the number of changes, rather than proportional to the size of the database. Compared with the existing solutions, the total communication cost, client computing time and client storage space are reduced.
[0028] In a specific implementation of the present invention, the process of generating a pseudo-random offset vector set includes:
[0029] Select M 1 PRF keys, expressed as
[0030] in, α(κ) represents a function greater than any constant. As the predetermined parameter κ increases, the value of the α(κ) function also increases. n represents the total number of elements of all data blocks. Θ() represents the asymptotic tight bound of the function in the brackets.
[0031] For M1 Any of the PRF keys The key sk is used to generate a pseudo-random offset vector of the main hint table, expressed as
[0032] in, Indicates the use of secret key sk to input data As a result of encryption, the output range of PRF is represents a pseudo-random offset vector in each data block;
[0033] for Select M 2 PRF keys, expressed as
[0034] Among them, M 2 = Θ(logκ·α(κ));
[0035] For M 2 Any of the PRF keys Using this secret key Generate a pseudo-random offset vector for the backup hint table, expressed as:
[0036]
[0037] In a specific implementation of the present invention, constructing the main hint table and the backup hint table using elements of all data blocks includes:
[0038] Initialize the element values of all positions in the main hint table 0 and initialize the element values of all positions in the backup hint table is 0;
[0039] The elements p of all data blocks j Fill in the main hint table according to the corresponding position to get the main hint table, indicating
[0040]
[0041] All elements of the data block Fill in the backup hint table according to the corresponding position to obtain the backup hint table, which is expressed as
[0042] Each data block is represented as The mapping of data blocks and corresponding pseudo-random offset vectors in the database is a Set variable. All Set variables corresponding to the client constitute a Set variable set expressed as:
[0043]
[0044] In a specific implementation of the present invention, during the database dynamic update phase,
[0045] The server determines whether the number of update operations on its own database has reached Q times. If so, it sends the latest update operation of the same element in the data block and the corresponding data item to the client;
[0046] Among them, the latest update operations include add operation, replace operation and delete operation;
[0047] If the client determines that the latest update operation is an increment operation, a pseudo-random offset vector is generated in response to the increment operation to generate an additional item, and determines whether the generated additional item is in the Set variable set in the database. If so, the main hint table and the backup hint table are updated, otherwise, they are not updated; if the latest update operation is a replacement operation, the main hint table and the backup hint table are updated according to the change between the new and old values; if the latest update operation is a delete operation, the delete operation is executed to delete the corresponding data, and the main hint table and the backup hint table are updated.
[0048] It is worth noting that when the database is changed, Every time Q update operations are accumulated (if the client initiates a query request, it will be sent immediately even if it is less than Q times), the server checks these Q updates, takes the latest operation of the same operation before and after the same element, and then replaces {(index, pre_val, val) j} j∈Q Sent to the client (if it is an addition operation, pre_val is 0, if it is a deletion operation, val is ⊥).
[0049] In a specific implementation of the present invention, during the database dynamic update phase,
[0050] refer to Figure 3 , the server determines whether the number of update operations on its own database has reached Q times,
[0051]
[0052] If the number of update operations reaches Q, then for the same operation before and after the same element in the data block, take the latest update operation and the corresponding data item {(index, pre_val, val) j} j∈Q Sent to the client; index represents the subscript value of the element being changed, pre_val represents the value of the element before it is changed, and val represents the value of the element after it is changed. If the latest update operation is an addition operation, pre_val is 0, and if it is a deletion operation, val is ⊥;
[0053] The client receives the corresponding data item {(index, pre_val, val) j} j∈Q Afterwards, determine whether the latest update operation is an add operation, a replace operation, or a delete operation;
[0054] If it is an increase operation, add the m data items as needed data blocks; for each sk in the main hint table and the backup hint, a k-column pseudo-random offset vector is generated for each Set variable, expressed as:
[0055] After generating k columns of pseudo-random offset vectors, if Then update the main hint table and the backup hint table;
[0056] It is worth noting that if the server database performs an increase operation, assuming that m data items are added, that is, data blocks, the client performs an incremental update operation on the set for each sk, that is, each set generates k columns of pseudo-random offset vectors.
[0057] If it is a replacement operation, then index is in In the data blocks, for each sk, if Then update the main hint table and the backup hint table;
[0058] If it is a delete operation, the index is in In the data blocks, for each sk,
[0059] Then update the main hint table and the backup hint table.
[0060] In a specific implementation of the present invention, during the online query phase,
[0061] The client determines that it needs to query the element with the index x in the database and the corresponding pseudo-random offset vector, where x is in the In the data blocks, the i-th * The pseudo-random offset vector of the data block is δ i =
[0062]
[0063] Select the Set variable and select the i * Pseudo-random offset vector δ of the data block i Corresponding multiple Set variables Remove the i* Worth it Send to the server;
[0064] The server utilizes Traverse its own database to determine the i-th * The position of the value in the database, based on which δ i The mapped Set variable is obtained by XORing all the values in the Set variable. Results Send to the client;
[0065] It is worth noting that since the server does not know which position the value to be removed is, it will traverse all possible positions, and correspondingly restore the pseudo-random offset vector to the actual index value of the database, and XOR all the index value data, and there is a total of Results Sent to the client.
[0066] In the sent to the client In the results,
[0067]
[0068]
[0069] …
[0070]
[0071] …
[0072]
[0073] The client follows right XOR the result to get the element with subscript x.
[0074] In a specific implementation of the present invention, replacing an item corresponding to an element to be queried with a certain spare item in the spare hint table includes:
[0075] Select the i-th * Alternatives And according to the formula XOR, replace the item corresponding to the element queried in the main hint table with the XOR result.
[0076] It is worth noting that since one item in the main hint table is consumed during the online query phase (it loses privacy after being sent to the server and cannot be used again), it is now updated and replaced. * Select from the backup hint table use Replace the corresponding entry in the main hint table.
[0077] It is worth noting that the terms "first" and "second" in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.
[0078] Although the present application is described herein in conjunction with various embodiments, in the process of implementing the claimed application, those skilled in the art may understand and implement other variations of the disclosed embodiments by reviewing the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "an" does not exclude a plurality of components or steps.
[0079] The above contents are further detailed descriptions of the present invention in combination with specific preferred embodiments, and it cannot be determined that the specific implementation of the present invention is limited to these descriptions. For ordinary technicians in the technical field to which the present invention belongs, several simple deductions or substitutions can be made without departing from the concept of the present invention, which should be regarded as falling within the protection scope of the present invention.
Claims
1. A method for dynamically updating a single server preprocessing PIR, characterized in that: include: In the offline preprocessing stage, the client downloads the data block from the server and extracts the elements of the data block from the downloaded data block according to the pre-generated offset vector; Construct the main hint table and the backup hint table using the elements extracted from all data blocks; In the database dynamic update stage, the server determines whether the number of update operations on its own database has reached Q times. If so, it feeds back the update result of the database to the client; The client updates its own main hint table and backup hint table according to the update result; In the online query stage, the client determines the data block where the element to be queried is located and its offset vector, removes the offset vector of the element position from the pseudo-random set and sends it to the server, and the server traverses all possible positions to obtain the corresponding element set; the client performs an XOR operation on the elements in the element set to restore the element to be queried; In the update phase, the client updates the item corresponding to the element to be queried in the main hint table, and replaces the item corresponding to the element to be queried with a spare item in the spare hint table; when the items in the spare hint table are exhausted, the offline preprocessing phase is re-entered.
2. The method for dynamically updating a single server preprocessing PIR according to claim 1, characterized in that: In the offline preprocessing stage, the client performs the following process: Downloading a data block from a database of a server in a streaming manner and storing the data block locally, wherein the database includes a plurality of data blocks; Each time a data block is downloaded, the data block is processed according to a pre-generated pseudo-random offset vector set to extract corresponding elements from the data block; Delete the data blocks from the local after processing; The main hint table and the backup hint table are constructed using the elements of all data blocks.
3. The method for dynamically updating a single server preprocessing PIR according to claim 2, characterized in that: The process of generating a pseudo-random offset vector set includes: Select M1 PRF keys, expressed as in, α(κ) represents a function greater than any constant. As the predetermined parameter κ increases, the value of the α(κ) function also increases. n represents the total number of elements of all data blocks. Θ() represents the asymptotically tight bound of the function in the brackets. For any of the M1 PRF keys Exploiting the key Generate a pseudo-random offset vector for the main hint table, expressed as in, Indicates the use of secret key sk to input data As a result of encryption, the output range of PRF is represents a pseudo-random offset vector in each data block; for Select M2 PRF keys, expressed as Among them, M2=Θ(logκ·α(κ)); For any of the M2 PRF keys Using this secret key Generate a pseudo-random offset vector for the backup hint table, expressed as:
4. The method for dynamically updating a single server preprocessing PIR according to claim 3, characterized in that: The construction of the main hint table and the backup hint table using the elements of all data blocks includes: Initialize the element values of all positions in the main hint table 0 and initialize the element values of all positions in the backup hint table is 0; The elements p of all data blocks j Fill in the main hint table according to the corresponding position to get the main hint table, which is expressed as All elements of the data block Fill in the backup hint table according to the corresponding position to obtain the backup hint table, which is expressed as Each data block is represented as The mapping of data blocks and corresponding pseudo-random offset vectors in the database is a Set variable. All Set variables corresponding to the client constitute a Set variable set expressed as:
5. The method for dynamically updating a single server preprocessing PIR according to claim 4, characterized in that: During the database dynamic update phase, The server determines whether the number of update operations on its own database has reached Q times. If so, it sends the latest update operation of the same element in the data block and the corresponding data item to the client; Among them, the latest update operations include add operation, replace operation and delete operation; If the client determines that the latest update operation is an increment operation, a pseudo-random offset vector is generated in response to the increment operation to generate an additional item, and determines whether the generated additional item is in the Set variable set in the database. If so, the main hint table and the backup hint table are updated, otherwise, they are not updated; if the latest update operation is a replacement operation, the main hint table and the backup hint table are updated according to the change between the new and old values; if the latest update operation is a delete operation, the delete operation is executed to delete the corresponding data, and the main hint table and the backup hint table are updated.
6. The method for dynamically updating a single server preprocessing PIR according to claim 5, characterized in that: During the database dynamic update phase, The server determines whether the number of update operations on its own database has reached Q times, If the number of update operations reaches Q, then for the same operation before and after the same element in the data block, take the latest update operation and the corresponding data item {(index, pre_val, val) j } j∈Q Sent to the client; index represents the subscript value of the element being changed, pre_val represents the value of the element before it is changed, and val represents the value of the element after it is changed. If the latest update operation is an addition operation, pre_val is 0, and if it is a deletion operation, val is ⊥; The client receives the corresponding data item {(index, pre_val, val) j } j∈Q Afterwards, determine whether the latest update operation is an add operation, a replace operation, or a delete operation; If it is an increase operation, add the m data items as needed data blocks; for each sk in the main hint table and the backup hint, a k-column pseudo-random offset vector is generated for each Set variable, expressed as: After generating k columns of pseudo-random offset vectors, if Then update the main hint table and the backup hint table; If it is a replacement operation, then index is in In the data blocks, for each sk, if Then update the main hint table and the backup hint table; If it is a delete operation, the index is in In the data blocks, for each sk, Then update the main hint table and the backup hint table.
7. The method for dynamically updating a single server preprocessing PIR according to claim 5, characterized in that: During the online query phase, The client determines that it needs to query the element with the index x in the database and the corresponding pseudo-random offset vector, where x is in the In the data blocks, the i-th * The pseudo-random offset vector of a data block is Select the Set variable and select the i * The pseudo-random offset vector δ of the data blocks i Corresponding multiple Set variables Remove the i * Worth it Send to the server; The server utilizes Traverse its own database to determine the i-th * The position of the value in the database, based on which δ i The mapped Set variable is obtained by XORing all the values in the Set variable. Results Send to the client; The client follows right XOR the result to get the element with subscript x.
8. The method for dynamically updating a single server preprocessing PIR according to claim 5, characterized in that: The step of replacing an item corresponding to the element to be queried with a certain spare item in the spare hint table includes: Select the i-th * Alternatives And according to the formula XOR, replace the item corresponding to the element queried in the main hint table with the XOR result.
Citation Information
Patent Citations
Privacy-protecting certificate state determination method
CN117113322A
Sublinear single-server symmetric private information retrieval method and device
CN117910007A
Cited By
Private information retrieval method and system in multi-server environment
CN121834895A
