A Dynamic Scheme for Secure Searches over Distributed Massive Datasets in Cloud Environment using Searchable Symmetric Encryption Technique

A Dynamic Scheme for Secure Searches over Distributed Massive Datasets in Cloud Environment using Searchable Symmetric Encryption Technique

Cloud computing has produced a paradigm shift in large-scale data outsourcing and computing. As the cloud server itself cannot be trusted, it is essential to store the data in encrypted form, which however makes it unsuitable to perform searching, computation or analysis on the data. Searchable Symmetric Encryption SSE allows the user to perform keyword search over encrypted data without leaking information to the storage provider. Most of the existing SSE schemes have restrictions on the size and the number of index files, to facilitate efficient search. In this paper, we propose a dynamic SSE scheme that can operate on relatively larger, multiple index files, distributed across several nodes, without the need to explicitly merge them. The experiments have been carried out on the encrypted data stored in Amazon EMR cluster. The secure searchable inverted index is created instantly using Hadoop MapReduce framework during the search process, thus significantly eliminate the need to store document-keyword pairs on the server. The scheme allows dynamic update of existing index and document collection. The parallel execution of the pre-processing phase of the present research work enables to reduce processing time at the client. An implementation of our construction has been provided in this paper. Experimental results to validate the efficacy of our scheme is reported.

___

  • Z. Zheng, J. Zhu, M. R. Lyu, "Service-generated Big data and Big data-as-a-service: An overview", In Proceedings of IEEE International Congress on Big Data, pp. DOI=10.1109/BigData.Congress.2013.60. June -2 July 2013.
  • D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searching on encrypted data. In proceedings of IEEE Symposium on Security and Privacy”, SP’00, pages 44–55, 14 -17 May 2000. DOI= 10.1109/SECPRI.2000.848445
  • E. J. Goh, “Secure Indexes”, Cryptology ePrint Archive, Report2003/216, 2003. http://eprint.iacr.org/2003/216.pdf
  • O. Goldreich and R. Ostrovsky. “Software Protection and Simulation on Oblivious RAMs”, Journal of the ACM (JACM), Vol. 43, No. 3, pp. 431–473, 1996. DOI=10.1145/233551.233553
  • C. Gentry, “Fully homomorphic encryption using ideal lattices”, In Proceedings of the ACM symposium on Theory of computing (STOC ’09), pp.169-178, ACM, 31 May – 02 June, 2009. DOI=10.1145/1536414.1536440
  • S. Kamara, K. Lauter, “Cryptographic cloud storage”, In Financial Cryptography and Data Security, FC2010”, Vol. 6054 of LNCS, Springer-Verlag, pp. 136–149, 2010. DOI = 10.1007/978-3-642-14992-4_13
  • R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions”, In Proceedings of the 2006 ACM Conference on Computer and Communications Security, CCS’06, pp. 79–88, 30 October – 03 November, 2006. https://eprint.iacr.org/2006/210.pdf
  • C. Bösch, P. Hartel, W. Jonker, A. Peter, “A survey of provably Computing Survey (CSUR), Vol. 47, No. 2, pp. 1–18, 2015. DOI=10.1145/2636328 encryption”, ACM
  • S. Kamara, C. Papamanthou, and T. Roeder, “Dynamic searchable symmetric encryption”, In Proceedings of the ACM Conference on Computer and Communications Security, CCS’12, pp.965–976, 16 – 18 October, 2012. DOI=10.1145/2382196.2382298
  • S. Kamara and C. Papamanthou, “Parallel and dynamic searchable symmetric encryption”, In Financial Cryptography and Data Security, Vol. 7859 of LNCS, pp. 258–274, 2013. www.ifca.ai/pub/fc13/78590253.pdf
  • E. Stefanov, C. Papamanthou, and E. Shi, “Practical dynamic searchable encryption with small leakage”, In proceedings of Network and Distributed System Security Symposium,NDSS’14,2014. https://eprint.iacr.org/2013/832.pdf
  • F. Hahn, F. Kerschbaum, “Searchable Encryption with Secure and Efficient Updates”, In Proceedings of the ACM Communications Security, CCS’14, pp. 310-320, 03 – 07 November, 2014. DOI=10.1145/2660267.2660297 and
  • M. Naveed, M. Prabhakaran, and C. Gunter, “Dynamic searchable encryption via blind storage”, In Proceedings of the IEEE Symposium on Security and Privacy, S&P, 18 – 21 May 2014. DOI=10.1109/SP.2014.47
  • X. Jiang, X. Ge, J. Yu, F. Kong, X. Cheng and R. Hao, “An Efficient Symmetric Searchable Encryption Scheme for Cloud Storage”, Journal of Internet Services and Information Security (JISIS), Vol. 7, No. 2, pp. 1-18, May 2017. https://pdfs.semanticscholar.org/2a0e/df98524c92931478 cd3fbc32afb6caa7a57d.pdf
  • R. Miyoshi, H. Yamamoto, H. Fujiwara, and T. Miyazaki, “Practical and Secure Searchable Symmetric Encryption with a Small Index”, In Secure IT Systems, NordSec 2017, Vol. 10674 of LNCS, Springer, pp. 53-69, November 2017. DOI=10.1007/978-3-319-70290-2_4
  • H. Li, Y. Yang, Y. Dai, S. Yu, and Y. Xiang, “Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data”, IEEE Transactions on Cloud Computing, November 2017. DOI = 10.1109/TCC.2017.2769645
  • J. Yang, S. Li, X. Yan, B. Zhang, and B. Cui “Searchable Symmetric Encryption Based on the Inner Product for Cloud Storage”, International Journal of Web and Grid Services, Vol. 14, No. 1, pp.70–87, January 2018. DOI=https://doi.org/10.1504/IJWGS.2018.088393
  • N. P. Smart, Future Directions in Computing on Technical http://www.ecrypt.eu.org/csa/documents/D2.2Computing onEncryptedData.pdf, November 2015.
  • M. I. Salam, W. Yau, J. Chin, S. Heng, H. Ling, R. Phan, G. S. Poh, S. Tan and W. Yap, “Implementation of searchable symmetric encryption for privacy-preserving keyword search on cloud storage”, Journal of Human- centric Computing and Information Sciences, Vol. 5, No. 19, 2015. DOI = 10.1186/s13673-015-0039-9
  • D. Cash, J. Jaeger, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, “Dynamic searchable encryption in very large databases: Data structures and implementation”, In Proceedings of Network and Distributed System Security Symposium NDSS’14. 2014. https://eprint.iacr.org/2014/853.pdf
  • C. Liu, L. Zhu, and J. Chen, “Efficient Searchable Symmetric Encryption for Storing Multiple Source Data on Cloud”, In Proceedings of the IEEE Conference Trustcom/BigDataSE/ISPA, 20 – 22 August 2015. DOI=10.1109/Trustcom.2015.406
  • T. Hirano, M. Hattori,Y. Kawai, N. Matsuda, M. Iwamoto, K. Ohta, Y. Sakai, T. Munaka, “Simple, secure, and efficient searchable symmetric encryption with multiple encrypted indexes”, Advances in Information and Computer Security, IWSEC 2016, Vol. 9836 of LNCS, pp. 91–110. Springer, Cham, 12-14, September 2016. DOI = 10.1007/978-3-319-44524-3_6
  • M. Kuzu, M.S. Islam, and M. Kantarcioglu, “, In proceedings of the 5th ACM Conference on Data and Application Security and Privacy, CODASPY '15, pp. 271-278,02–04 DOI=10.1145/2699026.2699116 March 2015.
  • Y. Ishai, E. Kushilevitz, S. Lu, and R. Ostrovsky, “Private Large-Scale Databases with Distributed Searchable Symmetric Encryption”, Topics in Cryptology - CT-RSA 2016, Vol. 9610 of LNCS, Springer, 10.1007/978-3-319-29485-8_6 February 2016. DOI =
  • M. Mohamad, J. Chin, and G. Poh, “On the Security Advantages of Block-Based Multiserver Searchable Symmetric Encryption” , In the proceedings of IEEE 14th Annual Conference on Privacy, Security and Trust (PST), pp. DOI = 10.1109/PST.2016.7906985 12-14 December 2016.
  • G.S. Poh, M.S. Mohamad, & J.J Chin, “Searchable symmetric Cryptography and Communications, Volume 10, Issue 1, pp.139–158,January2018. https://doi.org/10.1007/s12095-017-0232-y servers”,
  • F. Han, J. Qin, J. Hu, “Secure searches in the cloud: A survey”, Future Generation Computer Systems, Vol. 62, pp.66-75, https://doi.org/10.1016/j.future.2016.01.007 September 2016.
  • M. Horvath and I. Vajda, "Searchable Symmetric Encryption Communications Software and Systems, Vol.14, No. 1, pp.104-111, DOI = https://doi.org/10.24138/jcomss.v14i1.419 of March 2018.