S. Komali, M. Karuna


Within this report, a ranked clustering routine is recommended to aid more explore exposition also to provide the earnings in fast count text probe interior a big data aura. Additionally, we appraise looking readiness and freedom lower two rampant peril models. One denounces enterprising that the tie during cites will be regularly secluded bit file encryption, whatever can appear in consequential ransack exactness appearance deterioration. Also, the matched of data in data centers has bedeviled a sudden prosperity. This ready much grimmer to devise count text explore schemes so yield valuable and decent online IR on copious of encrypted data. A preliminary policy enjoys levy the ransack readiness, fidelity, and rank care. The measure appear proves the implied composition not just nicely solves the multi-secret sign weighted inspect headache, brings an obvious discord inspecting readiness, rank confidence, and the importance enclosed by retrieved archives. Within the explore step, this structure can reach a in the direction of computational intricacy in contrast to a mounting size heighten of chronicle lot. Because of the scarce rank system, users need to take a long-winded time for you to choose what they need when towering archives maintain the doubt abraxas. Thus, order-preserving skills work at to reach the rank procedure, to manage find out the truthfulness of ransack engine rises, a formation common as dab hash sub-tree perform not beyond this study. In supplement, the counseled scheme comes with an edge on the measure purpose not outside the rank retreat and applicability of retrieved chronicles.


Rank Security; Multi-Keyword Search; Hierarchical Clustering; Cipher Text; Rank Privacy;


I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd ed. San Francisco, CA, USA: Morgan Kaufmann, 1999.

C. M. Ralph, “Protocols for public key cryptosystems,” in Proc. IEEE Sump. Security Privy, Oakland, CA, 1980, pp. 122–122.

M. Bellare, A. Boldyreva, and A. O’Neill, “Deterministic and efficiently searchable encryption,” in Proc. 27th Annu. Int. Cryptol. Conf. Adv. Cryptol., Santa Barbara, CA, 2007, pp. 535–552.

C. Wang, N. Cao, J. Li, K. Ren, and W. J. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proc. IEEE 30th Int. Conf. Distrib. Comput. Syst., Genova, ITALY, 2010, pp. 253–262.

D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu, and M. Steiner, “Highly-scalable searchable symmetric encryption with support for Boolean que-ries,” in Proc. Adv. Cryptol,. Berlin, Heidelberg, 2013, pp. 353–373.

W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li, “Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” in Proc. 8th ACM SIGSAC Symp. Inform., Comput. Commun. Security, Hangzhou, China, 2013, pp. 71–82.

Chi Chen, Member, IEEE, Xiaojie Zhu, Student Member, IEEE, Peisong Shen, Student Member, IEEE,Jiankun Hu, Member, IEEE, Song Guo, Senior Member,IEEE, Zahir Tari, Senior Member, IEEE, andAlbert Y. Zomaya, Fellow, IEEE, “An Efficient Privacy-Preserving RankedKeyword Search Method”, ieee transactions on parallel and distributed systems, vol. 27, no. 4, april 2016.

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