RESISTING STATISTICAL HITS IN OPEN NETS

Sama Nagarjun Reddy, B. M.G.Prasad

Abstract


Many works were suggested in several types of threat to achieve various benefits for search for example single keyword search, multi-keyword rated search, and so forth.  Of individuals works, multi-keyword kinds of rated search is becoming more importance because of its realistic effectiveness.  We submit a great search method which pulls round the tree above encoded cloud information, and additionally it manages multi-keyword search additionally to dynamic process on selection of documents.  For acquiring of high search effectiveness, we produce a tree-based index structure and propose an formula while using the index tree. The forecasted plan's referred to as to provide multi-keyword query additionally to specific result ranking, furthermore dynamic update above document collections. Due to important structure of tree-based index, forecasted search system will effectively get sub-straight line search a serious amounts of manage the operation of deletion additionally to insertion of documents.


Keywords


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

References


D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000, pp. 44– 55.

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.

D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Advances in Cryptology-Eurocrypt 2004. Springer, 2004, pp. 506–522.

D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that allows pir queries,” in Advances in Cryptology-CRYPTO 2007. Springer, 2007, pp. 50–67.


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.