CN113239260A - Multi-attribute outsourcing data query and verification method based on cuckoo filter - Google Patents
Multi-attribute outsourcing data query and verification method based on cuckoo filter Download PDFInfo
- Publication number
- CN113239260A CN113239260A CN202110541468.1A CN202110541468A CN113239260A CN 113239260 A CN113239260 A CN 113239260A CN 202110541468 A CN202110541468 A CN 202110541468A CN 113239260 A CN113239260 A CN 113239260A
- Authority
- CN
- China
- Prior art keywords
- query
- node
- data
- attribute
- nodes
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9532—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9035—Filtering based on additional data, e.g. user or group profiles
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/906—Clustering; Classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a multi-attribute outsourcing data query and verification method based on a cuckoo filter, which comprises the following steps: step 1, a data owner preprocesses an external packet data set and generates auxiliary information, wherein the auxiliary information comprises node verification information and multi-attribute verification information; step 2, the data owner issues the generated auxiliary information to the data consumer and provides the outsourced data set to an outsourced data service provider; step 3, the data consumer sends the inquiry condition to the outsourced data service provider; and 4, the outsourced data service provider receives the query condition of the data consumer, processes the query condition and returns a query result and auxiliary information to the data consumer. The invention converts the multi-attribute outsourcing data query operation into the intersection operation of the single-attribute query result or the union operation of the single-attribute query result based on the cuckoo filter, reduces the calculation cost and realizes the verification of the multi-attribute outsourcing data query result.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a multi-attribute outsourcing data query and verification method based on a cuckoo filter.
Background
With the rapid development of the internet and the rapid popularization of mobile terminals, online networks have become an important platform for people to live, work and communicate. Currently, the volume of global network data is growing at an unprecedented rate and scale. The potential value of data implication is discovered and valued, and people have come to the network big data age. The conventional data acquisition method acquires data through a data interface provided by a data owner. For example, the microblog provides a REST interface, and can acquire and acquire microblog, comments, official analysis data and the like. However, the data obtained in this way is often incomplete, relatively one-sided or even incorrect. Data outsourcing services are an emerging mode for efficiently accessing and obtaining data. This service model consists of three entities: data owners, outsourced data service providers, and data consumers. In this outsourcing service, a third party outsourcing data service provider purchases a complete data set from a data owner and resells it to a data consumer on demand. However, not all third party outsourced data service providers are trusted, and the third party outsourced data service providers may add, delete or modify the provided data to return wrong query results in the process of reselling the data to the data consumers due to economic benefits. When the consumer of the data uses the false data, the legitimate rights of the consumer are necessarily damaged. The basic idea of the current solution to this problem is that first, a data owner constructs signature information based on original data, and then provides the original data and auxiliary information to an outsourced data service provider; when a data consumer inquires data from a foreign data service provider, the latter returns the inquired data and corresponding verification information; and finally, the data consumer utilizes the public key to check the signature information, so that the authenticity of the returned query result is verified. The existing schemes are mainly classified into a signature chain-based query verification scheme and an MHT-based query scheme. However, the scheme is only suitable for query verification of single-attribute outsourced data, and at present, no query verification scheme is provided for multi-attribute outsourced data.
Disclosure of Invention
The invention provides a multi-attribute outsourcing data query and verification method based on a cuckoo filter, and aims to solve the problems that a traditional query and verification method is only suitable for query and verification of single-attribute outsourcing data and high in calculation cost.
In order to achieve the above object, an embodiment of the present invention provides a multi-attribute outsourcing data query validation method based on a cuckoo filter, including:
step 3, the data consumer sends the inquiry condition to the outsourced data service provider;
step 6, node integrity verification of intersection or union operation of the node sets is carried out on the returned query results, and when the returned query results are node set intersections, intersection verification algorithm based on the brook bird filter is adopted for verification; when the returned query result is a node set union set, adopting a union set verification algorithm based on a cuckoo filter to verify; when the verification of all the intersection sets or the union sets in the returned query results is passed, the nodes in the returned query results are complete, and step 7 is executed; when one of the verification of all the intersection sets or the union sets in the returned query result fails, the nodes in the returned query result are incomplete, and the verification is finished;
step 7, performing integrity verification on edges in the returned query result, and when the integrity verification is passed, the returned query result is real and complete, so as to complete verification on the returned query result; and when the edge integrity verification fails, the returned query result is incomplete, and the verification is finished.
Wherein, the step 1 specifically comprises:
the steps of generating the auxiliary information are as follows:
step 11, modeling the outsourced data into an undirected graph, wherein each node in the undirected graph corresponds to a unique data entity, the data entities are data users with multidimensional characteristics, each node has a plurality of characteristic attributes, the attributes are entity identifiers, when a relationship exists between the data entities, an edge exists between the two nodes, and the relationship is a correlation relationship between the data entities; the data owner links the identification information of each node with the attribute value thereof respectively to obtain pi,pi=(IDi||bi,1||...||bi,w),piIdentification information indicating node i links attribute value, ID, of node iiIdentification information representing node i, biRepresenting the attributes of node i, bi,wRepresenting the attribute value of the node i, calculating the hash value h of each node after linkagei,hi=H(pi) (ii) a All neighbor nodes N of each node are searchediCalculating the hash value H (ID) of the identification information of each node and the identification information of all the adjacent nodes corresponding to each nodei||IDj)|j∈NiH (ID)i||IDj) Cuckling cuckoo filter FiWhere H (x) denotes a hash function, NiSet of all neighbor nodes, ID, representing node ijIdentification information representing a neighbor node, FiIndicating that identification information of each node is stored and corresponding to each nodeA cuckoo filter for hash values of identification information of all neighbor nodes;
step 12, the data owner links the hash value h of each nodeiAnd cuckoo filter FiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature;
step 13, auxiliary information of attribute value of data owner to attribute of each nodePerforming a calculation of 1<j<kmJ denotes a node, m denotes the number of attribute values in the attribute k, vk,jRepresenting attribute values, ascending order of attribute values, auxiliary informationIncludes two fields of information Fk,jThe cuckoo filters representing the hash values of all nodes storing the attribute values respectively store the hash values of all nodes corresponding to one attribute value into one cuckoo filter to obtain a plurality of cuckoo filters Fk,jAll cuckoo filters Fk,jIs a samsung bird filter, wherein the samsung bird filter means that the samsung bird filter has the same hash function, fingerprint generation function, and the same number of buckets;
step 14, the data owner assigns the attribute value v of each attributek,jAuxiliary information ofConstructing the Merkle tree as leaf nodes of the Merkle treeAnd for Merkle treesAnd signing the root node.
Wherein, the step 4 specifically comprises:
step 41, assuming that the attributes include attribute 1 and attribute 2, the query condition is R1ΘR2Wherein, Θ represents intersection n or union u, outsourced data service provider searches the outsourced data set for satisfying range query condition R after receiving query condition1And satisfies the range query condition R2To obtain a node satisfying the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2According to satisfaction of the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2Obtaining a node set V', V ═ V satisfying all query conditions1ΘV2When the query condition is R1∩R2When V ═ V1∩V2When the query condition is R1∪R2When V ═ V1∪V2(ii) a Obtaining an edge set E ' corresponding to the node set V ' satisfying all the query conditions, wherein E ' is { E }i,j|ei,jE, i E V ', j V ', E ' represents the set of edges that satisfy all the query conditions, Ei,jRepresenting the edges meeting the query conditions, i representing the nodes meeting the query conditions, j representing the nodes meeting the query conditions, and E representing the edge set of the undirected graph of the original outintersected data set; representing the query results of the nodes and edges which meet all the query conditions by using a subgraph G ' ═ V ', E ';
step 42 outsourced data service provider obtains a query result set thetai=<pi,Fi|i∈V'′>And collecting the query result thetaiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature;
step 43, the outsourcing data service provider inquires in the outsourcing data set that the inquiry conditions R are met respectively1And satisfies the query condition R2To obtain a set of attribute values satisfying the queryCondition R1Set of attribute values ofAnd satisfies the query condition R2Set of attribute values ofOutsourcing data service provider respectively calculates auxiliary information of attribute value in two attribute value sets Wherein k represents an attribute, k is 1, 2; j is an element of [ x ]1,y1]Or j ∈ [ x ]2,y2],v1Representing attributes 1, v1,jAttribute value, x, representing attribute 11Indicating satisfaction of the query condition R1Minimum value end point of, y1Indicating satisfaction of the query condition R1Maximum end of, v2Representing attributes 2, v2,jAttribute value, x, representing attribute 22Indicating satisfaction of the query condition R2Minimum value end point of, y2Indicating satisfaction of the query condition R2The maximum endpoint of (1);
step 44, outsourced data service provider will satisfy the query condition R1As leaf nodes of the Merkle tree, construct the Merkle treeWill satisfy the query condition R2As leaf nodes of the Merkle tree, construct the Merkle treeAnd respectively to Merkle treesAnd Merkle TreeA root node signature;
step 45, the outsourcing data service provider returns a query result to the data consumer, wherein the query result comprises a query result set thetai=<pi,Fi|i∈V'′>,{(IDi,IDj)|ei,jE.g. E' }, Merkle tree TθMerkle TreeAnd Merkle TreeInternal node information and Merkle tree TθMerkle TreeAnd Merkle TreeIs signed by the root node of (1), wherein { (ID)i,IDj)|ei,jE' represents two endpoint identifications of the query result edge set.
Wherein, the step 5 specifically comprises:
step 51, the data consumer verifies the node set V 'meeting all the query conditions in the returned query result, and respectively verifies the hash value h obtained by linking the identification information of each node in the node set V' meeting all the query conditions in the returned query result with the attribute value of the node set ViCalculating; and according to Merkle tree T in returned query resultθReconstructing the Merkle tree TθA root node of;
step 52, the data consumer provides the auxiliary information of the attribute value in the returned query resultThe verification is carried out, and the data consumer is according to the Merkle tree in the returned query resultAnd Merkle TreeInner node information of (1), reconstructing the Merkle treeAnd Merkle TreeA root node of;
step 53, for the reconstructed Merkle tree TθMerkle TreeAnd Merkle TreeThe root nodes of the Merkle tree are judged, when all Merkle tree root nodes are constructed to be correct according to the returned query result, the data consumer verifies the root nodes of all Merkle trees by using the signature provided by the data owner, when all the Merkle tree root nodes pass the verification, the returned query result is real, and when one Merkle tree root node in all the Merkle tree root nodes fails to pass the verification, the returned query result is not real.
Wherein, the step 6 specifically comprises:
step 61, when the query condition is R1∩R2Then, the node set V' satisfying all the query conditions is set as V1∩V2Performing node integrity verification on the node set V' meeting all query conditions by adopting an intersection verification algorithm based on the cuckoo filter, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete; when the query condition is R1∪R2Then, the node set V' satisfying all the query conditions is set as V1∪V2Adopting a union set verification algorithm pair based on the cuckoo filterAnd carrying out node integrity verification on the node set V' with the query condition, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete.
Wherein, the step 7 specifically comprises:
set of edges satisfying all query conditions in returned query results { (ID)i,IDj)|ei,jE' is validated when Ei,jWhen the E' belongs to, the data consumer judges H (ID)i||IDj) Whether or not at cuckoo filter FiNeutralizing H (ID)j||IDi) Whether or not at cuckoo filter FjPerforming the following steps; when in useWhen the data consumer judges H (ID)i||IDj) Whether or not the cuckoo filter F is absentiNeutralizing H (ID)j||IDi) Whether or not the cuckoo filter F is absentjPerforming the following steps; when e isi,jE.g. E' andwhen all the verification of (1) is successful, all edges in the returned query result are complete, wherein H (ID)i||IDj) Hash value, H (ID), representing identification information of node i linking identification information of node jj||IDi) Identification information representing node j links hash value of identification information of node i, FjAnd the cuckoo filter represents hash values of the identification information of the storage node j and the identification information of all the neighbor nodes.
Wherein the cuckoo filter-based intersection validation comprises:
when the query condition is R1∩R2When the query is completed, the node set meeting all the query conditions is verified to be V ═ V1∩V2Is provided with I1,jFor attribute values v containing attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mFor attribute values v containing attribute 22,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∩mWhether or not equal to F1,j∩F2,mWherein V ═ Vj∩m,Vj∩mRepresenting attribute values v in query results1,jAnd v2,mThe intersection of (a); will Vj∩m、F1,jAnd F2,mInputting the data into an intersection verification algorithm based on the cuckoo filters to judge a set Vj∩mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∩mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∩mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∪mFingerprint information of the element(s), judgment F1,jAnd F2,mWhether or not there is a common element in (1), when F1,jAnd F2,mWhen common elements exist in the algorithm, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mIf no common element exists in the algorithm, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
Wherein the cuckoo filter-based union validation comprises:
when the query condition is R1∪R2When the query is completed, the node set meeting all the query conditions is verified to be V ═ V1∪V2Is provided with I1,jFor attribute values v containing attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mFor attribute values v containing attribute 22,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∪mWhether or not equal to F1,j∪F2,mWill Vj∪m、F1,jAnd F2,mInputting the data into a set verification algorithm based on union between cuckoo filters, and judging a set Vj∪mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∪mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∪mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∪mFingerprint information of the element(s); judgment of F1,jAnd F2,mWhether or not it is empty, when F1,jAnd F2,mWhen the result is not empty, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mWhen the result is empty, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
The scheme of the invention has the following beneficial effects:
in the multi-attribute outsourcing data query and verification method based on the cuckoo filter, the multi-attribute outsourcing data query operation is converted into the intersection operation of the single-attribute query result or the union operation of the single-attribute query result, and the intersection and union verifiable method is realized based on the cuckoo filter, so that the calculation cost is reduced, and the verification of the multi-attribute outsourcing data query result is realized.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a schematic structural view of the present invention;
FIG. 3 is an undirected graph of the present invention;
FIG. 4 is a flow chart of an intersection verification algorithm based on a cuckoo filter of the present invention;
FIG. 5 is a flow chart of a cuckoo filter-based union verification algorithm of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages of the present invention more apparent, the following detailed description is given with reference to the accompanying drawings and specific embodiments.
The invention provides a multi-attribute outsourced data query and verification method based on a cuckoo filter, aiming at the problems that the existing query and verification method is only suitable for query and verification of single-attribute outsourced data and high in calculation cost.
As shown in fig. 1 to 5, an embodiment of the present invention provides a multi-attribute outsourcing data query validation method based on a cuckoo filter, including: step 1, a data owner preprocesses an external packet data set and generates auxiliary information, wherein the auxiliary information comprises node verification information and multi-attribute verification information; step 2, the data owner issues the generated auxiliary information to the data consumer and provides the outsourced data set to an outsourced data service provider; step 3, the data consumer sends the inquiry condition to the outsourced data service provider; step 4, the outsourced data service provider receives the query conditions of the data consumer, processes the query conditions and returns the query results and the auxiliary information to the data consumer; step 5, the data consumer carries out authenticity check on the query result returned by the external data service provider through the Merkle tree, when the authenticity verification is passed, the returned query result is real, and step 6 is executed; when the authenticity verification fails, the returned query result is not authentic, and the verification is finished; step 6, node integrity verification of intersection or union operation of the node sets is carried out on the returned query results, and when the returned query results are node set intersections, intersection verification algorithm based on the brook bird filter is adopted for verification; when the returned query result is a node set union set, adopting a union set verification algorithm based on a cuckoo filter to verify; when the verification of all the intersection sets or the union sets in the returned query results is passed, the nodes in the returned query results are complete, and step 7 is executed; when one of the verification of all the intersection sets or the union sets in the returned query result fails, the nodes in the returned query result are incomplete, and the verification is finished; step 7, performing integrity verification on edges in the returned query result, and when the integrity verification is passed, the returned query result is real and complete, so as to complete verification on the returned query result; and when the edge integrity verification fails, the returned query result is incomplete, and the verification is finished.
In the multi-attribute outsourced data query and verification method based on the cuckoo filter in the embodiment of the invention, the multi-attribute query is the sum of a plurality of single-attribute queries or the combination of a plurality of single-attribute queries, so that the result of the multi-attribute query can be regarded as intersection or union operation meeting the result of the single-attribute query, the multi-attribute outsourced data query and verification method based on the cuckoo filter provides a verifiable method for realizing intersection and union based on the cuckoo filter, reduces the calculation cost, allows a data consumer to perform authenticity check on the outsourced data query result of the multi-attribute, and the query result meets the following two requirements, namely data authenticity is proved: 1. data correctness: the query data meets the query conditions provided by the data consumer; 2. data integrity: the query data must be complete rather than a subset of the complete query data set that is truncated to satisfy the query conditions.
Wherein, the step 1 specifically comprises: the steps of generating the auxiliary information are as follows: step 11, mixingOutsourcing data is modeled into an undirected graph, wherein each node in the undirected graph corresponds to a unique data entity, the data entities are data users with multidimensional characteristics, each node has a plurality of characteristic attributes, the attributes are entity identifications, when a relationship exists between the data entities, an edge exists between the two nodes, and the relationship is a correlation relationship between the data entities; the data owner links the identification information of each node with the attribute value thereof respectively to obtain pi,pi=(IDi||bi,1||...||bi,w),piIdentification information indicating node i links attribute value, ID, of node iiIdentification information representing node i, biRepresenting the attributes of node i, bi,wRepresenting the attribute value of the node i, calculating the hash value h of each node after linkagei,hi=H(pi) (ii) a All neighbor nodes N of each node are searchediCalculating the hash value H (ID) of the identification information of each node and the identification information of all the adjacent nodes corresponding to each nodei||IDj)|j∈NiH (ID)i||IDj) Cuckling cuckoo filter FiWhere H (x) denotes a hash function, NiSet of all neighbor nodes, ID, representing node ijIdentification information representing a neighbor node, FiA cuckoo filter for storing the hash value of the identification information of each node and the identification information of all the neighbor nodes corresponding to each node; step 12, the data owner links the hash value h of each nodeiAnd cuckoo filter FiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature; step 13, auxiliary information of attribute value of data owner to attribute of each nodePerforming a calculation of 1<j<kmJ denotes a node, m denotes the number of attribute values in the attribute k, vk,jRepresenting attribute values, ascending order of attribute values, auxiliary informationIncludes two fields of informationFk,jThe cuckoo filters representing the hash values of all nodes storing the attribute values respectively store the hash values of all nodes corresponding to one attribute value into one cuckoo filter to obtain a plurality of cuckoo filters Fk,jAll cuckoo filters Fk,jIs a samsung bird filter, wherein the samsung bird filter means that the samsung bird filter has the same hash function, fingerprint generation function, and the same number of buckets; step 14, the data owner assigns the attribute value v of each attributek,jAuxiliary information ofConstructing the Merkle tree as leaf nodes of the Merkle treeAnd for Merkle treesAnd signing the root node.
According to the multi-attribute outsourcing data query and verification method based on the cuckoo filter, outsourcing data is modeled into the undirected graph, each node in the undirected graph corresponds to a unique data entity, and the data entities are data users with multi-dimensional characteristics, such as users in a social network and edge devices in the internet of things. Each node has a plurality of characteristic attributes, such as entity identification and the like, and when a relationship exists between data entities, an edge exists between two nodes, where the relationship is a correlation relationship between the data entities, such as a friend relationship in a social network, device interconnection in the internet of things and the like, and if and only if two cuckoo filters have the same hash function, fingerprint generation function and the same number of buckets, the two cuckoo filters are homologous.
Wherein, the step 4 specifically comprises: step 41, assuming that the attributes include attribute 1 and attribute 2, the query condition is R1ΘR2Wherein, Θ represents intersection n or union u, outsourced data service provider searches the outsourced data set for satisfying range query condition R after receiving query condition1And satisfies the range query condition R2To obtain a node satisfying the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2According to satisfaction of the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2Obtaining a node set V', V ═ V satisfying all query conditions1ΘV2When the query condition is R1∩R2When V ═ V1∩V2When the query condition is R1∪R2When V ═ V1∪V2(ii) a Obtaining an edge set E ' corresponding to the node set V ' satisfying all the query conditions, wherein E ' is { E }i,j|ei,jE, i E V ', j V ', E ' represents the set of edges that satisfy all the query conditions, Ei,jRepresenting the edges meeting the query conditions, i representing the nodes meeting the query conditions, j representing the nodes meeting the query conditions, and E representing the edge set of the undirected graph of the original outintersected data set; representing the query results of the nodes and edges which meet all the query conditions by using a subgraph G ' ═ V ', E '; step 42 outsourced data service provider obtains a query result set thetai=<pi,Fi|i∈V'>And collecting the query result thetaiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature; step 43, the outsourcing data service provider inquires in the outsourcing data set that the inquiry conditions R are met respectively1And satisfies the query condition R2To obtain the attribute value set satisfying the query condition R1Set of attribute values ofAnd satisfies the query condition R2Set of attribute values ofOutsourcing data service provider respectively calculates auxiliary information of attribute value in two attribute value setsWherein k represents an attribute, k is 1, 2; j is an element of [ x ]1,y1]Or j ∈ [ x ]2,y2],v1Representing attributes 1, v1,jAttribute value, x, representing attribute 11Indicating satisfaction of the query condition R1Minimum value end point of, y1Indicating satisfaction of the query condition R1Maximum end of, v2Representing attributes 2, v2,jAttribute value, x, representing attribute 22Indicating satisfaction of the query condition R2Minimum value end point of, y2Indicating satisfaction of the query condition R2The maximum endpoint of (1); step 44, outsourced data service provider will satisfy the query condition R1As leaf nodes of the Merkle tree, construct the Merkle treeWill satisfy the query condition R2As leaf nodes of the Merkle tree, construct the Merkle treeAnd respectively to Merkle treesAnd Merkle TreeA root node signature; step 45, the outsourcing data service provider returns a query result to the data consumer, wherein the query result comprises a query result set thetai=<pi,Fi|i∈V'>,{(IDi,IDj)|ei,jE.g. E' }, Merkle tree TθMerkle TreeAnd Merkle TreeInternal node information and Merkle tree TθMerkle TreeAnd Merkle TreeIs signed by the root node of (1), wherein { (ID)i,IDj)|ei,jE' represents two endpoint identifications of the query result edge set.
In the multi-attribute outsourced data query validation method based on the cuckoo filter according to the above embodiment of the present invention, any subset and equality query can be converted into a range query, so that the query on the multi-attribute outsourced data of the returned query result can be converted into an intersection or union operation R of the single-attribute range query results1ΘR2Θ...RwWherein W is the number of attributes, R is the query condition, Θ can be &or &, and when the attributes include 1,21ΘR2Θ...RwIn order to avoid loss of generality, the query with the query condition R can be implemented in a similar manner1And query condition R2For example.
Wherein, the step 5 specifically comprises: step 51, the data consumer verifies the node set V 'meeting all the query conditions in the returned query result, and respectively verifies the hash value h obtained by linking the identification information of each node in the node set V' meeting all the query conditions in the returned query result with the attribute value of the node set ViCalculating; and according to Merkle tree T in returned query resultθReconstructing the Merkle tree TθA root node of; step 52, the data consumer provides the auxiliary information of the attribute value in the returned query resultThe verification is carried out, and the data consumer is according to the Merkle tree in the returned query resultAnd Merkle TreeInner node information of (1), reconstructing the Merkle treeAnd Merkle TreeA root node of; step 53, for the reconstructed Merkle tree TθMerkle TreeAnd Merkle TreeThe root nodes of the Merkle tree are judged, when all Merkle tree root nodes are constructed to be correct according to the returned query result, the data consumer verifies the root nodes of all Merkle trees by using the signature provided by the data owner, when all the Merkle tree root nodes pass the verification, the returned query result is real, and when one Merkle tree root node in all the Merkle tree root nodes fails to pass the verification, the returned query result is not real.
Wherein, the step 6 specifically comprises: step 61, when the query condition is R1∩R2Then, the node set V' satisfying all the query conditions is set as V1∩V2Performing node integrity verification on the node set V' meeting all query conditions by adopting an intersection verification algorithm based on the cuckoo filter, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete; when the query condition is R1∪R2When the query condition is satisfied, the node set V' satisfying all the query conditionsV1∪V2And carrying out node integrity verification on the node set V' meeting all the query conditions by adopting a union set verification algorithm based on the cuckoo filter, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete.
Wherein, the step 7 specifically comprises: set of edges satisfying all query conditions in returned query results { (ID)i,IDj)|ei,jE' is validated when Ei,jWhen the E' belongs to, the data consumer judges H (ID)i||IDj) Whether or not at cuckoo filter FiNeutralizing H (ID)j||IDi) Whether or not at cuckoo filter FjPerforming the following steps; when in useWhen the data consumer judges H (ID)i||IDj) Whether or not the cuckoo filter F is absentiNeutralizing H (ID)j||IDi) Whether or not the cuckoo filter F is absentjPerforming the following steps; when e isi,jE.g. E' andwhen all the verification of (1) is successful, all edges in the returned query result are complete, wherein H (ID)i||IDj) Hash value, H (ID), representing identification information of node i linking identification information of node jj||IDi) Identification information representing node j links hash value of identification information of node i, FjAnd the cuckoo filter represents hash values of the identification information of the storage node j and the identification information of all the neighbor nodes.
Wherein the cuckoo filter-based intersection validation comprises: when the query condition is R1∩R2When the query is completed, the node set meeting all the query conditions is verified to be V ═ V1∩V2Is provided with I1,jFor attribute values v containing attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mFor attribute values v containing attribute 22,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∩mWhether or not equal to F1,j∩F2,mWherein V ═ Vj∩m,Vj∩mRepresenting attribute values v in query results1,jAnd v2,mThe intersection of (a); will Vj∩m、F1,jAnd F2,mInputting the data into an intersection verification algorithm based on the cuckoo filters to judge a set Vj∩mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∩mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∩mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∩mFingerprint information of the element(s), judgment F1,jAnd F2,mWhether or not there is a common element in (1), when F1,jAnd F2,mWhen common elements exist in the algorithm, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mIf no common element exists in the algorithm, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
Wherein the cuckoo filter-based union validation comprises: when the query condition is R1∪R2When the query is completed, the node set meeting all the query conditions is verified to be V ═ V1∪V2Is provided with I1,jIs a bagAttribute value v containing Attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mFor attribute values v containing attribute 22,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∪mWhether or not equal to F1,j∪F2,mWill Vj∪m、F1,jAnd F2,mInputting the data into a set verification algorithm based on union between cuckoo filters, and judging a set Vj∪mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∪mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∪mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∪mFingerprint information of the element(s); judgment of F1,jAnd F2,mWhether or not it is empty, when F1,jAnd F2,mWhen the result is not empty, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mWhen the result is empty, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
In the query and verification method for multi-attribute outsourced data based on the cuckoo filter in the embodiment of the invention, a data owner preprocesses an original data set, constructs auxiliary information (node verification information and multi-attribute verification information), issues the generated auxiliary information to a data consumer, provides the original data set to a third-party outsourced data service provider, the third-party outsourced data service provider receives query conditions of the data consumer, processes the query conditions, returns query results and the auxiliary verification information to the data consumer, the data consumer performs authenticity check on the query results through a Merkle tree, verifies the correctness and integrity of the returned multi-attribute outsourced data query results based on an intersection and union verification method realized by the cuckoo filter, and realizes that the multi-attribute outsourced data query operation is converted into intersection operation or single-attribute query result union operation of single-attribute query results, and the verifiable method of intersection and union is realized based on the cuckoo filter, the calculation expense is reduced, and the verification of the multi-attribute outsourced data query result is realized.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (8)
1. A multi-attribute outsourcing data query verification method based on a cuckoo filter is characterized by comprising the following steps:
step 1, a data owner preprocesses an external packet data set and generates auxiliary information, wherein the auxiliary information comprises node verification information and multi-attribute verification information;
step 2, the data owner issues the generated auxiliary information to the data consumer and provides the outsourced data set to an outsourced data service provider;
step 3, the data consumer sends the inquiry condition to the outsourced data service provider;
step 4, the outsourced data service provider receives the query conditions of the data consumer, processes the query conditions and returns the query results and the auxiliary information to the data consumer;
step 5, the data consumer carries out authenticity check on the query result returned by the external data service provider through the Merkle tree, when the authenticity verification is passed, the returned query result is real, and step 6 is executed; when the authenticity verification fails, the returned query result is not authentic, and the verification is finished;
step 6, node integrity verification of intersection or union operation of the node sets is carried out on the returned query results, and when the returned query results are node set intersections, intersection verification algorithm based on the brook bird filter is adopted for verification; when the returned query result is a node set union set, adopting a union set verification algorithm based on a cuckoo filter to verify; when the verification of all the intersection sets or the union sets in the returned query results is passed, the nodes in the returned query results are complete, and step 7 is executed; when one of the verification of all the intersection sets or the union sets in the returned query result fails, the nodes in the returned query result are incomplete, and the verification is finished;
step 7, performing integrity verification on edges in the returned query result, and when the integrity verification is passed, the returned query result is real and complete, so as to complete verification on the returned query result; and when the edge integrity verification fails, the returned query result is incomplete, and the verification is finished.
2. The cuckoo filter-based multi-attribute outsourcing data query validation method according to claim 1, wherein the step 1 specifically comprises:
the steps of generating the auxiliary information are as follows:
step 11, modeling the outsourced data into an undirected graph, wherein each node in the undirected graph corresponds to a unique data entity, the data entities are data users with multidimensional characteristics, each node has a plurality of characteristic attributes, the attributes are entity identifiers, when a relationship exists between the data entities, an edge exists between the two nodes, and the relationship is a correlation relationship between the data entities; the data owner links the identification information of each node with the attribute value thereof respectively to obtain pi,pi=(IDi||bi,1||...||bi,w),piIdentification information indicating node i links attribute value, ID, of node iiIdentification information representing node i, biRepresenting the attributes of node i, bi,wRepresenting the attribute value of the node i, calculating the hash value h of each node after linkagei,hi=H(pi) (ii) a All neighbor nodes N of each node are searchediCalculating the hash value H (ID) of the identification information of each node and the identification information of all the adjacent nodes corresponding to each nodei||IDj)|j∈NiH (ID)i||IDj) Cuckling cuckoo filter FiWhere H (x) denotes a hash function, NiSet of all neighbor nodes, ID, representing node ijIdentification information representing a neighbor node, FiA cuckoo filter for storing the hash value of the identification information of each node and the identification information of all the neighbor nodes corresponding to each node;
step 12, the data owner links the hash value h of each nodeiAnd cuckoo filter FiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature;
step 13, auxiliary information of attribute value of data owner to attribute of each nodePerforming a calculation of 1<j<kmJ denotes a node, m denotes the number of attribute values in the attribute k, vk,jRepresenting attribute values, ascending order of attribute values, auxiliary informationIncludes two fields of information Fk,jThe cuckoo filters representing the hash values of all nodes storing the attribute values respectively store the hash values of all nodes corresponding to one attribute value into one cuckoo filter to obtain a plurality of cuckoo filters Fk,jAll cuckoo filters Fk,jIs a samsung bird filter, wherein the samsung bird filter means that the samsung bird filter has the same hash function, fingerprint generation function, and the same number of buckets;
3. The cuckoo filter-based multi-attribute outsourcing data query validation method of claim 2, wherein the step 4 specifically comprises:
step 41, assuming that the attributes include attribute 1 and attribute 2, the query condition is R1ΘR2Wherein, Θ represents intersection n or union u, outsourced data service provider searches the outsourced data set for satisfying range query condition R after receiving query condition1And satisfies the range query condition R2To obtain a node satisfying the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2According to satisfaction of the query condition R1Set of nodes V1And satisfies the query condition R2Set of nodes V2Obtaining a node set V', V ═ V satisfying all query conditions1ΘV2When the query condition is R1∩R2When V ═ V1∩V2When is coming into contact withThe query condition is R1∪R2When V ═ V1∪V2(ii) a Obtaining an edge set E ' corresponding to the node set V ' satisfying all the query conditions, wherein E ' is { E }i,j|ei,jE, i E V ', j V ', E ' represents the set of edges that satisfy all the query conditions, Ei,jRepresenting the edges meeting the query conditions, i representing the nodes meeting the query conditions, j representing the nodes meeting the query conditions, and E representing the edge set of the undirected graph of the original outintersected data set; representing the query results of the nodes and edges which meet all the query conditions by using a subgraph G ' ═ V ', E ';
step 42 outsourced data service provider obtains a query result set thetai=<pi,Fi|i∈V'>And collecting the query result thetaiConstructing Merkle Tree T as leaf node of Merkle TreeθAnd for Merkle tree TθA root node signature;
step 43, the outsourcing data service provider inquires in the outsourcing data set that the inquiry conditions R are met respectively1And satisfies the query condition R2To obtain the attribute value set satisfying the query condition R1Set of attribute values ofAnd satisfies the query condition R2Set of attribute values ofOutsourcing data service provider respectively calculates auxiliary information of attribute value in two attribute value sets Wherein k represents an attribute, k is 1, 2; j is an element of [ x ]1,y1]Or j ∈ [ x ]2,y2],v1Representing attributes 1, v1,jAttribute value, x, representing attribute 11Indicating satisfaction of the query condition R1Minimum value end point of, y1Indicating satisfaction of the query condition R1Maximum end of, v2Representing attributes 2, v2,jAttribute value, x, representing attribute 22Indicating satisfaction of the query condition R2Minimum value end point of, y2Indicating satisfaction of the query condition R2The maximum endpoint of (1);
step 44, outsourced data service provider will satisfy the query condition R1As leaf nodes of the Merkle tree, construct the Merkle treeWill satisfy the query condition R2As leaf nodes of the Merkle tree, construct the Merkle treeAnd respectively to Merkle treesAnd Merkle TreeA root node signature;
step 45, the outsourcing data service provider returns a query result to the data consumer, wherein the query result comprises a query result set thetai=<pi,Fi|i∈V'>,{(IDi,IDj)|ei,jE.g. E' }, Merkle tree TθMerkle TreeAnd Merkle TreeInternal node information and Merkle tree TθMerkle TreeAnd Merkle TreeIs signed by the root node of (1), wherein { (ID)i,IDj)|ei,jE' represents two endpoint identifications of the query result edge set.
4. The cuckoo-filter-based multi-attribute outsourcing data query validation method according to claim 3, wherein the step 5 specifically comprises:
step 51, the data consumer verifies the node set V 'meeting all the query conditions in the returned query result, and respectively verifies the hash value h obtained by linking the identification information of each node in the node set V' meeting all the query conditions in the returned query result with the attribute value of the node set ViCalculating; and according to Merkle tree T in returned query resultθReconstructing the Merkle tree TθA root node of;
step 52, the data consumer provides the auxiliary information of the attribute value in the returned query resultThe verification is carried out, and the data consumer is according to the Merkle tree in the returned query resultAnd Merkle TreeInner node information of (1), reconstructing the Merkle treeAnd Merkle TreeA root node of;
step 53, for reconstructed Merkle Tree TθMerkle TreeAnd Merkle TreeThe root nodes of the Merkle tree are judged, when all Merkle tree root nodes are constructed to be correct according to the returned query result, the data consumer verifies the root nodes of all Merkle trees by using the signature provided by the data owner, when all the Merkle tree root nodes pass the verification, the returned query result is real, and when one Merkle tree root node in all the Merkle tree root nodes fails to pass the verification, the returned query result is not real.
5. The cuckoo-filter-based multi-attribute outsourcing data query validation method according to claim 4, wherein the step 6 specifically comprises:
step 61, when the query condition is R1∩R2Then, the node set V' satisfying all the query conditions is set as V1∩V2Performing node integrity verification on the node set V' meeting all query conditions by adopting an intersection verification algorithm based on the cuckoo filter, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete; when the query condition is R1∪R2Then, the node set V' satisfying all the query conditions is set as V1∪V2And carrying out node integrity verification on the node set V' meeting all the query conditions by adopting a union set verification algorithm based on the cuckoo filter, wherein when the verification is passed, the nodes in the returned result are complete, and when the verification is not passed, the nodes in the returned result are incomplete.
6. The cuckoo-filter-based multi-attribute outsourcing data query validation method according to claim 5, wherein the step 7 specifically comprises:
to return toThe set of edges satisfying all query conditions in the query result of (1 { (ID)i,IDj)|ei,jE' is validated when Ei,jWhen the E' belongs to, the data consumer judges H (ID)i||IDj) Whether or not at cuckoo filter FiNeutralizing H (ID)j||IDi) Whether or not at cuckoo filter FjPerforming the following steps; when in useWhen the data consumer judges H (ID)i||IDj) Whether or not the cuckoo filter F is absentiNeutralizing H (ID)j||IDi) Whether or not the cuckoo filter F is absentjPerforming the following steps; when e isi,jE.g. E' andwhen all the verification of (1) is successful, all edges in the returned query result are complete, wherein H (ID)i||IDj) Hash value, H (ID), representing identification information of node i linking identification information of node jj||IDi) Identification information representing node j links hash value of identification information of node i, FjAnd the cuckoo filter represents hash values of the identification information of the storage node j and the identification information of all the neighbor nodes.
7. The cuckoo-filter-based multi-attribute outsourcing data query validation method of claim 6, wherein the cuckoo-filter-based intersection validation comprises:
when the query condition is R1∩R2When the query is completed, the node set meeting all the query conditions is verified to be V ═ V1∩V2Is provided with I1,jFor attribute values v containing attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mAs attribute values containing attribute 2v2,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∩mWhether or not equal to F1,j∩F2,mWherein V ═ Vj∩m,Vj∩mRepresenting attribute values v in query results1,jAnd v2,mThe intersection of (a); will Vj∩m、F1,jAnd F2,mInputting the data into an intersection verification algorithm based on the cuckoo filters to judge a set Vj∩mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∩mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∩mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∪mFingerprint information of the element(s), judgment F1,jAnd F2,mWhether or not there is a common element in (1), when F1,jAnd F2,mWhen common elements exist in the algorithm, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mIf no common element exists in the algorithm, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
8. The cuckoo-filter-based multi-attribute outsourcing data query validation method of claim 7, wherein the cuckoo-filter-based union validation comprises:
when the query condition is R1∪R2When all the query conditions are satisfied, verification is performedThe node set is V ═ V1∪V2Is provided with I1,jFor attribute values v containing attribute 11,jAll the nodes are collected, then the node is collected into a set V1By passingDenotes x1≤j≤y1(ii) a Let I2,mFor attribute values v containing attribute 22,mAll the nodes are collected, then the node is collected into a set V2By passingDenotes x2≤m≤y2Is shown by1,jIs equivalent to F1,jIs shown as follows2,mIs equivalent to F2,mIndicates whether the set of nodes V' that will satisfy all the query conditions is equal to V1∩V2Is converted into a judgment of each Vj∪mWhether or not equal to F1,j∪F2,mWill Vj∪m、F1,jAnd F2,mInputting the data into a set verification algorithm based on union between cuckoo filters, and judging a set Vj∪mWhether or not the fingerprint information of each element e in (e) appears in (F)1,jAnd F2,mWhen set Vj∪mThe fingerprint information of each element e in F does not appear1,jAnd F2,mWhen the node is in the middle, returning an output result error, ending the algorithm, and returning that the node in the result is incomplete; when set Vj∪mThe fingerprint information of each element e in F1,jAnd F2,mIn the middle, from F1,jAnd F2,mDeletion-in-existence set Vj∪mFingerprint information of the element(s); judgment of F1,jAnd F2,mWhether or not it is empty, when F1,jAnd F2,mWhen the result is not empty, returning an output result error, ending the algorithm, and returning that the nodes in the result are incomplete; when F is present1,jAnd F2,mWhen the result is empty, the returned output result is correct, the algorithm is ended, and the nodes in the returned result are complete.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110541468.1A CN113239260B (en) | 2021-05-18 | 2021-05-18 | Multi-attribute outsourcing data query and verification method based on cuckoo filter |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110541468.1A CN113239260B (en) | 2021-05-18 | 2021-05-18 | Multi-attribute outsourcing data query and verification method based on cuckoo filter |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113239260A true CN113239260A (en) | 2021-08-10 |
CN113239260B CN113239260B (en) | 2022-04-29 |
Family
ID=77135172
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110541468.1A Active CN113239260B (en) | 2021-05-18 | 2021-05-18 | Multi-attribute outsourcing data query and verification method based on cuckoo filter |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113239260B (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110321117A1 (en) * | 2010-06-23 | 2011-12-29 | Itt Manufacturing Enterprises, Inc. | Policy Creation Using Dynamic Access Controls |
CN105959117A (en) * | 2016-07-19 | 2016-09-21 | 安徽大学 | Cuckoo filter-based vehicle-mounted ad hoc network security authentication method |
CN108733710A (en) * | 2017-04-21 | 2018-11-02 | 北京京东尚科信息技术有限公司 | Method, apparatus, electronic equipment and the readable medium of outsourcing data query verification |
CN110971393A (en) * | 2019-11-29 | 2020-04-07 | 中南大学 | Keyword query verification method and device based on block chain dynamic social outsourcing data |
-
2021
- 2021-05-18 CN CN202110541468.1A patent/CN113239260B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110321117A1 (en) * | 2010-06-23 | 2011-12-29 | Itt Manufacturing Enterprises, Inc. | Policy Creation Using Dynamic Access Controls |
CN105959117A (en) * | 2016-07-19 | 2016-09-21 | 安徽大学 | Cuckoo filter-based vehicle-mounted ad hoc network security authentication method |
CN108733710A (en) * | 2017-04-21 | 2018-11-02 | 北京京东尚科信息技术有限公司 | Method, apparatus, electronic equipment and the readable medium of outsourcing data query verification |
CN110971393A (en) * | 2019-11-29 | 2020-04-07 | 中南大学 | Keyword query verification method and device based on block chain dynamic social outsourcing data |
Non-Patent Citations (1)
Title |
---|
田有亮等: "基于改进Merkle-Tree认证方法的可验证多关键词搜索方案", 《通信学报》 * |
Also Published As
Publication number | Publication date |
---|---|
CN113239260B (en) | 2022-04-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109104413B (en) | Method for solving intersection of private data for secure multi-party computation and verification method | |
CN112395640A (en) | Industry Internet of things data lightweight credible sharing technology based on block chain | |
CN109766389B (en) | Block chain light client verification query method based on bitmap index | |
Zhang et al. | Secure top-k query processing via untrusted location-based service providers | |
CN107451281B (en) | Outsourcing database SQL query integrity verification system and method based on ADS | |
KR20180089479A (en) | User data sharing method and device | |
CN114020737A (en) | Efficient and reliable indexing method for block chain data | |
CN111861750A (en) | Feature derivation system based on decision tree method and readable storage medium | |
CN113239260B (en) | Multi-attribute outsourcing data query and verification method based on cuckoo filter | |
CN111177481A (en) | User identifier mapping method and device | |
CN111832079B (en) | Block chain-based query result integrity verification method in EPC global network | |
CN110647553B (en) | Block chain-based power transaction contract management method and system | |
CN117194418A (en) | Verifiable multi-mode space-time data index structure and space-time range query verification method | |
CN104166719B (en) | Matching process based on extensive two-way similar interconnection technique | |
KR101593674B1 (en) | Verifiable data management method and system | |
CN114840681A (en) | Atlas query verification method based on block chain | |
CN109800235B (en) | Outsourcing database full-operation query verification system and method based on authentication tree | |
CN113626657A (en) | Method for discovering densely connected sub-networks by multi-value attribute graph structure | |
Dong et al. | Arm: Authenticated approximate record matching for outsourced databases | |
CN113239255A (en) | Heterogeneous data resource sharing method and device, computer equipment and medium | |
CN112308694A (en) | Method and device for discovering cheating group | |
CN105912574B (en) | A kind of Spatial data query verification method that multi-user determines | |
CN115426117B (en) | Multisource aggregation query verification method | |
Jung et al. | PageRank revisited: On the relationship between node degrees and node significances in different applications | |
CN114756603B (en) | High-efficiency verifiable query method for lightweight block chain |
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 |