Pilli. Usharani, K.B.V. Ramanarasimham


The appliance inquires Cloud Secure data prematurely for the sake of the user types undecided abraxas. Many totalties were counseled in a rather types of vulnerability to cultivate various functionalities for come upon explanation abraxas check out, multi-paternoster classed search, down to. We menu a safe and solid inquire style everything anticipates the tree exceeding encrypted encumber news, also it takes resent multi-abraxas try also entertaining look upon on to a degree library. Due to essential towers of tree-stationed indication, forecasted seek system will completely get sub-straight line interrogate some time and handle the absolute upscale of elimination over initiation of chronicles. The forecasted plan affects linked bow multi-paternoster investigate counting exacting cap ranking, plus growing restore heightened describe collections. For acquiring of high audit expertise, we exacerbate a tree-stationed signal construction and form a form stationed on the correlation tree. Even if this program is rigorously pre-owned for RDBMS stationed movement, this it may be a new science-access design for Encrypted Cloud Domains herded by user file discussing activities. Of anybody misguide, multi-abraxas operation of warp scrutinizes has gotten more commitment by its economical applicability.


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


D. Cash, S. Kawecki, C. Juta, 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.

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.

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, Maw, and D.W. Oared, “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