CN117972795A - Secure retrieval method and device for secret space keywords based on exclusive or filter - Google Patents
Secure retrieval method and device for secret space keywords based on exclusive or filter Download PDFInfo
- Publication number
- CN117972795A CN117972795A CN202410382369.7A CN202410382369A CN117972795A CN 117972795 A CN117972795 A CN 117972795A CN 202410382369 A CN202410382369 A CN 202410382369A CN 117972795 A CN117972795 A CN 117972795A
- Authority
- CN
- China
- Prior art keywords
- exclusive
- filter
- secure
- representing
- space
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 125000003275 alpha amino acid group Chemical group 0.000 claims description 31
- 150000001875 compounds Chemical class 0.000 claims description 31
- 238000003860 storage Methods 0.000 claims description 17
- 230000006870 function Effects 0.000 claims description 14
- 238000013507 mapping Methods 0.000 claims description 6
- 230000015572 biosynthetic process Effects 0.000 claims description 4
- 238000009826 distribution Methods 0.000 claims description 4
- 238000005755 formation reaction Methods 0.000 claims description 4
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 3
- 238000003491 array Methods 0.000 claims description 2
- 238000010276 construction Methods 0.000 claims description 2
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012946 outsourcing Methods 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6227—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
- G06F16/316—Indexing structures
- G06F16/322—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/3332—Query translation
- G06F16/3334—Selection or weighting of terms from queries, including natural language queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- Bioethics (AREA)
- Artificial Intelligence (AREA)
- Computational Linguistics (AREA)
- Storage Device Security (AREA)
Abstract
The invention belongs to the technical field of data security, and particularly relates to a secure retrieval method and device for a secret space keyword based on an exclusive or filter. The method comprises the following steps: the data owner end builds a security tree index based on the security exclusive OR filter and the geographic hash code, encrypts the space text data set by using a secret key, and uploads the security tree index and the encrypted space text data set to the cloud server end; giving a query by a user terminal, generating a trapdoor based on the query, and uploading the trapdoor to a cloud server terminal; the cloud server searches the target space object in the security tree index according to the trapdoor, and returns a result set formed by ciphertext of the target space object to the user side; and the user side inquires complete ciphertext information according to the result set, and decrypts the ciphertext information by using the key to obtain plaintext information. The invention realizes the return of the space text data information which the user expects to inquire in a certain space range, provides privacy protection and improves the accuracy of the inquiry result.
Description
Technical Field
The invention belongs to the technical field of data security, and particularly relates to a secure retrieval method and device for a secret space keyword based on an exclusive or filter.
Background
With the popularity of mobile internet and GPS devices, spatial text data is widely used in various services such as location-based services, personalized query services, and the like. In a spatial text database, there is a typical query, namely a boolean range query (Boolean Range Query), which considers spatial geometric ranges and text keywords, and which can be given a query range and text keywords for a set of spatial objects, from which a user can retrieve all spatial objects that are satisfactory.
More and more data owners choose to outsource their data services to cloud computing for cost savings and service flexibility. However, the data and services outsourced to cloud computing need privacy protection. Many current spatial key query schemes that support privacy preservation use bloom filters for encoding when designing the index.
Chinese patent document CN117349878A discloses a keyword searching and multidimensional range inquiring privacy protecting method in intelligent medical treatment, medical institutions index owned medical data through an index tree R-tree, and outsource the medical data to a cloud server to provide data inquiring service; the double cloud servers have strong computing capacity and storage space, store the encrypted data of the outsourcing and jointly provide multidimensional range query service for authorized users; the authorized user needs to search keywords and inquire about entities in a multidimensional range, when the authorized user registers in the system, the system can send an identity id and a hash message authentication code to the authorized user for carrying out privacy calculation on inquiry data later; wherein, when multi-dimensional data is encoded, a bloom filter BF is adopted to encode the multi-dimensional data. The method ensures the safety and reliability of the multi-dimensional range query service provided by the cloud server, and meets the query requirement of multi-dimensional range query diversity.
The Chinese patent document CN111935141A discloses a query system and a method for single unintentional anti-link of secret state data, which are applied to a network environment formed by a plurality of data uploading modules, a plurality of data request modules and a data cloud storage module; the data uploading module calculates a security tree index of the data, uploads the security tree index to the data cloud storage module together with the encrypted data and shares a secret key with some data uploading modules; the data request module generates a query token, submits the token to the data cloud storage module, decrypts the matched data after waiting for the data to be sent back, and otherwise, waits for effective data all the time; the data cloud storage module receives the security tree index and the encrypted data from the data uploading module, receives the token from the data requesting module, searches the security tree index by using the token and returns a query result, and otherwise returns a null value; the data uploading party initializes an empty unable area distribution bloom filter Bn, and sets the kth prefix prk and a random number rn in a group of prefixes Sn to be embedded into the bloom filter Bn, and submits a security tree index formed by the bloom filter Bn and the random number rn and encrypted data to the data cloud storage party. The method can protect the privacy of the data requesting party from being affected by an unreliable data cloud storage party.
However, bloom filters require storing the results of multiple hash functions, occupy a lot of space, and have a high false positive rate, which may result in inaccurate queried results.
Disclosure of Invention
The invention aims to overcome at least one defect of the prior art, and provides a secure retrieval method of a secret state space keyword based on an exclusive or filter, which is used for returning space text data information which a user desires to query in a certain space range and providing privacy protection, and simultaneously improving the accuracy of a query result.
The invention also discloses a device loaded with the secure retrieval method of the secret space key words based on the exclusive or filter.
The detailed technical scheme of the invention is as follows:
A secure retrieval method for a secret space keyword based on an exclusive or filter, the method comprising:
S1, constructing a secure exclusive-or filter at a data owner end, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and using a secret key Encrypting the space text data set, and uploading the security tree index and the encrypted space text data set to a cloud server;
s2, giving query to user Based on the query/>Generating trapdoors/>And the trapdoor is openedUploading to a cloud server, wherein the query/>，/>Location information representing a query point,/>Representing query keyword information,/>Representing a spatial range of query points;
s3, the cloud server performs the operation according to the trapdoor Searching for target space objects/>, in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>Returning to the user side;
s4, the user sets according to the result Query complete ciphertext information/>And uses the keyFor the ciphertext information/>And decrypting to obtain the plaintext information.
According to a preferred embodiment of the present invention, in the step S1, the constructing a secure exclusive or filter specifically includes:
s10, collecting Mapping the elements in (1) to a secure exclusive-or filter/>In (1), the following steps are obtained:
（2）；
In the formula (2), the amino acid sequence of the compound, For the collection/>Is a secure exclusive-or filter,/>Is an exclusive OR filter,/>Is a random number;
S11, collecting The elements in (a) are added to the array/>, in turnIn each element/>Respectively and correspondingly generating three groups of hash functions/>、/>And/>Based on the hash function/>、/>And/>Calculating to obtain the element/>Corresponding three hash values, i.e./>、/>And/>; Wherein/>，/>Representing collections/>Is a length of (2);
S12, based on each element Three hash values/>、/>And/>The element/>Put to array/>At the corresponding position, pair group/>Iterating to find a composition containing only one element/>And initialize a queue to put the element/>Subscript/>Adding the data into a queue;
S13, taking out the stored subscript from the head of the queue And from the array/>Obtain the subscriptCorresponding element/>And then let it be-Is recorded in a stack from array/>Element removal in/>When the number is/>Contains only one element/>The element/>Subscript/>Added to the queue until array/>No more elements/>And then continuing to sequentially fetch the stored subscripts/>, from the queue of the queueRepeating the above operation until the queue is empty;
s14, creating an AND array The new arrays with equal length are filled with random values, and the recorded/>' is taken out from the stack top of the stack one by oneComputing element/>/>Identify a value and compare the/>Updating the identification value to the secure exclusive-or filter/>In (a) and (b);
s15, finding out each element Three hash values/>、/>And/>Middle and its subscript/>Two inconsistent hash values are obtained in a secure exclusive-or filter/>In (2) the two hash values are used as subscripted values and are matched with the hash valuesPerforming exclusive-or operation on the identification value, and finally performing exclusive-or operation on the identification value at a safe exclusive-or filter/>And updating the exclusive OR operation result.
According to a preferred embodiment of the present invention, in the step S1, the expression for constructing the security tree index is:
（3）；
In the formula (3), the amino acid sequence of the compound, Index for security tree,/>Is space text data;
the construction of the security tree index based on the security exclusive-or filter and the geographic hash code specifically comprises the following steps:
s16, utilizing a character random distribution mode to code the space object according to the geographic hash of the space text data Leaf nodes are generated in the form of (1) and a tree index of plaintext is constructed, wherein/>Unique identifier representing a spatial object,/>Prefix-encoded clusters representing the geohash encoding of spatial objects,A set of keywords representing a spatial object;
S17, encrypting the constructed tree index of the plaintext, wherein a pseudo-random counter is used in a non-leaf node Generating pseudo-random number seeds/>Reuse of pseudo-random number seed/>Generating a generated byAssigned character set corresponds/>Values and map them to a secure exclusive-or filter/>In (3), namely:
（4）；
in the formula (4), the amino acid sequence of the compound, Is a secure exclusive OR filter of non-leaf nodes,/>In the form of an exclusive-or filter,Representing/>, corresponding to character setA value;
In leaf nodes, a key is used />, To space objectEncryption is carried out to obtain a space object/>Ciphertext of (2)Pseudo-random number seed/>, is usedPrefix coding cluster/>, of geographic hash codingAll prefix encodings contained generate the corresponding/>Value, and will generate all/>Value mapping to secure exclusive-or filter/>In (3), namely:
（5）；
in the formula (5), the amino acid sequence of the compound, Secure exclusive-or filter encoding clusters for prefixes,/>Is an exclusive OR filter,/>Prefix coding cluster/>, representing a geohash codeAll prefixes contained encode corresponding/>A value;
Also, in the leaf node, pseudo-random number seeds are used Keyword set/>All keywords in the list are respectively generated to correspond/>Values and map to secure exclusive-or filter/>In (3), namely:
（6）；
in the formula (6), the amino acid sequence of the compound, Is a secure exclusive-or filter for keywords,/>Is an exclusive OR filter,/>Representing keyword set/>/>, Corresponding to all keywords in (a)Values.
According to a preferred embodiment of the present invention, in the step S1, the key is usedEncrypting the space text data set, specifically:
（7）；
In the formula (7), the amino acid sequence of the compound, For an encrypted spatial text data set,/>For a spatial text data set, including spatial data and text data,/>Is a secret key.
According to a preferred embodiment of the present invention, in the step S2, the query is based onGenerating trapdoors/>The method specifically comprises the following steps:
（8）；
in the formula (8), the amino acid sequence of the compound, Is trapdoor,/>Location information representing a query point,/>Representing query keyword information,/>Representing a spatial range of query points;
wherein, for the position information of the query point Converting the query coordinates into geographic hash codes and according to the given spatial range/>Calculate the corresponding prefix code/>Pseudo-random number seed/>, is usedCalculating the prefix encoding/>Intrinsic/>Value/>Prefix coding/>/>, Of each character of (a)Value/>：
（9）；
In the formula (9), the amino acid sequence of the compound,Encoding/>, for prefixIntrinsic/>Value/>Representing prefix encodingsMiddle/>/>, Of individual charactersValue/>Representing prefix encoding/>/>, Of each character of (a)Collection of values,/>Representing prefix encoding/>Is a character length of (a);
For query keyword information Pseudo-random number seed/>, is usedSeparately calculating keyword sets/>/>, Of all keywords in (1)Values expressed as/>：
（10）；
In the formula (10), the amino acid sequence of the compound,Representing keyword set/>/>, Of all keywords in (1)The set of values is formed by a set of values,Representing keyword set/>Middle/>/>, Of individual keywordsValue/>Representing keyword setsThe number of keywords in the list.
According to a preferred embodiment of the present invention, in the step S3, the result setThe expression of (2) is:
（11）；
In the formula (11), the amino acid sequence of the compound, Representing trapdoor,/>Representing a security tree index;
The cloud server side is based on the trapdoor Searching for target space objects in the security tree indexThe method specifically comprises the following steps:
S31, traversing the prefix codes />, Of each character of (a)Value/>Set of formations/>Searching the security tree index for the/>Value/>Existing secure exclusive-or filter/>Corresponding non-leaf nodes to determine a search range;
S32, finding out all leaf nodes in the search range, and judging prefix codes in each leaf node Whether or not to be in the secure exclusive OR filter/>If yes, continuing to judge the keyword set/>Whether all keys in (a) are in the secure exclusive-or filter/>If so, the space object stored in the leaf node is determined as a target space object/>And targets the target space object/>Ciphertext/>Join result set/>Is a kind of medium.
Preferably, in the step S4, a key is usedFor the ciphertext information/>Decryption is carried out, specifically:
（12）；
In the formula (12), the amino acid sequence of the compound, For the plaintext information obtained after decryption,/>Representing complete ciphertext information found from a result set,/>Is a secret key.
In another aspect of the present invention, an apparatus for implementing a secure retrieval method of a secret space keyword based on an exclusive or filter is provided, where the apparatus includes a data owner side, a user side, and a cloud server side, where:
The data owner side is used for constructing a secure exclusive-or filter, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and using a secret key Encrypting the space text data set, and uploading the security tree index and the encrypted space text data set to a cloud server;
the user is used for given inquiry Based on the query/>Generating trapdoors/>And the trapdoor is openedUploading to a cloud server side; for/> according to the result setQuery complete ciphertext information/>And uses the key/>For the ciphertext information/>Decrypting to obtain plaintext information;
The cloud server is used for controlling the trap door according to the cloud server Searching for target space objects/>, in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>And returning to the user side.
In another aspect of the present invention, there is also provided an electronic apparatus including:
At least one processor; and
A memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the secure retrieval of a cryptographic spatial key based on an exclusive or filter as described above.
In another aspect of the invention, there is also provided a machine-readable storage medium storing executable instructions that, when executed, cause the machine to perform the secure exclusive or filter based method of retrieving a secret space key as described above.
Compared with the prior art, the invention has the beneficial effects that:
(1) According to the secure retrieval method for the secret space key words based on the exclusive or filter, provided by the invention, the secure tree index is constructed by combining the secure exclusive or filter and the geographic hash code and is uploaded to the cloud server, so that the cloud server can query space objects with higher accuracy and fewer occupied space of a memory in the process of executing query.
(2) In the invention, the user side can return a result set according to the cloud server sideQuerying complete ciphertext informationAnd uses the key/>For the ciphertext information/>The decryption is carried out to obtain plaintext information, so that the inquiry of the space keyword is completed, the space object meeting the inquiry condition of the user is efficiently and accurately searched on the cloud server side, no information is revealed, the data privacy is ensured, and the efficient search is realized while the stronger safety is ensured.
Drawings
FIG. 1 is a flowchart of the secure retrieval method of the secret space key words based on the exclusive or filter.
Fig. 2 is a graph showing the false positive rate generated by the xor filter and the bloom filter according to the embodiment 1 of the present invention with the increase of the number of inserted data under the same filter length.
Fig. 3 is an index generation timing chart in embodiment 1 of the present invention.
Detailed Description
The disclosure is further described below with reference to the drawings and examples.
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the present disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments in accordance with the present disclosure. As used herein, the singular is also intended to include the plural unless the context clearly indicates otherwise, and furthermore, it is to be understood that the terms "comprises" and/or "comprising" when used in this specification are taken to specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.
Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
Example 1,
Referring to fig. 1, the embodiment provides a secure retrieval method for a secret space keyword based on an exclusive or filter, which includes:
S1, constructing a secure exclusive-or filter at a data owner end, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and using a secret key Encrypting the space text data set, and uploading the security tree index and the encrypted space text data set to a cloud server side.
In this embodiment, the keyIs the security parameter/>, used by the data owner sideGenerated, the key/>Is used for encrypting spatial text data. The generation of the key is represented by the following equation:
（1）。
An exclusive or filter is a data structure used to efficiently check whether an element exists in a collection, typically for high performance data storage and retrieval systems. The design of the exclusive or filter is motivated by the bloom filter, but it exhibits in some aspects higher accuracy and lower memory usage. The exclusive or filter is superior to the bloom filter in terms of erroneous judgment rate and spatial efficiency. In this embodiment, in the stage of constructing the xor filter, the values during initializing the array are all filled with random numbers, so that the security of the xor filter can be enhanced.
In this embodiment, in the step S1, a secure exclusive or filter is constructed, which specifically includes:
s10, collecting Mapping the elements in (1) to a secure exclusive-or filter/>In (2), can be obtained:
（2）；
In the formula (2), the amino acid sequence of the compound, For the collection/>Is a secure exclusive-or filter,/>Is an exclusive OR filter,/>Is a random number.
S11, constructing a safe exclusive OR filterWhen you will first gather/>The elements in (a) are added to the array/>, in turnIn each element/>Respectively and correspondingly generating three groups of hash functions/>、/>And/>Based on the generated three sets of hash functions/>、/>And/>Calculating to obtain the element/>Corresponding three hash values, i.e./>、/>And/>; Wherein/>，/>Representing collections/>Is a length of (c).
Here, using three hash functions may minimize the number of memory accesses required to achieve spatial advantage.
S12, next, according to each elementThree hash values/>、/>And/>Element/>Put to array/>At the corresponding position, pair group/>Iterating to find a composition containing only one element/>And initialize a queue to put the element/>Subscript/>Added to the queue.
S13, then, taking out the stored subscript from the head of the queueAnd from the array/>Obtain the subscript/>Corresponding element/>And then let it be-Is recorded in a stack from array/>Element removal in/>; When array/>Contains only one element/>The element/>Subscript of (2)Added to the queue until array/>No more elements/>; Thereafter, the deposited index/>, continues to be sequentially fetched from the queue of queuesAnd repeating the operation until the queue is empty.
S14, creating an AND arrayThe new array with equal length is filled with all initial values of the new array as random values, and records are taken out from the stack top of the recorded stack one by oneComputing element/>/>Identification value,/>The identification value represents the element/>Is then added to the/>Updating the identification value to the secure exclusive-or filter/>Is a kind of medium.
S15, finding out each elementThree hash values/>、/>And/>Middle and its subscript/>Two inconsistent hash values are obtained in a secure exclusive-or filter/>In (2) the two hash values are used as subscripted values and are compared with each otherPerforming exclusive-or operation on the identification value, and finally performing exclusive-or operation on the identification value at a safe exclusive-or filter/>And updating the exclusive OR operation result.
The above is a specific implementation process for constructing the secure exclusive-or filter in this embodiment, based on the above process, when the secure tree index is constructed in this embodiment, the secure exclusive-or filter of the non-leaf node of the secure tree index can be respectively constructed by combining the application parameters thereofSecure exclusive-or filter/>, of prefix-encoded clusters in leaf nodesAnd a secure exclusive-OR filter of keywords/>。
Further, in this embodiment, the principle of constructing the security tree index is as follows:
The security tree index includes non-leaf nodes and leaf nodes. Firstly, for the non-leaf nodes of the tree, starting from the root node of the tree, each non-leaf node extends downwards to four child nodes according to the rule of a quadtree, the four child nodes randomly distribute 8 characters to the child nodes according to the character set of the Base32, and then the child nodes encrypt the characters, namely, map the characters to corresponding safety exclusive OR filters.
Then for the leaf nodes of the tree, each leaf node correspondingly stores a space objectIncluding spatial object/>Prefix coding cluster/>, of id coding, geo-hash codingAnd keyword set/>. Wherein the space object/>Id of (1) is the pass key/>Encrypted ciphertext, and a geohash coded prefix coding clusterAnd keyword set/>Respectively, will be mapped into their corresponding secure exclusive or filters.
Wherein, constructing the security tree index may be represented by:
（3）；
In the formula (3), the amino acid sequence of the compound, Index for security tree,/>Is spatial text data.
Specifically, the method for constructing the security tree index based on the secure exclusive or filter and the geographic hash code specifically comprises the following steps:
s16, utilizing a character random distribution mode to code the space object according to the geographic hash of the space text data Leaf nodes are generated in the form of (1) and a tree index of plaintext is constructed, wherein/>Unique identifier representing a spatial object,/>Prefix-encoded clusters representing the geohash encoding of spatial objects,A set of keywords representing a spatial object.
S17, encrypting the constructed tree index of the plaintext, wherein a pseudo-random counter is used in the non-leaf nodeGenerating pseudo-random number seeds/>Reuse of pseudo-random number seed/>Generating a generated byAssigned character set corresponds/>Values and map them to a secure exclusive-or filter/>In (3), namely:
（4）；
in the formula (4), the amino acid sequence of the compound, Is a secure exclusive OR filter of non-leaf nodes,/>In the form of an exclusive-or filter,Representing/>, corresponding to character setValues.
Whereas in leaf nodes, the key is used first/>, To space objectEncryption is carried out to obtain a space object/>Ciphertext/>Pseudo-random number seed/>, is usedPrefix coding cluster/>, of geographic hash codingAll prefix encodings contained generate the corresponding/>Value, and will generate all/>Value mapping to secure exclusive-or filterIn (3), namely:
（5）；
in the formula (5), the amino acid sequence of the compound, Secure exclusive-or filter encoding clusters for prefixes,/>Is an exclusive OR filter,/>Prefix coding cluster/>, representing a geohash codeAll prefixes contained encode corresponding/>Values.
Meanwhile, in leaf nodes, for keyword setsPseudo-random number seed/>, is usedSet keywordsAll keywords in the list are respectively generated to correspond/>Values and map to secure exclusive-or filter/>In (3), namely:
（6）；
in the formula (6), the amino acid sequence of the compound, Is a secure exclusive-or filter for keywords,/>Is an exclusive OR filter,/>Representing keyword set/>/>, Corresponding to all keywords in (a)Values.
When the security tree index is built, the key is usedEncrypting the space text data set, namely:
（7）；
In the formula (7), the amino acid sequence of the compound, For an encrypted spatial text data set,/>For a spatial text data set, including spatial data and text data,/>Is a secret key.
Finally, indexing the obtained security treeAll spatial text data after encryptionAnd uploading the cloud server to the cloud server.
In this way, the security tree index structure constructed by combining the security exclusive or filter and the geographic hash code is uploaded to the cloud server, and in the query processing, the space object can be queried with higher accuracy and fewer memory occupied spaces.
S2, giving query to userBased on the query/>Generating trapdoors/>And the trapdoor is openedUploading to a cloud server, wherein the query/>，/>Location information representing a query point,/>Representing query keyword information,/>Representing the spatial extent of the query point.
Specifically, the user gives a queryAnd based on the query/>Generating trapdoors/>Can be represented by the following formula:
（8）。
First, for the location information of the query point Query coordinates therein/>Conversion to a geohash code and according to a given spatial range/>Calculate the corresponding prefix code/>Pseudo-random number seed/>, is usedCalculating the prefix encoding/>Intrinsic/>Value/>Prefix coding/>/>, Of each character of (a)Value ofThe method comprises the following steps:
（9）；
in the formula (9), the amino acid sequence of the compound, Encoding/>, for prefixIntrinsic/>Value/>Representing prefix encodingsMiddle/>/>, Of individual charactersValue/>Representing prefix encoding/>/>, Of each character of (a)Collection of values,/>Representing prefix encoding/>Is a character length of (a) is a length of a character.
While for query keyword informationPseudo-random number seed/>, is usedSeparately calculating keyword sets/>/>, Of all keywords in (1)Values expressed as/>The method comprises the following steps:
（10）；
in the formula (10), the amino acid sequence of the compound, Representing keyword set/>/>, Of all keywords in (1)The set of values is formed by a set of values,Representing keyword set/>Middle/>/>, Of individual keywordsValue/>Representing keyword setsThe number of keywords in the list.
S3, the cloud server performs the operation according to the trapdoorSearching for target space objects/>, in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>And returning to the user side.
I.e. through trapdoors at the time of inquiryPrefix in the tree is used for encoding a hash value, leaf nodes in a search range are found in a security tree index, each leaf node stores a space object, and accordingly a corresponding target space object/>. Meanwhile, the hash value of the query key can be used to verify whether the leaf node meets the query condition.
When the cloud server receives the inquiry trapdoorAfter that, according to trapdoor/>In the security tree indexTarget space object/>, meeting requirementsFinally, all the searched target space objects meeting the requirements/>Ciphertext/>Structured result set/>Returning to the user side, the process can be represented by the following formula:
（11）。
The specific implementation process is as follows:
S31, traversing the prefix codes />, Of each character of (a)Value/>Set of formations/>Searching the security tree index for the/>Value/>Existing secure exclusive-or filter/>Corresponding non-leaf nodes to determine a search range.
The specific process is as follows: traversing prefix encodings/>, Of each character of (a)Value/>Set of formations/>Calculating hash value/>, of each character/>Identification value and three hash values/>, corresponding to each character、/>And/>; And secure exclusive or filters/>, of them at non-leaf nodesExclusive-or the value of (a) if the exclusive-or result is exclusive-ored with its/>The identification values are equal, then the hash value/>, of the character is provedSecure exclusive-or filter/>, present at non-leaf nodesIs a kind of medium.
Based on the above, each character can be searched in the security tree indexValue/>Existing secure exclusive-or filter/>Corresponding non-leaf nodes, thereby determining a search range.
After the traversal is completed, it is necessary to continue to check the leaf nodes below the searched non-leaf nodes.
S32, finding out all leaf nodes in the search range, and judging prefix codes in each leaf nodeWhether or not to be in the secure exclusive OR filter/>If yes, continuing to judge the keyword set/>Whether all keys in (a) are in the secure exclusive-or filter/>If so, the space object stored in the leaf node is determined as a target space object/>And targets the target space object/>Ciphertext/>Join result set/>Is a kind of medium.
For each leaf node, prefix encoding is used firstHash value/>Judging prefix codesWhether or not to be in the secure exclusive OR filter/>If not, then judging the next leaf node; if so, then use the hash value of the key/>Judging whether each keyword is in a secure exclusive-or filter/>If not in its filter/>Then judging the next leaf node; if hash value/>, of all keywordsAre all at their filter/>In (c), the space object stored in the leaf node is determined as a target space object/>And targets the target space object/>Ciphertext/>Join result set/>Is a kind of medium. And finally, after all leaf nodes are judged to be finished, the final result set/>And returning to the user side.
S4, the user sets according to the resultQuery complete ciphertext information/>And uses the keyFor the ciphertext information/>And decrypting to obtain the plaintext information.
The user receives the result setAfter that, according to/>Target space object/>Ciphertext/>Find complete ciphertext information/>Then use the key/>Decrypting to finally obtain plaintext information, namely:
（12）；
In the formula (12), the amino acid sequence of the compound, For the plaintext information obtained after decryption,/>Representing complete ciphertext information found from a result set,/>Is a secret key.
Thus, the query of the space keywords is completed, the space objects meeting the query conditions of the user are efficiently and accurately searched at the cloud server side, any information is not revealed, the data privacy is ensured, and the efficient search can be realized while the stronger safety is ensured.
Fig. 2 shows a comparison of the false positive rate generated by an exclusive or Filter (Xor Filter) and Bloom Filter (Bloom Filter) with increasing number of inserted data at the same Filter length. And under the condition of the same filter length, changing the quantity of the inserted data, and carrying out the comparison analysis of the misjudgment rate. The results show that as the number of inserted data increases, the false positive rate of the bloom filter increases significantly, while the exclusive or filter maintains a lower false positive rate while the false positive rate is always stable around 0.4%.
Fig. 3 shows an index generation time diagram for demonstrating the time required to construct a security tree index for selecting different amounts (10, 1k, 10k, 20k, 50k, 100 k) of data, with good scalability in processing small-scale data.
EXAMPLE 2,
The embodiment provides a device for realizing secure retrieval method of a secret space keyword based on an exclusive or filter, the device comprises a data owner side, a user side and a cloud server side, wherein:
The data owner side is used for constructing a secure exclusive-or filter, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and using a secret key Encrypting the space text data set, and uploading the security tree index and the encrypted space text data set to a cloud server;
the user is used for given inquiry Based on the query/>Generating trapdoors/>And the trapdoor is openedUploading to a cloud server side; for/> according to the result setQuery complete ciphertext information/>And uses the key/>For the ciphertext information/>Decrypting to obtain plaintext information;
The cloud server is used for controlling the trap door according to the cloud server Searching for target space objects/>, in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>And returning to the user side.
EXAMPLE 3,
The embodiment also provides an electronic device, including:
At least one processor; and
A memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the secure retrieval of a cryptographic spatial key based on an exclusive or filter as described above.
In this embodiment, the electronic device may include, but is not limited to: personal computers, server computers, workstations, desktop computers, laptop computers, notebook computers, mobile computing devices, smart phones, tablet computers, cellular phones, personal Digital Assistants (PDAs), handsets, messaging devices, wearable computing devices, consumer electronic devices, and the like.
EXAMPLE 4,
The present embodiment also provides a machine-readable storage medium storing executable instructions that, when executed, cause the machine to perform the secure retrieval method of a cryptographic spatial key based on an exclusive or filter as described above.
In particular, a system or apparatus provided with a readable storage medium having stored thereon software program code implementing the functions of any of the above embodiments may be provided, and a computer or processor of the system or apparatus may be caused to read out and execute instructions stored in the readable storage medium.
In this case, the program code itself read from the readable medium may implement the functions of any of the above embodiments, and thus the machine-readable code and the readable storage medium storing the machine-readable code form part of the present specification.
Examples of readable storage media include floppy disks, hard disks, magneto-optical disks, optical disks (e.g., CD-ROMs, CD-R, CD-RWs, DVD-ROMs, DVD-RAMs, DVD-RWs), magnetic tapes, nonvolatile memory cards, and ROMs. Alternatively, the program code may be downloaded from a server computer or cloud by a communications network.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be understood that the foregoing examples of the present invention are merely illustrative of the present invention and are not intended to limit the present invention to the specific embodiments thereof. Any modification, equivalent replacement, improvement, etc. that comes within the spirit and principle of the claims of the present invention should be included in the protection scope of the claims of the present invention.
Claims (10)
1. The secure retrieval method for the secret space key words based on the exclusive or filter is characterized by comprising the following steps:
s1, constructing a secure exclusive-or filter at a data owner end, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and then using a secret key Encrypting the space text data set, and uploading the security tree index and the encrypted space text data set to a cloud server;
s2, giving query to user Based on the query/>Generating trapdoors/>And putting the trapdoor/>Uploading to a cloud server, wherein the query/>，/>Location information representing a query point,/>Representing query keyword information,/>Representing a spatial range of query points;
s3, the cloud server performs the operation according to the trapdoor Searching for target space objects/>, in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>Returning to the user side;
s4, the user sets according to the result Query complete ciphertext information/>And uses the key/>For the ciphertext information/>And decrypting to obtain the plaintext information.
2. The secure retrieval method of a dense space keyword based on an exclusive or filter according to claim 1, wherein in the step S1, the constructing a secure exclusive or filter specifically includes:
s10, collecting Mapping the elements in (1) to a secure exclusive-or filter/>In (1), the following steps are obtained:
（2）；
In the formula (2), the amino acid sequence of the compound, For the collection/>Is a secure exclusive-or filter,/>Is an exclusive OR filter,/>Is a random number;
S11, collecting The elements in (a) are added to the array/>, in turnIn each element/>Respectively and correspondingly generating three groups of hash functions/>、/>And/>Based on the hash function/>、/>And/>Calculating to obtain the element/>Corresponding three hash values, i.e./>、/>And/>; Wherein/>，/>Representing collections/>Is a length of (2);
S12, based on each element Three hash values/>、/>And/>The element/>Put into an arrayAt the corresponding position, pair group/>Iterating to find a composition containing only one element/>And initialize a queue to put the element/>Subscript/>Adding the data into a queue;
S13, taking out the stored subscript from the head of the queue And from the array/>Obtain the subscript/>Corresponding element/>And then let it be-Is recorded in a stack from array/>Element removal in/>When the number is/>Contains only one element/>The element/>Subscript/>Added to the queue until array/>No more elements/>And then continuing to sequentially fetch the stored subscripts/>, from the queue of the queueRepeating the above operation until the queue is empty;
s14, creating an AND array The new arrays with equal length are filled with random values, and the recorded/>' is taken out from the stack top of the stack one by oneComputing element/>/>Identify a value and compare the/>Updating the identification value to the secure exclusive-or filter/>In (a) and (b);
s15, finding out each element Three hash values/>、/>And/>Middle and its subscript/>Two inconsistent hash values are obtained in a secure exclusive-or filter/>In (2) the two hash values are used as subscripted values and are matched with the hash valuesPerforming exclusive-or operation on the identification value, and finally performing exclusive-or operation on the identification value at a safe exclusive-or filter/>And updating the exclusive OR operation result.
3. The secure retrieval method of a dense space keyword based on an exclusive or filter according to claim 2, wherein in the step S1, the expression for constructing the secure tree index is:
（3）；
In the formula (3), the amino acid sequence of the compound, Index for security tree,/>Is space text data;
the construction of the security tree index based on the security exclusive-or filter and the geographic hash code specifically comprises the following steps:
s16, utilizing a character random distribution mode to code the space object according to the geographic hash of the space text data Leaf nodes are generated in the form of (1) and a tree index of plaintext is constructed, wherein/>Unique identifier representing a spatial object,/>Prefix-encoded clusters representing the geohash encoding of spatial objects,A set of keywords representing a spatial object;
S17, encrypting the constructed tree index of the plaintext, wherein a pseudo-random counter is used in a non-leaf node Generating pseudo-random number seeds/>Reuse of pseudo-random number seed/>Generating a generated byAssigned character set corresponds/>Values and map them to a secure exclusive-or filter/>In (3), namely:
（4）；
in the formula (4), the amino acid sequence of the compound, Is a secure exclusive OR filter of non-leaf nodes,/>Is an exclusive OR filter,/>Representing/>, corresponding to character setA value;
In leaf nodes, a key is used />, To space objectEncryption is carried out to obtain a space object/>Ciphertext of (2)Pseudo-random number seed/>, is usedPrefix coding cluster/>, of geographic hash codingAll prefix encodings contained generate the corresponding/>Value, and will generate all/>Value mapping to secure exclusive-or filterIn (3), namely:
（5）；
in the formula (5), the amino acid sequence of the compound, Secure exclusive-or filter encoding clusters for prefixes,/>Is an exclusive OR filter,/>Prefix coding cluster/>, representing a geohash codeAll prefixes contained encode corresponding/>A value;
Also, in the leaf node, pseudo-random number seeds are used Keyword set/>All keywords in the list are respectively generated to correspond/>Values and map to secure exclusive-or filter/>In (3), namely:
（6）；
in the formula (6), the amino acid sequence of the compound, Is a secure exclusive-or filter for keywords,/>Is an exclusive OR filter,/>Representing keyword set/>/>, Corresponding to all keywords in (a)Values.
4. The secure retrieval method of secret space key based on exclusive or filter according to claim 1, wherein in step S1, the key is usedEncrypting the space text data set, specifically:
（7）；
In the formula (7), the amino acid sequence of the compound, For an encrypted spatial text data set,/>Is a space text data set comprising space data and text data,/>Is a secret key.
5. The secure retrieval method of secret space key words based on exclusive or filter according to claim 1, wherein in step S2, the query is based onGenerating trapdoors/>The method specifically comprises the following steps:
（8）；
in the formula (8), the amino acid sequence of the compound, Is trapdoor,/>Location information representing a query point,/>Representing query keyword information,/>Representing a spatial range of query points;
wherein, for the position information of the query point Converting the query coordinates into geographic hash codes and according to the given spatial range/>Calculate the corresponding prefix code/>Pseudo-random number seed/>, is usedCalculating the prefix codeIntrinsic/>Value/>Prefix coding/>/>, Of each character of (a)Value/>：
（9）；
In the formula (9), the amino acid sequence of the compound,Encoding/>, for prefixIntrinsic/>Value/>Representing prefix encoding/>Middle/>/>, Of individual charactersValue/>Representing prefix encoding/>/>, Of each character of (a)The set of values is formed by a set of values,Representing prefix encoding/>Is a character length of (a);
For query keyword information Pseudo-random number seed/>, is usedSeparately calculating keyword sets/>/>, Of all keywords in (1)Values expressed as/>：
（10）；
In the formula (10), the amino acid sequence of the compound,Representing keyword set/>/>, Of all keywords in (1)The set of values is formed by a set of values,Representing keyword set/>Middle/>/>, Of individual keywordsValue/>Representing keyword setsThe number of keywords in the list.
6. The secure retrieval method of dense space keywords based on exclusive or filter according to claim 5, wherein in step S3, the result setThe expression of (2) is:
（11）；
In the formula (11), the amino acid sequence of the compound, Representing trapdoor,/>Representing a security tree index;
The cloud server side is based on the trapdoor Searching for target space objects/>, in the security tree indexThe method specifically comprises the following steps:
S31, traversing the prefix codes />, Of each character of (a)Value/>Set of formations/>Searching the security tree index for the/>Value/>Existing secure exclusive-or filter/>Corresponding non-leaf nodes to determine a search range;
S32, finding out all leaf nodes in the search range, and judging prefix codes in each leaf node Whether or not to be in the secure exclusive OR filter/>If yes, continuing to judge the keyword set/>Whether all keys in (a) are in the secure exclusive-or filter/>If yes, the space object stored in the leaf node is determined as the target space objectAnd targets the target space object/>Ciphertext/>Join result set/>Is a kind of medium.
7. The secure retrieval method of secret space key based on exclusive or filter according to claim 1, wherein in step S4, a key is usedFor the ciphertext information/>Decryption is carried out, specifically:
（12）；
In the formula (12), the amino acid sequence of the compound, For the plaintext information obtained after decryption,/>Representing complete ciphertext information found from a result set,/>Is a secret key.
8. The device for realizing the secure retrieval method of the secret space key words based on the exclusive or filter is characterized by comprising a data owner side, a user side and a cloud server side, wherein:
The data owner side is used for constructing a secure exclusive-or filter, constructing a secure tree index based on the secure exclusive-or filter and the geographic hash code, and using a secret key Encrypting the space text data in the security tree index, and uploading the security tree index and the encrypted space text data to a cloud server;
the user is used for given inquiry Based on the query/>Generating trapdoors/>And the trapdoor is openedUploading to a cloud server side; for/> according to the result setQuerying complete ciphertext informationAnd uses the key/>For the ciphertext information/>Decrypting to obtain plaintext information;
The cloud server is used for controlling the trap door according to the cloud server Searching for target space objects in the security tree indexAnd will be described by the target space object/>Ciphertext/>Structured result set/>And returning to the user side.
9. An electronic device, comprising:
At least one processor; and
A memory storing instructions that, when executed by the at least one processor, cause the at least one processor to perform the secure retrieval method of a cryptographic spatial key based on an exclusive or filter as recited in any one of claims 1 to 7.
10. A machine-readable storage medium storing executable instructions that, when executed, cause the machine to perform the secure exclusive or filter based method of secure retrieval of a cryptographic spatial key as recited in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410382369.7A CN117972795B (en) | 2024-04-01 | 2024-04-01 | Secure retrieval method and device for secret space keywords based on exclusive or filter |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410382369.7A CN117972795B (en) | 2024-04-01 | 2024-04-01 | Secure retrieval method and device for secret space keywords based on exclusive or filter |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117972795A true CN117972795A (en) | 2024-05-03 |
| CN117972795B CN117972795B (en) | 2024-06-11 |
Family
ID=90855060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410382369.7A Active CN117972795B (en) | 2024-04-01 | 2024-04-01 | Secure retrieval method and device for secret space keywords based on exclusive or filter |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117972795B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118643055A (en) * | 2024-08-13 | 2024-09-13 | 山东省计算中心（国家超级计算济南中心） | Privacy protection dynamic space keyword query method and device under multi-attribute cost constraint, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130010950A1 (en) * | 2011-07-08 | 2013-01-10 | Sap Ag | Public-Key Encrypted Bloom Filters With Applications To Private Set Intersection |
| CN105681280A (en) * | 2015-12-29 | 2016-06-15 | 西安电子科技大学 | Searchable encryption method based on Chinese in cloud environment |
| JP2018148493A (en) * | 2017-03-08 | 2018-09-20 | 日本放送協会 | Key generator, intermediate encryption device, consignment encryption device, data retrieval device, decryption device, and programs therefor |
| CN113132085A (en) * | 2021-04-14 | 2021-07-16 | 上海同态信息科技有限责任公司 | Ciphertext query method based on searchable encryption |
| CN114416720A (en) * | 2021-12-08 | 2022-04-29 | 西安电子科技大学 | Efficient, flexible and verifiable multi-attribute range retrieval method and system in cloud environment |
-
2024
- 2024-04-01 CN CN202410382369.7A patent/CN117972795B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130010950A1 (en) * | 2011-07-08 | 2013-01-10 | Sap Ag | Public-Key Encrypted Bloom Filters With Applications To Private Set Intersection |
| CN105681280A (en) * | 2015-12-29 | 2016-06-15 | 西安电子科技大学 | Searchable encryption method based on Chinese in cloud environment |
| JP2018148493A (en) * | 2017-03-08 | 2018-09-20 | 日本放送協会 | Key generator, intermediate encryption device, consignment encryption device, data retrieval device, decryption device, and programs therefor |
| CN113132085A (en) * | 2021-04-14 | 2021-07-16 | 上海同态信息科技有限责任公司 | Ciphertext query method based on searchable encryption |
| CN114416720A (en) * | 2021-12-08 | 2022-04-29 | 西安电子科技大学 | Efficient, flexible and verifiable multi-attribute range retrieval method and system in cloud environment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118643055A (en) * | 2024-08-13 | 2024-09-13 | 山东省计算中心（国家超级计算济南中心） | Privacy protection dynamic space keyword query method and device under multi-attribute cost constraint, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117972795B (en) | 2024-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN117972795B (en) | Secure retrieval method and device for secret space keywords based on exclusive or filter | |
| Lei et al. | SecEQP: A secure and efficient scheme for SkNN query problem over encrypted geodata on cloud | |
| CN109992995B (en) | Searchable encryption method supporting location protection and privacy inquiry | |
| Wang et al. | Privacy-preserving ranked multi-keyword fuzzy search on cloud encrypted data supporting range query | |
| Guo et al. | A provably secure and efficient range query scheme for outsourced encrypted uncertain data from cloud-based Internet of Things systems | |
| Gahi et al. | Privacy preserving scheme for location-based services | |
| CN116415079A (en) | Top-K track similarity query method for privacy protection | |
| CN117932125B (en) | Verifiable space keyword query method and device supporting privacy protection | |
| Lei et al. | Fast and secure knn query processing in cloud computing | |
| CN113836447B (en) | Security track similarity query method and system under cloud platform | |
| CN108337085B (en) | Approximate neighbor search construction method supporting dynamic update | |
| Guo et al. | LuxGeo: Efficient and Security-Enhanced Geometric Range Queries | |
| Li et al. | Enabling efficient privacy-preserving spatio-temporal location-based services for smart cities | |
| Khoshgozaran et al. | A taxonomy of approaches to preserve location privacy in location-based services | |
| Akavia et al. | Secure data retrieval on the cloud: Homomorphic encryption meets coresets | |
| CN114416720B (en) | Efficient, flexible and verifiable multi-attribute range retrieval method and system in cloud environment | |
| Zhang et al. | LPPS‐AGC: Location Privacy Protection Strategy Based on Alt‐Geohash Coding in Location‐Based Services | |
| CN113722366B (en) | Safety data retrieval method based on careless ciphertext inverted index | |
| Xue et al. | Cuckoo-filter based privacy-aware search over encrypted cloud data | |
| CN112995987B (en) | Self-adaptive road network semantic position privacy protection method based on multi-objective optimization problem | |
| CN118643055B (en) | Privacy protection dynamic space keyword query method and device under multi-attribute cost constraint, electronic equipment and storage medium | |
| Liu et al. | K-nearest neighbor queries over encrypted data | |
| KR101481906B1 (en) | System and method for preserving location data privacy in outsource database | |
| Gong et al. | Multi-keyword search guaranteeing forward and backward privacy over large-scale cloud data | |
| Yamaguchi et al. | Privacy preserving data processing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |