Swathi Boorgula, P. V.Sarath Chand


Many works were recommended in a number of kinds of threat to attain various functionalities for look for example single keyword search, multi-keyword rated search, and so on.  Of those works, multi-keyword types of rated search has become more importance due to its realistic applicability.  We submit a good search method which is founded on the tree above encrypted cloud information, plus it manages multi-keyword search additionally to dynamic process on range of documents.  For obtaining of high search effectiveness, we create a tree-based index structure and propose an formula in line with the index tree. The forecasted plan is known as to supply multi-keyword query additionally to specific result ranking, furthermore dynamic update above document collections. Because of important structure of tree-based index, forecasted search system will effectively get sub-straight line search some time to manage the whole process of deletion additionally to insertion of documents.


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


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.

M. Kuzu, M. S. Islam, and M. Kantarcioglu, “Efficient similarity search over encrypted data,” in Data Engineering (ICDE), 2012 IEEE 28th International Conference on. IEEE, 2012, pp. 1156–1167.

P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Applied Cryptography and Network Security. Springer, 2004, pp. 31–45.

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.

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.