Searching Encrypted Data on the Cloud

  • Khaled A. Al-Utaibi
  • El-Sayed M. El-AlfyEmail author


As cloud computing is becoming popular, more and more users continue to shift to cloud services for massive data storage rather than building private data centers. However, to protect data confidentiality on untrusted external servers and at the same time allow search and information retrieval, it is necessary to store the data in searchable encrypted form. This represents a challenging problem for which considerable effort has been made, and several approaches have been proposed in the literature. The basic idea of these techniques is to encrypt the data in a way that allows an untrusted server to perform a keyword search using a trapdoor without revealing any information about the keyword(s) or the content of the encrypted data. In this chapter, we introduce the problem and review the basic concepts and current knowledge about searchable encryption. We also discuss various application scenarios and basic primitives and techniques for exact and approximate search over encrypted data on the cloud.



The authors would like to thank both King Fahd University of Petroleum and Minerals and Hail University for the support during this work.


  1. 1.
    Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. ACM Communications, 13, 422–426.CrossRefzbMATHGoogle Scholar
  2. 2.
    Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004). Public key encryption with keyword search. In EUROCRYPT 2004. Lecture notes in computer science (Vol. 3027, pp. 506–522).Google Scholar
  3. 3.
    Boneh, D., & Waters, B. (2007). Conjunctive, subset, and range queries on encrypted data. In Theory of Cryptography Conference (pp. 535–554).Google Scholar
  4. 4.
    Bösch, C., Hartel, P., Jonker, W., & Peter, A. (2014). A survey of provably secure searchable encryption. ACM Computing Surveys, 47(2), 18:1–18:51.Google Scholar
  5. 5.
    Bringer, J., Chabanne, H., & Kindarji, B. (2009). Error-tolerant searchable encryption. In Proceedings of IEEE International Conference on Communications (ICC’09) (pp. 768–773).Google Scholar
  6. 6.
    Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006). Searchable symmetric encryption: Improved definitions and efficient constructions. In Proceedings of 13th ACM Conference on Computer and Communications Security, CCS ’06 (pp. 79–88).Google Scholar
  7. 7.
    Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011). Searchable symmetric encryption: Improved definitions and efficient constructions. Journal of Computer Security, 19(5), 895–934.CrossRefGoogle Scholar
  8. 8.
    Fredman, M. L., Komlós, J., & Szemerédi, E. (1984). Storing a sparse table with 0(1) worst case access time. Journal of the ACM, 31(3), 538–544.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Goh, E. J. (2003). Secure indexes. Cryptology ePrint Archive, Report 2003/216.Google Scholar
  10. 10.
    Golle, P., Staddon, J., & Waters, B. (2004) Secure conjunctive keyword search over encrypted data. In Applied cryptography and network security. Lecture notes in computer science (Vol. 3089, pp. 31–45). Berlin: Springer.Google Scholar
  11. 11.
    Han, F., Qin, J., & Hu, J. (2016). Secure searches in the cloud: A survey. Future Generation Computer Systems, 62, 66–75.CrossRefGoogle Scholar
  12. 12.
    Li, J., Wang, Q., Wang, C., Cao, N., Ren, K., & Lou, W. (2010). Fuzzy keyword search over encrypted data in cloud computing. In Proceedings of 29th Conference on Information Communications (INFOCOM’10) (pp. 441–445).Google Scholar
  13. 13.
    Park, D. J., Kim, K., & Lee, P. J. (2004). Public key encryption with conjunctive field keyword search. In International Workshop on Information Security Applications (pp. 73–86).Google Scholar
  14. 14.
    Song, D., Wanger, D., & Perrig, A. (2000). Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy (pp. 44–55).Google Scholar
  15. 15.
    Xiao, S., Ge, A., Zhang, J., Ma, C., & Wang, X. (2016). Asymmetric searchable encryption from inner product encryption. In International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (pp. 123–132).Google Scholar
  16. 16.
    Zhang, B., & Zhang, F. (2011). An efficient public key encryption with conjunctive-subset keywords search. Journal of Network and Computer Applications, 34(1), 262–267.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.College of Computer Sciences and EngineeringUniversity of HailHailSaudi Arabia
  2. 2.Information and Computer Science Department, College of Computer Sciences and EngineeringKing Fahd University of Petroleum and MineralsDhahranSaudi Arabia

Personalised recommendations