An efficient method to transform the original graph into the outsourced graph
(3) An approach to rewrite the query and combine the results
Client Side Original Graph Graph Transformation Link graph Results Result Combination Cloud Server Outsourced Graph Query Evaluation Query Rewriting Query (2) (1) (3)
Protect the neighborhood information and the close relationship between nodes.
Privacy protection
Find empty meaningful results for any query pattern
( 1-neighborhood ): for any node pair u and v ∈ Vo, (u, v) ∉ E ( d-radius ): for any node pair u and v ∈ Vo, δ G (u, v) >= d. Original graph Attacker’s query 2-radius graph
Given a graph G = (V,E) and d, the graph transformation produces outsourced graphs G o = {G 1, ...G j } , and a local link graph G l, which achieves the following objectives:
Security
Each outsourced graph is a 1-neighborhood-d-radius graph;
Utility
The union of G o and G l can answer the shortest distance in the original graph;
Local computational cost
The space cost of G l and the cost of the shortest distance computation on the client side are minimized.
Be the first to comment