A study on searchable encryption schemes

  • Authors

    • Sunitha Buchade Bharati Vidyapeeth University
    • P.R. Devale Bharati Vidyapeeth University
    2018-04-25
    https://doi.org/10.14419/ijet.v7i2.10995
  • Cloud, Keyword Search, Query Expressiveness, Searchable Encryption, Wildcard Search.

  • Abstract

    To manage large volume of data, most of the organizations and data owners outsource their data to remote cloud storage servers. Since the remote servers are untrusted party, the data has to be encrypted to achieve security and privacy. But encryption and decryption causes communication overhead for many data utilization operations like searching and updating. To overcome this contradiction, searchable encryption notion was introduced. Searchable encryption (SE) is an ability of a server to search upon the ciphertext and retrieve the data without decrypting it. By searching on the ciphertext it protects the user’s tactful data. This article concentrates on study of various resil-ient keyword search schemes in area of Cloud SE. The main basis for SE evolution is attaining the challenging task of efficient enci-phered data utilization with privacy check. Thus schemes are developed considering their search capability, efficiency and security. In this paper we summarize and analyze various available keyword searchable schemes based on query expressiveness and query correct-ness. We review articles which have extensively researched in the field of SE with various keyword search schemes.

  • References

    1. [1] Song D X, Wagner D, Perrig A, Practical techniques for searches on encrypted data, 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, 2000, 44-55.

      [2] Goh E J, Secure Indexes, IACR cryptology eprint archive, 2003, 216.

      [3] Golle P, Staddon J, Waters B. Secure conjunctive keyword search over encrypted data. The 2nd International Conference on Applied Cryptography and Network Security, Yellow Mountain, China, 2004, 31-45. https://doi.org/10.1007/978-3-540-24852-1_3.

      [4] Ballard L, Kamara s, Monrose F. Achieving efficient conjunctive keyword searches over encrypted data. The 7th International Conference on Information and Communications Security, Beijing, China, 2005, 414-426.

      [5] Faber S, Jarecki S, Krawczyk H, et al. Rich queries on encrypted data: beyond exact matches. The 20th European Symposium on Research in Computer Security, Vienna, Austria, 2015, 123-145. https://doi.org/10.1007/978-3-319-24177-7_7.

      [6] Li J, Wang Q, Wang C, et al. Fuzzy keyword search over encrypted data in cloud computing. The 29th IEEE International Conference on Computer, San Diego, USA, 2010, 441-445. https://doi.org/10.1109/INFCOM.2010.5462196.

      [7] Kuzu M, Islam M S, Kantarcioglu M. Efficient similarity search over encrypted data. The28th IEEE International Conference on Data Engineering, Washington, USA, 2012, 1156-1167. https://doi.org/10.1109/ICDE.2012.23.

      [8] Zheng Q, Xu S, Ateniese G. VABKS: verifiable attribute-based keyword search over outsourced encrypted data. IEEE Conference on Computer Communications, Toronto, Canada, 2014, 522-530. https://doi.org/10.1109/INFOCOM.2014.6847976.

      [9] Liu P, Wang J, Ma H, et al. Efficient verifiable public key encryption with keyword search based on KP-ABE. The 9th International Conference on Broadband and Wireless Computing Communication and Applications (BWCCA), Guangdong, China, 2014, 584-589. https://doi.org/10.1109/BWCCA.2014.119.

      [10] Cao N, Wang C, Li M, et al. Privacy preserving multi-keyword ranked search over encrypted cloud data. The 30th International Conference on Computer Communications, Shanghai, China, 2011, 829-837. https://doi.org/10.1109/INFCOM.2011.5935306.

      [11] Sun W, Wang B, Cao N, et al. Verifiable privacy-preserving multi-keyword text search in cloud supporting similarity based ranking. IEEE transactions on Parallel and Distributed Systems, 2014, Vol. 25, 3025-3035. https://doi.org/10.1109/TPDS.2013.282.

      [12] Xia Z, Wang X, Sun X, et al. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE transctions on parallel and distributed systems, 2016, Vol. 27, 340-352.

      [13] Chen C, Zhu X, Shen P, et al. An efficient privacy-preserving ranked keyword search method. IEEE Transactions on Parallel and Distributed Systems, 2016, Vol. 27, 951-963. https://doi.org/10.1109/TPDS.2015.2425407.

      [14] Suga T, Nishide T, Sakurai K. Secure keyword search using Bloom filter with specified character position. International Conference on Provable Security. Springer Berlin Heidelberg, 2012, 235-252. https://doi.org/10.1007/978-3-642-33272-2_15.

      [15] Hu C, Han L. Efficient wildcard search over encrypted data. International Journal of Information Security. 2015, 1-9.

      [16] Wang Y, Wang J, Chen X. Secure searchable encryption: a survey. Journal of Communications and Information Networks, 2016, Vol 1, 52-65. https://doi.org/10.1007/BF03391580.

      [17] Kale P V, Welekar R. A survey on different techniques for encrypted cloud data. International Conference on Intelligent Computing and Control System, 2017, 245-247. https://doi.org/10.1109/ICCONS.2017.8250718.

      [18] Li B, Jiang J. Search on encrypted data: state of arts. Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), IEEE, 2016, 2022-2031.

      [19] Zhang J, Semantic-based searchable encryption in cloud: issues and challenges. 2015 First International Conference on Computational Intelligence Theory, Systems and Applications, 2015, 163-165. https://doi.org/10.1109/CCITSA.2015.29.

      [20] Kamara S, Papamanthou C, Roeder T. Dynamic searchable symmetric encryption. Proceeding of ACM Conference on Computer and Communications Security (CCS), USA, 2012, 965-976. https://doi.org/10.1145/2382196.2382298.

      [21] Bosch C, Hartel P, Jonker W, et al. A survey of provably secure searchable encryption. ACM Computing Surveys, Vol 47, 2014, 1-51. https://doi.org/10.1145/2636328.

  • Downloads

  • How to Cite

    Buchade, S., & Devale, P. (2018). A study on searchable encryption schemes. International Journal of Engineering & Technology, 7(2), 617-620. https://doi.org/10.14419/ijet.v7i2.10995

    Received date: 2018-04-03

    Accepted date: 2018-04-09

    Published date: 2018-04-25