Skip to main content
Log in

Multi-server searchable data crypt: searchable data encryption scheme for secure distributed cloud storage

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

This paper introduces a multi-server searchable symmetric encryption (SSE) scheme called the Multi-Server Searchable Data Crypt “MS-SDC” that works on achieving a trade-off between efficiency/functionality and security. The proposed scheme has the merits of dividing the uploaded file in an encrypted form into blocks and distributing them across several storage providers, which is more acceptable than uploading the whole file directly to a single server where each server only holds a subset of file/block, to ensure more security for the file. Besides that, it extracts keywords for each uploaded file to be used later by the search engine giving the user the ability to browse across his own files. This means that the user has the ability to query/search for his encrypted files on the server-side without decrypting them. Furthermore, there are various features proposed different from those presented by previous works as the scheme is developed as a multithreaded-application to speed up the uploading time, and a unique master key is generated randomly for each uploaded file unlike the previous techniques where a single master key is created randomly for all the uploaded documents leading to easily hacking the system with master key leakage. Finally, the MS-SDC system is distinctive in its smooth usage and its robustness where it can run on any browser and can be applied to any file type. The experimental results demonstrate the effectiveness of our proposed system in comparison to previous works in terms of uploading and searching time, in addition to providing many new features, applying many layers of security, and keeping high-speed performance in an efficient manner. The proposed system has reduced the file upload time up to 64% of the current research upload time via multithreading implementation of the block distribution function.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Bost R, Fouque PA (2019) Security-efficiency tradeoffs in searchable encryption. Proc Int Conf Priv Enhanc Technol 2019(4):132–151

    Google Scholar 

  • Bösch C, Hartel P, Jonker W, Peter A (2014) A survey of provably secure searchable encryption. ACM Comput Surv (CSUR) 47(2):1–51

    Article  Google Scholar 

  • Cao N, Wang C, Li M, Ren K, Lou W (2013) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222–233

    Article  Google Scholar 

  • Cash D, Jaeger J, Jarecki S, Jutla CS, Krawczyk H, Rosu MC, Steiner M (2014) Dynamic searchable encryption in very-large databases: data structures and implementation. NDSS 14:23–26

    Google Scholar 

  • Cash D, Grubbs P, Perry J, Ristenpart T (2015) Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC conference on Computer and Communications Security, pp. 668–679

  • Cash D, Jarecki S, Jutla C, Krawczyk H, Roşu MC, Steiner M (2013) Highly-scalable searchable symmetric encryption with support for boolean queries. In: Proceedings of the international Annual Cryptology, Springer, Berlin, Heidelberg, pp. 353–373

  • Chang YC, Mitzenmacher M (2005) Privacy preserving keyword searches on remote encrypted data. In: Proceedings of the international conference on Applied Cryptography and Network Security, Springer, Berlin, Heidelberg, pp. 442–455

  • Chase M, Kamara S (2010) Structured encryption and controlled disclosure. In: Proceedings of the international conference on the Theory and Application of Cryptology and Information Security, Springer, Berlin, Heidelberg, pp. 577–594

  • Curtmola R, Garay J, Kamara S, Ostrovsky R (2011) Searchable symmetric encryption: improved definitions and efficient constructions. J Comput Secur 19(5):895–934

    Article  Google Scholar 

  • Faber S, Jarecki S, Krawczyk H, Nguyen Q, Rosu M, Steiner M (2015) Rich queries on encrypted data: Beyond exact matches. In: Proceedings of the international European symposium on Research in Computer Security, Springer, Cham, pp. 123–145

  • Goh EJ (2003) Secure indexes. IACR J Cryptol ePrint Arch 2003:216

    Google Scholar 

  • Golle P, Staddon J, Waters B (2004) Secure conjunctive keyword search over encrypted data. In: Proceedings of the international conference on Applied Cryptography and Network Security, Springer, Berlin, Heidelberg, pp. 31–45

  • Hahn F, Kerschbaum F (2014) Searchable encryption with secure and efficient updates. In: Proceedings of the ACM international conference on Conference on Computer and Communications Security, pp. 310–320

  • Hoang T, Yavuz AA, Durak FB, Guajardo J (2019) A multi-server oblivious dynamic searchable encryption framework. Journal of Computer Security 27(6):649–676

    Article  Google Scholar 

  • Hoang T, Yavuz AA, Durak FB, Guajardo J (2018) Oblivious dynamic searchable encryption on distributed cloud systems. In: Proceedings of the FIP annual conference on Data and Applications Security and Privacy, Springer, Cham, pp. 113–130

  • Ishai Y, Kushilevitz E, Lu S, Ostrovsky R (2016) Private large-scale databases with distributed searchable symmetric encryption. In: Proceedings of the Cryptographers’ Track at the RSA conference, Springer, Cham, pp. 90–107

  • Kamara S, Papamanthou C, Roeder T (2012) Dynamic searchable symmetric encryption. In: Proceedings of the ACM international conference on Computer and Communications Security, pp. 965–976

  • Kim IT, Quan TH, Duc LV, Nguyen TK, Hwang SO (2018) An efficient searchable encryption scheme in the multi-user environment. In: Proceedings of the international conference on Green and Human Information Technology, Springer, Singapore, pp. 188–192

  • Knopf C (2007) Cryptographic Hash Functions. Leibniz Universität Hannover

  • Kuzu M, Islam MS, Kantarcioglu M (2012) Efficient similarity search over encrypted data. In: Proceedings of the IEEE 28th international conference on Data Engineering, pp. 1156–1167

  • Lipmaa H, Wagner D, Rogaway P (2000) Comments to NIST concerning AES modes of operation: CTR-mode encryption.

  • Meharwade A, Patil GA (2016) Efficient keyword search over encrypted cloud data. Procedia Comput Sci 78(3):139–144

    Article  Google Scholar 

  • Mohamad MS, Tan SY, Chin JJ (2019) Searchable symmetric encryption security definitions. Malays J Math Sci 13:31–47

    MathSciNet  MATH  Google Scholar 

  • Naveed M, Prabhakaran M, Gunter CA (2014) Dynamic searchable encryption via blind storage. In: Proceedings of the IEEE international symposium on Security and Privacy, pp. 639–654

  • Peter A, Leenders B, Lim HW, Tang Q, Wang H, Hartel P, Jonker W (2014) Distributed searchable symmetric encryption. In: Proceedings of the international conference on Privacy, Security and Trust

  • Poh GS, Baskaran VM, Chin JJ, Mohamad MS, Lee KW, Maniam D, Z’aba MR (2017) Searchable data vault: encrypted queries in secure distributed cloud storage. Algorithms 10(2):52

    Article  Google Scholar 

  • Poh GS, Mohamad MS, Chin JJ (2018) Searchable symmetric encryption over multiple servers. Cryptogr Commun 10(1):139–158

    Article  MathSciNet  Google Scholar 

  • Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceedings of the IEEE international symposium on Security and Privacy, pp. 44–55

  • Stefanov E, Papamanthou C, Shi E (2014) Practical dynamic searchable encryption with small leakage. In: Proceedings of the international symposium on 21st Annual Network and Distributed System Security – NDSS, The Internet Society, 71:72–75

  • Stefanov E, Van Dijk M, Shi E, Fletcher C, Ren L, Yu X, Devadas S (2013) Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of the ACM international conference on Computer and Communications Security, pp. 299–310

  • Van Liesdonk P, Sedghi S, Doumen J, Hartel P, Jonker W (2010) Computationally efficient searchable symmetric encryption. In: Proceedings of the international workshop on Secure Data Management, Springer, Berlin, Heidelberg, pp. 87–100

  • Wang Y, Wang J, Chen X (2016) Secure searchable encryption: a survey. J Commun Inf Netw 1(4):52–65

    Article  Google Scholar 

  • Wang C, Cao N, Li J, Ren K, Lou W (2010) Secure ranked keyword search over encrypted cloud data. In: Proceedings of the IEEE 30th international conference on Distributed Computing Systems, pp. 253–262.

  • Wright CV, Pouliot D (2017) Early detection and analysis of leakage abuse vulnerabilities. IACR J Cryptol ePrint Arch 2017:1052

    Google Scholar 

  • Wu CF, Ti YW, Kuo SY, Yu CM (2019) Benchmarking dynamic searchable symmetric encryption with search pattern hiding. In: Proceedings of the international conference on Intelligent Computing and its Emerging Applications, pp. 65–69

  • Zhang Y, Katz J, Papamanthou C (2016) All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: Proceedings of the 25th {USENIX} Security Symposium, pp. 707–720

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toka Shahien.

Additional information

Publisher's Note

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

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary file1 (PDF 204 KB)

Supplementary file2 (PDF 202 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shahien, T., Sarhan, A.M. & Alshewimy, M.A.M. Multi-server searchable data crypt: searchable data encryption scheme for secure distributed cloud storage. J Ambient Intell Human Comput 12, 8663–8681 (2021). https://doi.org/10.1007/s12652-020-02621-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-02621-8

Keywords