STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 16th international conference on World Wide Web
Minimality attack in privacy preserving data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Towards identity anonymization on graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Resisting structural re-identification in anonymized social networks
Proceedings of the VLDB Endowment
Anonymizing bipartite graph data using safe groupings
Proceedings of the VLDB Endowment
Preserving Privacy in Social Networks Against Neighborhood Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Secure outsourced aggregation via one-way chains
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Accurate Estimation of the Degree Distribution of Private Networks
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Class-based graph anonymization for social network data
Proceedings of the VLDB Endowment
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
k-automorphism: a general framework for privacy preserving network publication
Proceedings of the VLDB Endowment
Optimizing linear counting queries under differential privacy
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
K-isomorphism: privacy preserving network publication against structural attacks
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
With the advent of cloud computing, it becomes desirable to outsource graphs into cloud servers to efficiently perform complex operations without compromising their sensitive information. In this paper, we take the shortest distance computation as a case to investigate the technique issues in outsourcing graph operations. We first propose a parameter-free, edge-based 2-HOP delegation security model (shorten as 2-HOP delegation model), which can greatly reduce the chances of the structural pattern attack and the graph reconstruction attack. We then transform the original graph into a link graph $$G_l$$ kept locally and a set of outsourced graphs $$\mathcal G _o$$ . Our objectives include (i) ensuring each outsourced graph meeting the requirement of 2-HOP delegation model, (ii) making shortest distance queries be answered using $$G_l$$ and $$\mathcal G _o$$ , (iii) minimizing the space cost of $$G_l$$ . We devise a greedy method to produce $$G_l$$ and $$\mathcal G _o$$ , which can exactly answer shortest distance queries. We also develop an efficient transformation method to support approximate shortest distance answering under a given average additive error bound. The experimental results illustrate the effectiveness and efficiency of our method.