Dr. Hemanta Kumar Bhuyan, Shazia Anjum


Here, the mechanical device comes Cloud Secure knowledge instantly since the customer types in knock secret sign. Many entireties were recommended within a form of styles of foreshadowing to succeed in quite a number functionality for look for exemplar separate access check, multi-abraxas measured explore, etc. We proffer a certain and secure seek design that's depending on the pulp over encrypted veil info, withal it handles multi-password scan within addition to influential alter on hodgepodge of cites. Due to vital complex of shrub-primarily based indication, forecasted scan process intention completely gets sub-straight order sift a while and cope with the entire progress of cancellation inside addition to introduction of catalogs. The forecasted procedure affects related serve multi-key impeach inside addition to scrupulous emanate ranking, you will powerful refurbish surpassing catalog collections. For acquiring of rich hunt for use, we evolve a pulp-primarily based ratio formation and offer a formulary in accordance with the indicant softwood. Even if this idea is unquestionably secondhand for RDBMS based mostly policy’s, this is a new report-access mirror for Encrypted Cloud Domains ambitious by purchaser scrape discussing activities. Of the above-mentioned entirety, multi-abracadabra kind of classed quest has gotten longer attention thanks to its authentic applicability.


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


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.

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.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.|

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