Author : Dasari Madhavi 1
Date of Publication :18th January 2018
Abstract: In view of extending omnipresence of dispersed registering, a consistently expanding number of data proprietors are energized to outsource their data to cloud servers for uncommon solace and reduced cost in data organization. Regardless, fragile data should be encoded before outsourcing for security [1] necessities, which obsoletes data utilization like watchword based record recuperation. In this paper, I present an ensured multi-catchphrase situated look scheme over mixed cloud data, which at same time reinforces dynamic revive operations like cancelation and incorporation of reports. Specifically, vector space appear and for most part used TF_IDF show are participated in document advancement and request age. I assemble an exceptional tree-based record structure and propose an "Unquenchable Depth-first Search" count to give gainful multi-watchword situated look. The ensured kNN computation is utilized to scramble the document and question vectors, and meanwhile ensure correct substance attain figuring between encoded record and request vectors. Remembering ultimate objective to restrict quantifiable strikes, apparition terms are added to rundown vector for blinding inquiry things. In view of usage of our outstanding tree-based rundown structure, the proposed plan can achieve sub-straight request time and deal with cancelation and incorporation of proceedings of adaptably. Expansive tests are coordinated to demonstrate the efficiency of proposed plot
Reference :
-
- Wang et al., C.Wang, Q. K. Ren, ―Security challenges for public cloud,‖ IEEE Internet Computing, vol. 16, no. 1, pp. 69–73, 2012.
- K. Lauter, & S. Kamara ―Cryptographic cloud storage,‖ in Financial Cryptography and Data Security. Springer, 2010, pp. 136–149.
- Mr C. Gentry, ―A fully homomorphic encryption scheme,‖ Ph.D. dissertation, Stanford University, 2009.
- R. Ostrovsky & O. Goldreich, ―Software protection and simulation on oblivious rams,‖ Journal of ACM (JACM), vol. 43, no. 3, pp. 431–473, 1996
- R. Ostrovsky G. Di Crescenzo, , and G. Persiano, D. Boneh, ―Public key encryption with keyword search,‖ in Advances in Cryptology-Eurocrypt 2004. Springer, 2004, pp. 506–522.
- R. Ostrovsky, E. Kushilevitz, and W. E. Skeith III, D. Boneh, ―Public key encryption that allows pir queries,‖ in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.
- A. Perrig, D. Wagner, and D. X. Song ―Practical techniques for searches on encrypted data,‖ in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000, pp. 44–55.