Skip to main content
SpringerLink
Log in

Outsourcing shortest distance computing with privacy protection

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. http://lpsolve.sourceforge.net/5.5/.

  2. http://dblp.uni-trier.de/xml/.

  3. http://snap.stanford.edu/data/p2p-Gnutella08.html.

  4. http://www.dis.uniroma1.it/~challenge9/data/.

  5. http://www.cs.ucr.edu/~ddreier/barabasi.html.

References

  1. Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: WWW, pp. 181–190 (2007)

  2. Cheng, J., Fu, A.W., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: SIGMOD, pp. 459–470 (2010)

  3. Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946 (2002)

  5. Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. PVLDB 1(1), 833–844 (2008)

    Google Scholar 

  6. Cormode, G., Srivastava, D., Bhagat, S., Krishnamurthy, B.: Class-based graph anonymization for social network data. PVLDB 2(1), 766–777 (2009)

    Google Scholar 

  7. Das, S., Egecioglu, M., Abbadi, A.E.: Anonymizing weighted social network graphs. In: ICDE, pp. 904–907 (2010)

  8. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    Google Scholar 

  9. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: TCC (2006)

  10. Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB 3(1), 264–275 (2010)

    Google Scholar 

  11. Gao, J., Yu, J.X., Jin, R., Zhou, J., Wang, T., Yang, D.: Neighborhood-privacy protected shortest distance computing in cloud. In: SIGMOD, pp. 409–420 (2011)

  12. Goldberg, A.V., Harrelson, C.: Computing the shortest path: search meets graph theory. In: SODA, pp. 156–165 (2005)

  13. Hacigümüs, H., Iyer, B.R., Mehrotra, S.: Providing database as a service. In: ICDE, pp. 29–40 (2002)

  14. Hay, M., Li, C., Miklau, G., Jensen, D.: Accurate estimation of the degree distribution of private networks. In: ICDM, pp. 169–178 (2009)

  15. Hay, M., Miklau, G., Jensen, D., Towsley, D.F., Weis, P.: Resisting structural re-identification in anonymized social networks. PVLDB 1(1), 102–114 (2008)

    Google Scholar 

  16. Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. TKDE 14(5), 1029–1046 (2002)

    Google Scholar 

  17. Kleinberg, J.M., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. J. ACM (JACM) 56(6), 1–37 (2009)

    Google Scholar 

  18. Li, C., Hay, M., Rastogi, V., Miklau, G., McGrego, A.: Optimizing linear counting queries under differential privacy. In: PODS, pp. 123–134 (2010)

  19. Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD, pp. 93–106 (2008)

  20. Nath, S., Yu, H., Chan, H.: Secure outsourced aggregation via one-way chain. In: SIGMOD, pp. 31–44 (2009)

  21. Potamias, M., Bonchi, F., Castillo, C.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867–876 (2009)

  22. Thorup, M., Zwick, U.: Approximate distance oracles. In: STOC, pp. 183–192 (2001)

  23. Wong, R., Fu, A., Wang, K., Pei, J.: Minimality attack in privacy preserving data publishing. In: VLDB, pp. 543–554 (2007)

  24. Ying, X., Wu, X.: Randomizing social networks: a spectrum preserving approach. In: SDM, pp. 739–750 (2008)

  25. Yiu, M.L., Lin, Y., Mouratidis, K.: Efficient verification of shortest path search via authenticated hints. In: ICDE, pp. 237–248 (2010)

  26. Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE, pp. 506–515 (2008)

  27. Zou, L., Chen, L., TamerÖzsu, M.: Distancejoin: pattern match query in a large graph database. PVLDB 2(1), 886–897 (2009)

    Google Scholar 

  28. Zou, L., Chen, L., TamerÖzsu, M.: K-automorphism: a general framework for privacy preserving network publication. PVLDB 2(1), 946–957 (2009)

    Google Scholar 

Download references

Acknowledgments

NSFC supported Gao via 61073018 and 61272156. The research grants Council of the Hong Kong SAR supported Yu via 418512 and 419109. National High Technology Research and Development Program of China supported Wang via 2012AA011002.

Author information

Authors and Affiliations

  1. Key Laboratory of High Confidence Software Technologies, EECS, Peking University, Beijing, China

    Jun Gao, Jiashuai Zhou, Tengjiao Wang & Dongqing Yang

  2. Department of Systems Engineering and Engineering Management, Chinese University of Hong Kong, Shatin, Hong Kong

    Jeffrey Xu Yu

  3. Department of Computer Science, Kent University, Kent, OH, USA

    Ruoming Jin

Authors
  1. Jun Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey Xu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ruoming Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiashuai Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tengjiao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Dongqing Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun Gao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, J., Yu, J.X., Jin, R. et al. Outsourcing shortest distance computing with privacy protection. The VLDB Journal 22, 543–559 (2013). https://doi.org/10.1007/s00778-012-0304-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-012-0304-8

Keywords

Search

Navigation