Keyword privacy information retrieval method and system

Through adaptive polymorphic retrieval and optimization guidance reduction scheme, the compatibility and computational complexity problems in the process of variable-length data in the prior art are solved, the efficiency and performance of the keyword PIR system are improved, and the keys are adapted to practical applications. Value pair structure.

CN119046302APending Publication Date: 2024-11-29SHANDONG UNIV

Patent Information

Application Number
CN202411102067.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2024-11-29

Smart Images

  • Figure CN119046302A_ABST
    Figure CN119046302A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of keyword privacy information retrieval. Based on the situation that the length of a data entry stored in a server is variable, the keyword privacy information retrieval method and system are provided, the data entry with the variable length can be contained without additional calculation, the problem that current keyword privacy information retrieval calculation is too complex is solved, and the retrieval efficiency is improved. Extra calculation introduced by filling operation is avoided through group-based retrieval, the efficiency of equality checking of operators is improved, and a more efficient solution with high expandability is provided for the keyword PIR problem.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of keyword privacy information retrieval, and in particular to a keyword privacy information retrieval method and system. Background Art

[0002] The statements in this section merely provide background art related to the present invention and do not necessarily constitute prior art.

[0003] In the rapidly developing digital age, data security and privacy have become the focus of global attention. With the widespread adoption of cloud-based, database-centric applications, people's growing concern about the privacy of query content has made protecting user privacy from infringement a pressing issue. In this context, Private Information Retrieval (PIR) technology has become particularly important. In the PIR scheme, users can retrieve the required information from the data source without revealing their query content to the data source, that is, the data source can only see how much data the user has retrieved, but cannot see the specific content retrieved by the user. PIR technology has a wide range of application scenarios, such as search engines, healthcare, and retrieval in banking and finance.

[0004] Early PIR techniques, namely Index PIR, use lattice-based homomorphic encryption to create highly secure query protocols. Generally speaking, these protocols view the database as n entries of equal length, which allows clients to retrieve the i-th entry without revealing their query target. However, in practical applications such as contact lists and multimedia content, users usually want to retrieve values ​​associated with specific keys, and key-value pairs are not of equal length. This leads to a contradiction between the Index PIR method and the key-value pair structure that is prevalent in practical application databases. Therefore, the Keyword PIR technology came into being, which allows clients to perform privacy-precise queries based on keywords.

[0005] Keyword retrieval systems represented by Pantheon solve some problems existing in systems such as Benny, such as the communication overhead caused by the need for the client and server to interact twice, and the problem of increasing the client's storage burden. In Pantheon, the server uses equality check operators to implicitly check whether the user's query key is equal to each key in the key-value store, and then uses the index PIR to retrieve the results.

[0006] However, the current keyword PIR system design still has the following defects, which makes its operation efficiency low: (1) Poor compatibility. The existing PIR protocol is not suitable for processing variable-length data. Moreover, aligning all data through padding operations will significantly increase the computational complexity of the protocol. (2) Low efficiency. In the current keyword PIR protocol, the complexity of the equality check operator seriously hinders the overall execution efficiency of the keyword PIR protocol. Summary of the invention

[0007] In order to address the deficiencies of the prior art, the present invention provides a keyword privacy information retrieval method and system, which avoids the extra calculation introduced by the filling operation through group-based retrieval and improves the efficiency of the equality check operator, providing a highly scalable and more efficient solution to the keyword PIR problem.

[0008] In order to achieve the above object, the present invention adopts the following technical solution:

[0009] In a first aspect, the present invention provides a keyword privacy information retrieval method.

[0010] A keyword privacy information retrieval method, applied to a server, includes the following processes:

[0011] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0012] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0013] As a further limitation of the first aspect of the present invention, the server and the client reach a consensus to pad the key and value with 0 characters to reach their maximum length to hide the length information.

[0014] As a further limitation of the first aspect of the present invention, the value of the initial key is defined as a true character, the padded 0 character is defined as a false character, key-value pairs of the same length are grouped together and encoded into a polynomial, including: sorting the value items according to the length of the real character.

[0015] As a further limitation of the first aspect of the present invention, the length of any k is defined as l=k bit / log2(T-1), for a set of {k i}, align all k by appending 0 value at the end, ensure that all k are extended to l length, add a unique flag at the end of each key indicating the original l of the key and participate in the equality check calculation as a real character.

[0016] As a further limitation of the first aspect of the present invention, performing an accumulation operation on all subsets q0 and q1 and outputting a sum sum includes:

[0017]

[0018] As a further limitation of the first aspect of the present invention, performing Fermat's Little Theorem calculation according to the ciphertext L and C and the sum, comprises:

[0019] I=C-(sum-L) (T-1) .

[0020] In a second aspect, the present invention provides a keyword privacy information retrieval system.

[0021] A keyword privacy information retrieval system, applied to a server, comprising:

[0022] an adaptive polymorphic retrieval unit, configured to: receive a ciphertext Q from a client and perform query expansion to decouple the ciphertext Q into q0 and q1, sort the key-value pairs according to their lengths, group the key-value pairs of the same length together and encode them into a polynomial, and perform calculations only on plaintext consisting of real characters;

[0023] The optimization guided reduction unit is configured to: construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality checks with q0 and q1, perform accumulation operations on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0024] In a third aspect, the present invention provides a server, comprising: a processor and a computer-readable storage medium;

[0025] a processor adapted to execute a computer program;

[0026] A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the following process is implemented:

[0027] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0028] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts l and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0029] In a fourth aspect, the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program is suitable for being loaded by a processor and executing the following process:

[0030] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0031] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0032] In a fifth aspect, the present invention provides a computer program product, the computer program product comprising a computer program, and when the computer program is executed by a processor, the following process is implemented:

[0033] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0034] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts l and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0035] Compared with the prior art, the present invention has the following beneficial effects:

[0036] 1. The present invention innovatively proposes an Adaptive Polymorphic Retrieval (APR) method, which can accommodate variable-length key-value pair data entries without additional calculations, effectively reducing the additional calculations introduced by padding characters.

[0037] 2. The present invention innovatively proposes an optimized bootstrap reduction (OBR) scheme, which simplifies the complexity of the equality check operator and greatly improves the performance of this operation in the PIR protocol.

[0038] Advantages of additional aspects of the present invention will be given in part in the following description, and in part will become obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The accompanying drawings in the specification, which constitute a part of the present invention, are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations on the present invention.

[0040] Figure 1 A schematic diagram of the flow of the Pantheon protocol provided in Example 1 of the present invention;

[0041] Figure 2 A schematic diagram of EC and PIR for group-based retrieval provided in Example 1 of the present invention;

[0042] Figure 3 A schematic diagram of the unique flag structure provided in Example 1 of the present invention. DETAILED DESCRIPTION

[0043] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0044] It should be noted that the following detailed descriptions are exemplary and are intended to provide further explanation of the present invention. Unless otherwise specified, all technical and scientific terms used herein have the same meanings as those commonly understood by those skilled in the art to which the present invention belongs.

[0045] In the absence of conflict, the embodiments of the present invention and the features of the embodiments may be combined with each other.

[0046] Embodiment 1:

[0047] In keyword PIR systems such as Pantheon, the entire PIR process can be divided into Figure 1 The three steps shown are:

[0048] In the first step, the server receives the ciphertext Q from the client and performs query expansion (QE) to decouple Q into q0 and q1. In this step, the PIR protocol requires the server and client to map all entries to a uniform length by padding. However, this padding strategy significantly increases the computational burden when performing privacy queries.

[0049] In the second step, the server constructs plaintext K0 and K1 based on all the keys in the database (i.e., k0 and k1), and performs an equality check (EC) with q0 and q1. Specifically, for each subset q i , the server executes t i =C-(q i -K i ) T-1 , where C is the encryption of the polynomial [1, 1]. This formula uses Fermat's little Theorem (FLT). If q i and K i If the elements in the same slot are equal, then t i The corresponding slot is 1, otherwise it is 0; in this step, the equality detection operator involves multiple consecutive multiplications. In order to prevent the accumulated noise from exceeding the threshold and causing the result to be unable to be decrypted, the most expensive bootstrap operation must be called frequently.

[0050] In the third step, the server uses FastPIR to execute Index PIR based on the output of the second step.

[0051] In this implementation, an optimization solution is proposed for the problems in the first and second steps of the above process, including the following process:

[0052] Define "real characters" and "false characters". Assume that a consensus is reached between the client and the server to pad keys and values ​​with {0} to reach their maximum length to hide length information. In this case, the value of the initial key is called a real character, and the padding {0,...,0} is called a false character. The computational overhead introduced by false characters fundamentally stems from the fact that they are encoded into the same polynomial together with the real characters, so that the real characters must participate in the calculation together with the false characters. In view of this, the present invention proposes an adaptive polymorphic retrieval method, which includes two main stages: (1) The server initially sorts all key-value pairs according to their length, groups keys and values ​​of the same length together and encodes them into polynomials, such as Figure 2 As shown in (a); (2) in the subsequent EC and Index PIR steps, knowing the length of the key and value within each group enables the server to perform calculations only on plaintext consisting of real characters.

[0053] For value, an Index PIR without APR is Figure 2 As shown in (b) in , since the server cannot distinguish the private query index, all plaintext polynomials must participate in the homomorphic multiplication operation, and Figure 2 In the group-based retrieval shown in (c), the server sorts the value items according to the length of the real characters and assigns {v0,v2} and {v1,v3} to group 1 and group 2 respectively. In the two plaintext polynomials in group 2, [0,0] consists of fake characters. Therefore, the server only needs to calculate [v 10 ,v 30 ] and ignore [0,0] in subsequent Index PIR steps.

[0054] For the key, the situation in the EC step is a bit complicated, but group-based retrieval can still avoid counting false characters, as shown in Figure 2 As shown in (d) in Figure 2 (e) in Figure 1 illustrates a problematic situation. For the query [k 00 ,k 01 ], assuming the server follows the APR design and k 00 =k 10 (Does not damage k i This will result in two successful matches. To this end, the present invention designs a new filling method, which is implemented by a unique flag (UniqueFlag), the core of which is to ensure that any two keys compared in any group in the EC step have different real characters. Figure 3 As shown, the length of any k is defined as l = k bit / log2(T-1), for a set of {k i}, the server aligns all k by appending {0} at the end, ensuring that all k are extended to 6 in length. Subsequently, the server adds a unique flag at the end of each key, indicating the original l of the key and participating in the EC calculation as a real character.

[0055] The adaptive polymorphic retrieval scheme proposed in the present invention effectively reduces the computational complexity caused by data padding, groups keys and values ​​of the same length together and encodes them into polynomials, greatly reducing the computation of useless data. The specific algorithm is as follows:

[0056]

[0057] Bootstrap is needed in the PIR process because equality checking would multiply the same ciphertext too many times. For example, the multiplication depth M required to operate on a set of 256-bit keys according to the BFV parameters {N, Q, T} d It can be expressed as follows:

[0058]

[0059] Among them, log2(T-1) is the number of square operations introduced by Fermat's little theorem, and is the cumulative number of multiplications across multiple subsets. To prevent the introduction of Bootstrap in the squaring phase of each subset, a favorable BFV parameter can be selected. However, this cannot avoid the cumulative multiplications that occur on the subsets. In addition, as the key length increases, the number of bootstrap calls will also increase.

[0060] The optimization guide reduction OBR proposed in the present invention focuses on the occurrence of multiple subsets t i The key to the cumulative multiplication on t is to aggregate all t through homomorphic addition. i , and then a single Bootstrap operation is used to remove the noise. Specifically, OBR will occur at t i The cumulative multiplication between is converted into the following two stages:

[0061] (1) The server first performs a cumulative operation on all subsets and outputs the sum, following formula (2);

[0062] (2) The server constructs two ciphertexts (L and C) and encrypts [l,...,l] and [1,...,1] respectively. Then, the server again calls Fermat's Little Theorem to calculate formula (3) and finally obtains the input I of the third step Index PIR:

[0063]

[0064] I=C-(sum-L) (T-1) (3);

[0065] The optimized bootstrap reduction scheme proposed in the present invention effectively reduces the performance problem of Bootstrap caused by equality checking. The specific algorithm is as follows:

[0066]

[0067] Embodiment 2:

[0068] This implementation provides a keyword privacy information retrieval system, which is applied to a server and includes:

[0069] an adaptive polymorphic retrieval unit, configured to: receive a ciphertext Q from a client and perform query expansion to decouple the ciphertext Q into q0 and q1, sort the key-value pairs according to their lengths, group the key-value pairs of the same length together and encode them into a polynomial, and perform calculations only on plaintext consisting of real characters;

[0070] The optimization guided reduction unit is configured to: construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality checks with q0 and q1, perform accumulation operations on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0071] The detailed process is shown in the steps of Example 1 and will not be repeated here.

[0072] It is understandable that the above-mentioned units can be separately or completely combined into one or several other units to constitute, or one (some) of the units can be further divided into multiple smaller units in function to constitute, which can achieve the same operation without affecting the realization of the technical effects of the embodiments of the present application. The above-mentioned units are divided based on logical functions. In practical applications, the functions of one unit can also be implemented by multiple units, or the functions of multiple units can be implemented by one unit. In other embodiments of the present application, the keyword privacy information retrieval system can also include other units. In practical applications, these functions can also be implemented with the assistance of other units, and can be implemented by the collaboration of multiple units.

[0073] According to another embodiment of the present application, the system described in this embodiment can be constructed and the keyword privacy information retrieval method of the embodiment of the present application can be implemented by running a computer program (including program code) capable of executing the steps involved in the corresponding method described in Example 1 on a general computing device such as a computer including processing elements and storage elements such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM). The computer program can be recorded on, for example, a computer-readable recording medium, and loaded into the above-mentioned computing device through the computer-readable recording medium and run therein.

[0074] Embodiment 3:

[0075] This implementation provides an electronic device, which includes a processor, a communication interface, and a computer-readable storage medium, wherein the processor, the communication interface, and the computer-readable storage medium may be connected via a bus or other means.

[0076] Among them, the communication interface is used to receive and send data, the computer-readable storage medium can be stored in the memory of the electronic device, the computer-readable storage medium is used to store a computer program, the computer program includes program instructions, and the processor is used to execute the program instructions stored in the computer-readable storage medium.

[0077] A processor (or CPU (Central Processing Unit)) is the computing core and control core of an electronic device, which is suitable for implementing one or more instructions, and specifically suitable for loading and executing one or more instructions to implement corresponding method flows or corresponding functions.

[0078] The processor is configured to perform the following process:

[0079] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0080] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0081] The detailed process is shown in the steps of Example 1 and will not be repeated here.

[0082] Embodiment 4:

[0083] This implementation provides a computer-readable storage medium (Memory), which is a memory device in an electronic device for storing programs and data. It is understandable that the computer-readable storage medium here can include both built-in storage media in the electronic device and, of course, extended storage media supported by the electronic device. The computer-readable storage medium provides a storage space that stores the processing system of the electronic device.

[0084] In addition, the storage space also stores one or more instructions suitable for being loaded and executed by the processor, and these instructions may be one or more computer programs (including program codes). It should be noted that the computer-readable storage medium here may be a high-speed RAM memory, or a non-volatile memory (non-volatile memory), such as at least one disk storage; optionally, it may also be at least one computer-readable storage medium located away from the aforementioned processor.

[0085] In one embodiment, the computer-readable storage medium stores one or more instructions; the processor loads and executes the one or more instructions stored in the computer-readable storage medium to implement the following process:

[0086] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0087] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0088] The detailed process is shown in the steps of Example 1 and will not be repeated here.

[0089] Embodiment 5:

[0090] The present implementation provides a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the electronic device performs the following process:

[0091] Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters;

[0092] Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,l] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

[0093] The detailed process is shown in the steps of Example 1 and will not be repeated here.

[0094] A person skilled in the art can appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0095] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loading and executing computer program instructions on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network or other programmable device. The computer instruction can be stored in a computer-readable storage medium or transmitted by a computer-readable storage medium. The computer instruction can be transmitted from a website site, a computer, a server or a data center to another website site, a computer, a server or a data center by wired (for example, coaxial cable, optical fiber, digital line (DSL)) or wireless (for example, infrared, wireless, microwave, etc.) mode. The computer-readable storage medium can be any available medium that a computer can access or a data processing device such as a server, a data center, etc. that contains one or more available media integrated. Available media can be magnetic media (for example, floppy disk, hard disk, tape), optical media (for example, DVD), or semiconductor media (for example, solid-state drive (Solid State Disk, SSD)) and the like.

[0096] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A keyword privacy information retrieval method, characterized in that: Applied to the server, including the following process: Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters; Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

2. The keyword privacy information retrieval method according to claim 1, characterized in that: The server and the client reach a consensus to pad the keys and values ​​with zero characters to reach their maximum length to hide the length information.

3. The keyword privacy information retrieval method according to claim 1 or 2, characterized in that: Define the value of the initial key as a true character, define the padded 0 characters as false characters, group key-value pairs of the same length together and encode them as a polynomial, including: sorting the value items according to the length of the true character.

4. The keyword privacy information retrieval method according to claim 1 or 2, characterized in that: Define the length of any k as l = k bit / 2(-1), for a set of {k i }, align all k by appending 0 value at the end, ensure that all k are extended to l length, add a unique flag at the end of each key indicating the original l of the key and participate in the equality check calculation as a real character.

5. The keyword privacy information retrieval method according to claim 1 or 2, characterized in that: Perform accumulation operations on all subsets q0 and q1 and output the sum, include:

6. The keyword privacy information retrieval method according to claim 1 or 2, characterized in that: According to the ciphertext L and C and the sum, Fermat's Little Theorem calculation is performed, including: I=C-(sum-L) () 。 7. A keyword privacy information retrieval system, characterized in that: Applicable to servers, including: an adaptive polymorphic retrieval unit, configured to: receive a ciphertext Q from a client and perform query expansion to decouple the ciphertext Q into q0 and q1, sort the key-value pairs according to their lengths, group the key-value pairs of the same length together and encode them into a polynomial, and perform calculations only on plaintext consisting of real characters; The optimization guided reduction unit is configured to: construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality checks with q0 and q1, perform accumulation operations on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

8. A server, characterized in that: include: a processor and a computer readable storage medium; a processor adapted to execute a computer program; A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the following process is implemented: Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters; Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

9. A computer-readable storage medium, characterized in that: The computer readable storage medium stores a computer program, which is suitable for being loaded by a processor and executing the following process: Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters; Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts l and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the following process is implemented: Receive ciphertext Q from the client and perform query expansion to decouple ciphertext Q into q0 and q1, sort key-value pairs according to their length, group key-value pairs of the same length together and encode them into a polynomial, performing calculations only on plaintext consisting of real characters; Construct plaintexts K0 and K1 according to all keys k0 and k1 in the database, perform equality check with q0 and q1, perform accumulation operation on all subsets q0 and q1 and output the sum sum, construct two ciphertexts L and C, encrypt [l,...,] and [1,...,1] respectively, perform Fermat's Little Theorem calculation according to the ciphertexts L and C and the sum sum, and use the Fermat's Little Theorem calculation result as the input of the Index PIR process.

Citation Information

Patent Citations

  • Privacy keyword query method and device and electronic equipment

    CN115982424A

  • Privacy intersection and database retrieval method based on homomorphic encryption

    CN116595577A

  • Multi-keyword privacy information retrieval method, device and system for vulnerability scanning

    CN117910034A

  • Private information retrieval method based on homomorphic encryption

    CN118094615A

Cited By

  • Privacy information retrieval method and system based on CSD array

    CN120597303A

  • A method and system for privacy information retrieval based on a CSD array

    CN120597303B