A SAFE AND ACTIVE HIERARCHICAL MULTI PLANTA PLAN SEARCH CLOUD DATA ENCRYPTION

Devinath Koppula, M. Samba Siva Rao

Abstract


Many works were recommended in various kinds of threat to attain various benefits for look for example single keyword search, multi-keyword rated search, and so on.  Of  people works, a multi-keyword type of rated search has become more importance due to its realistic effectiveness.  We submit an excellent search method which attracts around the tree above encoded cloud information, and in addition it manages multi-keyword search in addition to dynamic process on choice of documents.  For obtaining of high search effectiveness, we create a tree-based index structure and propose an formula while using index tree. The forecasted plan's known as to supply multi-keyword query in addition to particular result ranking, additionally dynamic update above document collections. Because of important structure of tree-based index, forecasted search system will effectively get sub-straight line search a serious amounts of manage the whole process of deletion in addition to insertion of documents.


Keywords


Multi-Keyword Ranked Search; Tree-Based Index; Sub-Linear Search;

References


D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Advances in Cryptology- Eurocrypt 2004. Springer, 2004, pp. 506–522.

D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that allows pir queries,” in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.

D. X. Song, D. Wagner, and A. Perrig, “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.

Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its extension to a multi-user system,” in Proceedings of the First international conference on Pairing-Based Cryptography. Springer-Verlag, 2007, pp. 2–22.

L. Ballard, S. Kamara, and F. Monrose, “Achieving efficient conjunctive keyword searches over encrypted data,” in Proceedings of the 7th international conference on Information and Communications Security. Springer-Verlag, 2005, pp. 414–426.

A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, “Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption,” in Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques. Springer-Verlag, 2010, pp. 62–91.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2018, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.