Skip to main content
SpringerLink
Log in

SGPM: a privacy protected approach of time-constrained graph pattern matching in cloud

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Graph pattern matching (GPM) is an important operation on graph computation. Most existing work assumes that query graph or data graph is static, which is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, time-constrained graph pattern matching has been introduced. However, querying time-constrained graph pattern in a temporal graph is not an easy work because of the high computation complexity. Query outsourcing, with the help of cloud computing, is adopted in this paper. Outsourcing of data storage and query becomes increasingly popular due to the prevalence of cloud computing. However, sensitive data need to be encrypted before outsourcing for various privacy concerns. To execute queries over encrypted data is a very challenging problem and has received much attention recently. However, most existing approaches only support limited kinds of queries, moreover, they cannot be completely outsourced. In this paper, a Somewhat Homomorphic Encryption (\(\mathcal {S}{\mathscr{H}}\mathcal {E}\)) approach is adopted to design a protocol which enables general queries on encrypted data and query outsourcing as well. The key issue in the paper is to (1) enable the query provider to filter data rows with homomorphic encrypted result of comparison operators; (2) completely relieve the data owner of partaking of the process of queries. An effective dualcloud protocol (DCP) which enables the cloud to understand the result of comparisons though homomorphic encrypted values is proposed. Moreover, The efficiency of the baseline approach is greatly improved by packing and GPU-accelerating technologies. Experimental study shows that the optimized approach outperforms the baseline approach and the recently reported similar approaches.

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

Figure 1
Figure 2
Figure 3
Figure 4

Similar content being viewed by others

Notes

  1. http://www.sociopatterns.org/datasets

  2. https://gtfsrt.api.translink.com.au

  3. https://snap.stanford.edu/data/cit-Patents.html

References

  1. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)

    Article  Google Scholar 

  2. Boldyreva, A., Chenette, N., Lee, Y., O’neill, A.: Order-preserving symmetric encryption. In: Advances in Cryptology-EUROCRYPT 2009, pp 224–241. Springer (2009)

  3. Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: Applied Cryptography and Network Security, pp 102–118. Springer (2013)

  4. Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Advances in Cryptology–CRYPTO 2011, pp 505–524. Springer (2011)

  5. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) lwe. SIAM J. Comput. 43(2), 831–871 (2014)

    Article  MathSciNet  Google Scholar 

  6. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp 309–325. ACM (2012)

  7. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, USA, June 3-6, 2002, pages 310–321 (2002)

  8. Bugiel, S., Nürnberger, S., Sadeghi, A.-R., Schneider, T.: Twin clouds: Secure cloud computing with low latency. In: Communications and Multimedia Security, pp 32–44. Springer (2011)

  9. Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Applied Cryptography and Network Security, pp 442–455. Springer (2005)

  10. Chen, L., Wang, C.: Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Trans. Knowl. Data Eng. 22(8), 1093–1109 (2010)

    Article  Google Scholar 

  11. Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.-Q., Gu, X.: Towards graph containment search and indexing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23-27, 2007, pp. 926–937 (2007)

  12. Chen, Y.-C., Peng, W.-C., Lee, S.-Y.: Mining temporal patterns in time interval-based data. IEEE Trans. Knowl. Data Eng. 27(12), 3318–3331 (2015)

    Article  Google Scholar 

  13. Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)

    Article  Google Scholar 

  14. Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Advances in Cryptology–CRYPTO 2011, pp 487–504. Springer (2011)

  15. Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Advances in Cryptology–EUROCRYPT 2012, pp 446–464. Springer (2012)

  16. Das, S., Narasayya, V.R., Li, F., Syamala, M.: Cpu sharing techniques for performance isolation in multi-tenant relational database-as-a-service. Proceedings of the VLDB Endowment 7(1), 37–48 (2013)

    Article  Google Scholar 

  17. ElGamal, T.: A Public key cryptosystem and a signature scheme based on discrete logarithms. In: Advances in Cryptology, pp 10–18. Springer (1984)

  18. Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: 2014 IEEE 30th International Conference On Data Engineering (ICDE), pp 664–675. IEEE (2014)

  19. Elmore, A. J, Das, S., Agrawal, D., Abbadi, A. E.: Zephyr: live migration in shared nothing databases for elastic cloud platforms. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp 301–312. ACM (2011)

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

    Google Scholar 

  21. Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510–1521 (2013)

    Google Scholar 

  22. Fan, W., Wang, X., Wu, Y.: Incremental graph pattern matching. ACM Trans. Database Syst. 38(3), 18:1–18:47 (2013)

    Article  MathSciNet  Google Scholar 

  23. Fan, W., Wang, X., Wu, Y., Deng, D.: Distributed graph simulation: Impossibility and possibility. PVLDB 7(12), 1083–1094 (2014)

    Google Scholar 

  24. Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)

  25. Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: STOC, vol. 9, pp 169–178 (2009)

  26. Gentry, C., Halevi, S.: Implementing Gentry’s fully-homomorphic encryption scheme. In: Advances in Cryptology–EUROCRYPT 2011, pp 129–148. Springer (2011)

  27. Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Advances in Cryptology–EUROCRYPT 2012, pp 465–482. Springer (2012)

  28. Goldreich, O.: Foundations of Cryptography: volume 2, Basic Applications. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

  29. Golle, P., Staddon, J., Waters, B.: Secure conjunctive keyword search over encrypted data. In: Applied Cryptography and Network Security, pp 31–45. Springer (2004)

  30. Hacigümüs, H., Iyer, B., Mehrotra, S.: Providing database as a service. In: 18th International Conference On Data Engineering, 2002. Proceedings, pp 29–38. IEEE (2002)

  31. Hacigümüş, H., Iyer, B., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database-service-provider model. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data, pp 216–227. ACM (2002)

  32. Hacıgümüş, H., Iyer, B., Mehrotra, S.: Secure computation on outsourced data: A 10-year retrospective. In: Database Systems for Advanced Applications, pp 16–27. Springer (2014)

  33. Han, W.-S., Lee, J., Lee, J.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2013, New York, NY, USA, June 22-27, 2013, pp. 337–348 (2013)

  34. Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer Science & Business Media, Berlin (2010)

    Book  Google Scholar 

  35. He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pages 405–418 (2008)

  36. Henzinger, M.R., Henzinger, T.A. , Kopke, P.W. : Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 453–462 (1995)

  37. Huang, S., Fu, A.W., Liu, R.: Minimum spanning trees in temporal graphs. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp 419–430x (2015)

  38. Khurana, U., Deshpande, A.: Storing and analyzing historical graph data at scale. In: Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016., pp. 65–76 (2016)

  39. Kossinets, G., Kleinberg, J.M., Watts, D.J.: The structure of information pathways in a social communication network. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp 435–443 (2008)

  40. Lee, J., Han, W.-S., Kasperovics, R., Lee, J.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133–144 (2012)

    Google Scholar 

  41. Liu, G., Wang, Y., Orgun, M.A.: Finding K optimal social trust paths for the selection of trustworthy service providers in complex social networks. In: IEEE International Conference on Web Services, ICWS 2011, Washington, DC, USA, July 4-9, 2011, pp. 41–48 (2011)

  42. Liu, G., Zhu, F., Zheng, K., Liu, A., Li, Z., Zhao, L., Zhou, X.: TOSI A trust-oriented social influence evaluation method in contextual social networks. Neurocomputing 210, 130–140 (2016)

    Article  Google Scholar 

  43. Liu, A., Li, Z., Liu, G., Zheng, K., Zhang, M., Li, Q., Zhang, X.: Privacy-preserving task assignment in spatial crowdsourcing. J. Comput. Sci Technol. 32(5), 905–918 (2017)

    Article  MathSciNet  Google Scholar 

  44. Liu, A., Wang, W., Shang, S., Li, Q., Zhang, X.: Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22 (2), 335–362 (2018)

    Article  Google Scholar 

  45. Liu, G., Yi, L., Zheng, K., Liu, A., Li, Z., Wang, Y., Zhou, X.: MCS-GPM: Multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans. Knowl. Data Eng. 30(6), 1050–1064 (2018)

    Article  Google Scholar 

  46. Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: Capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4:1-4:46 (2014)

    Article  MathSciNet  Google Scholar 

  47. Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical?. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp 113–124. ACM (2011)

  48. Ogura, N., Yamamoto, G., Kobayashi, T., Uchiyama, S.: An improvement of key generation algorithm for Gentry’s homomorphic encryption scheme. In: Advances in Information and Computer Security, pp 70–83. Springer (2010)

  49. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology-EUROCRYPT’99, pp 223–238. Springer (1999)

  50. Popa, R. A., Redfield, C., Zeldovich, N., Balakrishnan, H.: Cryptdb: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp 85–100. ACM (2011)

  51. Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of secure computation 4(11), 169–180 (1978)

    MathSciNet  Google Scholar 

  52. Scholl, P., Smart, N.P.: Improved key generation for gentry’s fully homomorphic encryption scheme. In: Cryptography and coding, pp 10–22. Springer (2011)

  53. Shamir, R., Tsur, D.: Faster isomorphism. J. Algorithms 33(2), 267–280 (1999)

    Article  MathSciNet  Google Scholar 

  54. Shang, H., Zhang, Y., Lin, X., Yu, J. X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364–375 (2008)

    Google Scholar 

  55. Song, D. X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 EEE Symposium on security and privacy, 2000. S&P 2000 Proceedings. pp. 44–55. IEEE (2000)

  56. Song, C., Ge, T., Chen, C.X., Wang, J.: Event pattern matching over graph streams. PVLDB 8(4), 413–424 (2014)

    Google Scholar 

  57. Soror, A.A., Minhas, U.F., Aboulnaga, A., Salem, K., Kokosielis, P., Kamath, S.: Automatic virtual machine configuration for database workloads. ACM Transactions on Database Systems (TODS) 35(1), 7 (2010)

    Article  Google Scholar 

  58. Tian, Y., McEachin, R.C., Santos, C., States, D.J., Patel, J.M.: SAGA: A subgraph matching tool for biological graphs. Bioinformatics 23(2), 232–239 (2007)

    Article  Google Scholar 

  59. Tu, S., Frans Kaashoek, M, Madden, S., Zeldovich, N.: Processing analytical queries over encrypted data. In: Proceedings of the VLDB Endowment, pp 289–300. VLDB Endowment (2013)

  60. Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology–EUROCRYPT 2010, pp 24–43. Springer (2010)

  61. Wong, P., He, Z., Lo, E.: Parallel analytics as a service. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 25–36. ACM (2013)

  62. Wong, W.K., Kao, B., Cheung, D.W.L., Li, R., Yiu, S.M.: Secure query processing with data interoperability in a cloud database environment. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 1395–1406. ACM (2014)

  63. Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. PVLDB 7(9), 721–732 (2014)

    Google Scholar 

  64. Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, pp 145–156 (2016)

  65. Xiao, M., Ma, K., Liu, A., Zhao, H., Li, Z., Zheng, K., Zhou, X.: Sra: Secure reverse auction for task assignment in spatial crowdsourcing. IEEE Trans. Knowl. Data Eng., pp. 1–1 (2019)

  66. Xu, Y., Huang, J., An, L., Li, Z., Yin, H., Zhao, L.: Time-constrained graph pattern matching in a large temporal graph. Web and Big Data - First International Joint Conference, APWeb-WAIM 2017, Beijing, China, July 7-9, 2017, Proceedings, Part I, pp. 100–115 (2017)

  67. Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, 1982. SFCS’08, pp 160–164. IEEE (1982)

  68. Yi, Y., Da, Y., Wu, H., Cheng, J., Zhou, S., Lui, J.C.S.: Diversified temporal subgraph pattern mining. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pp 1965–1974 (2016)

  69. Yuan, D., Mitra, P., Yu, H., Lee Giles, C.: Iterative graph feature mining for graph indexing. In: IEEE 28Th International Conference on Data Engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1-5 April, 2012, pp. 198–209 (2012)

  70. Yuan, D., Mitra, P., Yu, H., Lee Giles, C.: Updating graph indices with a one-pass algorithm. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 1903–1916 (2015)

  71. Zhai, D., Sun, Y., Liu, A., Li, Z., Liu, G., Zhao, L., Zheng, K.: Towards secure and truthful task assignment in spatial crowdsourcing. World Wide Web 22(5), 2017–2040 (2019)

    Article  Google Scholar 

  72. Zhao, P., Han, J.: On graph query optimization in large networks. PVLDB 3 (1), 340–351 (2010)

    Google Scholar 

  73. Zhu, J., Jiang, W., Liu, A., Liu, G., Zhao, L.: Effective and efficient trajectory outlier detection based on time-dependent popular route. World Wide Web 20(1), 111–134 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant No. 61572335, 61572336, 61902270), and the Major Program of the Natural Science Foundation of Jiangsu Higher Education Institutions of China (Grant No. 19KJA610002), and the Natural Science Foundation of Jiangsu Higher Education Institutions of China (Grant No. 19KJB520052, 19KJB520050), and Collaborative Innovation Center of Novel Software Technology and Industrialization, Jiangsu, China.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Soochow University, Soochow, China

    Jinjing Huang, Wei Chen, Zhixu Li, Pengpeng Zhao & Lei Zhao

  2. School of Software and Service Outsourcing, Suzhou Vocational Institute of Industrial Technology, Suzhou, China

    Jinjing Huang

  3. Faculty of Information Technology, Monash University, Monash, Australia

    Weiqing Wang

  4. School of Information Technology and Electrical Engineering, The University of Queensland, Queensland, Australia

    Hongzhi Yin

Authors
  1. Jinjing Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhixu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pengpeng Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Weiqing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Hongzhi Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Lei Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lei Zhao.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article belongs to the Topical Collection: Special Issue on Trust, Privacy, and Security in Crowdsourcing Computing

Guest Editors: An Liu, Guanfeng Liu, Mehmet A. Orgun, and Qing Li

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, J., Chen, W., Li, Z. et al. SGPM: a privacy protected approach of time-constrained graph pattern matching in cloud. World Wide Web 23, 519–547 (2020). https://doi.org/10.1007/s11280-020-00784-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-020-00784-0

Keywords

Search

Navigation