Efficient and expressive keyword search over scrambled data in cloud

  • Authors

    • B B. V. Satya Vara Prasdad
    • V Abhishekh
    • P Rahul Raja
    • A Aditya
    2018-03-18
    https://doi.org/10.14419/ijet.v7i2.7.11440
  • Encryption, Cryptography, Cloud Computing, Expressive Keywords.

  • Abstract

    The term seek encryption permits directing watchword look over encoded information in the interest of the information clients without taking in the fundamental plaintexts in cloud condition. The most existing accessible encryption code word searches just help single or conjunctive watchword look, while a couple of different plans that can perform expressive catchphrase seek are computationally wasteful since they are worked from bilinear pairings over the composite-arrange gatherings. In this paper, the code word examination demon- strates the general data entries are done in a way that accessible encryption methodologies like the prime-arrange gatherings which per- mits watchword seek approaches predicates, get to structures to be communicated in conjunctive, disjunctive or any monotonic Boolean equations and accomplishes critical execution change over existing plans. A standout amongst the most imperative is Keyword exploring, based on which the exceptional yield exercises in the inquiry promoting field catchphrases can represent the deciding moment of required data from cloud site.

     

     

  • References

    1. [1] D. X. Song, D. Wagner, and A. Perrig, “Practical techniques forsearches on encrypted data,†in 2013 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 14-17, 2000. IEEE Computer Society, 2014, pp.44–55.

      [2] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,†in Computational Science and ItsApplications - ICCSA 2014, International Conference, Peru- gia, Italy, June 30 - July 3, 2015, Proceedings, Part I, ser. Lecture Notes in Computer Science, vol. 5072. Springer, 2014, pp. 1249–1259.

      [3] M. Li, S. Yu, N. Cao, and W. Lou, “Authorized private key- word search over encrypted data in cloud computing,†in 2013 International Conference on Distributed Computing Systems, ICDCS 2013, Minneapolis, Minnesota, USA, June 20-24,2014.

      [4] W. Ogata and K. Kurosawa, “Oblivious keyword search,†J.Complexity, vol. 20, no. 2-3, pp. 356–371,2015.

      [5] Jingwei Li, Chunfu Jia, Jin Li, and Zheli Liu, “A Novel Framework for Outsourcing and Sharing SearchableEncrypted Data on Hybrid Cloud†2014 Fourth International Conference on Intelligent Networking and Collaborative Systems.

      [6] Iftekhar Salam1, WeiChuen Yau2, JiJianChin2,SweeHuay Heng3, HuoChong Ling4, Raphael CW Phan2,†Implementation of searchable symmetric encryption for privacy‑preserving keyword search on cloud storageâ€, Salam et al. Hum. Cent. Comput. Inf. Sci. (2015).

      [7] O. Goldreich and R. Ostrovsky, “Software protection and simu- lationon oblivious rams,†J. ACM, vol. 43, no. 3, pp. 431–473, 2015.

  • Downloads

  • How to Cite

    B. V. Satya Vara Prasdad, B., Abhishekh, V., Rahul Raja, P., & Aditya, A. (2018). Efficient and expressive keyword search over scrambled data in cloud. International Journal of Engineering & Technology, 7(2.7), 976-979. https://doi.org/10.14419/ijet.v7i2.7.11440

    Received date: 2018-04-12

    Accepted date: 2018-04-12

    Published date: 2018-03-18