A RELIABLE AND PROGRESSIVE MULTI-KEY ORDERED EXPLORATION BLUEPRINT ON CIPHER TEXT IN THE CLOUD

K.V.V.B. Durgaprasad, M. Janaki Ramudu, Mahanti Sriramulu

Abstract


Here, the vehicle explores Cloud Secure data instantly for the sake of the user types in doubt magic formula. Many entireties were recommended in a category of types of menace to gain discrete functionalities for track case unmarried abraxas ransack, multi-paternoster graded probe, thus. We propose a safe and secure explore structure and that be determined by the tree raised encrypted distort instruction, also it take overs multi-magic formula explore as well changing deal with on jumble of details. Due to essential formation of tree-situated pointer, forecasted inspect arrangement will productively get sub-straight line ransack some time and guide the entire movement of expunging too interjection of archives. The forecasted plan prompt concerning yield multi-abraxas interrogate as well correct come from ranking, and changing modernize over form collections. For acquiring of high probe power, we promote a tree-stationed indicator edifice and ask an equation occupying on the symptom tree. Even if this notion is assuredly worn for RDBMS situated arrangements, this perchance a new message-access original for Encrypted Cloud Domains impelled by user file discussing activities. Of the above-mentioned all, multi-secret sign habit of appraised ransack has gotten more concern in as much as of its prudent applicability.


Keywords


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

References


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

Refbacks

  • There are currently no refbacks.


Bookmark and Share


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.