P. Abhilasha, Dr.G.V. Padma Raju


Due to the expanding prominence of distributed computing, increasingly information proprietors are inspired to outsource their information to cloud servers for awesome accommodation and lessened cost in information administration. We submit a safe and secure search method which is dependent on the tree above encrypted cloud information, also it manages multi-keyword search in addition to dynamic process on assortment of documents.  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.  Even if this concept is certainly not new for RDBMS based systems, this can be a new information-access paradigm for Encrypted Cloud Domains driven by user file discussing activities. Here, the machine searches Cloud Secure data quickly because the user types in query keywords. Many works were suggested in a variety of types of threat to achieve various functionalities 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 applicability.  The forecasted plan is recognized as to provide multi-keyword query in addition to precise result ranking, additionally dynamic update above document collections. For acquiring of high search effectiveness, we develop a tree-based index structure and propose a formula based on the index tree.


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


W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, “Secure knn computation on encrypted databases,” in Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. ACM, 2009, pp. 139–152.

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.

A. Swaminathan, Y. Mao, G.-M. Su, H. Gou, A. L. Varna, S. He, M.Wu, and D.W. Oard, “Confidentiality-preserving rank-ordered search,” in Proceedings of the 2007 ACM workshop on Storage security and survivability. ACM, 2007, pp. 7–12.

C. Orencik, M. Kantarcioglu, and E. Savas, “A practical and secure multi-keyword search method over encrypted cloud data,” in Cloud Computing (CLOUD), 2013 IEEE Sixth International Conference on. IEEE, 2013, pp. 390–397.

D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Ros¸u, and M. Steiner, “Highly-scalable searchable symmetric encryption with support for boolean queries,” in Advances in Cryptology–CRYPTO 2013. Springer, 2013, pp. 353–373.

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.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, 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.