A NOVEL PROPOSAL FOR MAINTENANCE OF DYNAMIC FUNCTIONS ON CLOUD DATA

E.Rama Krishna, G. Lakpathi

Abstract


Many works were suggested in a variety of types of threat to achieve various benefits for search for example single keyword search, multi-keyword rated search, and so forth.  Of these works, multi-keyword manner of rated search has gotten more importance because of its realistic usefulness.  We submit a safe and secure search method which is dependant on the tree above encoded cloud information, also it manages multi-keyword search in addition to dynamic process on assortment of documents.  For acquiring of high search effectiveness, we develop a tree-based index structure and propose an formula based on the index tree. The forecasted plan is recognized as to provide multi-keyword query in addition to precise result ranking, additionally dynamic update above document collections. Due to important structure of tree-based index, forecasted search system will effectively get sub-straight line search some time and manage the entire process of deletion in addition to insertion of documents.


Keywords


Multi-Keyword Ranked Search; Tree-Based Index; Sub-Linear Search; Encrypted Cloud Data; Documents; Result Ranking

References


. Y.-C. Chang and M. Mitzenmacher, “Privacy preserving keyword searches on remote encrypted data,” in Proceedings of the Third international conference on Applied Cryptography and Network Security. Springer-Verlag, 2005, pp. 442–455.

. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proceedings of the 13th ACM conference on Computer and communications security. ACM, 2006, pp. 79–88.

. J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in INFOCOM, 2010 Proceedings IEEE. IEEE, 2010, pp. 1–5.

. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Proceedings of the 4th conference on Theory of cryptography. Springer-Verlag, 2007, pp. 535–554.

. B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267, 2011.

. J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Advances in Cryptology–EUROCRYPT 2008. Springer, 2008, pp. 146–162.


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.