Barpeti Susmitha, D. Venkateshwarlu


Here, the mechanical device examinees Cloud Secure input hastily since the purchaser types in put out a feeler question watchword. Many whole shebangs were advocated inside a type of kinds of thunder to succeed in a variety of functionalities for look for archetype simple secret sign scour, multi-key appraised hunt for, etc. We put an innocent and secure explore approach that is depending on the wood surpassing encrypted distract clue, and it cope with multi-magic formula quest within addition to changing system on kind of cites. Due to very important system of forest-primarily based indicant, forecasted scrutinize practice intention effectually get sub-straight list investigate it slow and handle the entire means of cut within addition to interpolation of details. The forecasted project manipulates on the part of bring multi-abracadabra doubt within addition to decisive ensue ranking, you will also vigorous amend beyond catalog collections. For acquiring of serious probe potency, we acquire a shrub-primarily based clue pile and come up with an equation in response to the ratio wood. Even if this idea is unquestionably reach-me-down for RDBMS primarily based organizations, this is a new tip-access ensample for Encrypted Cloud Domains consumed by shopper erode discussing activities. Of the above-mentioned whole shebang, multi-secret sign procedure of evaluated examine has gotten too many values attributable to its sane applicability.


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


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.

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.

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.

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.

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.

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.

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