Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Hierarchical Clustering Over Rank Keyword Search with Secure and Competent Outlook

Ms. Shumaila Tajreen, Dr. G.S.S Rao, , ,
Nawab ShahAlam khan College of Engineering and Technology, Hyd
:10.22362/ijcert/2017/v4/i10/xxxx [UNDER PROCESS]

As the volume of data in the data center is experiencing a tremendous growth, so vendor of data prefers to outsource sensitive and important documents for the purpose of privacy conserving. The documents are stored in encrypted format so it is essential to develop efficient search cipher text technique. In the process of encryption relationship between document is concealed which leads to perform deterioration. In this paper, a quality hierarchical clustering (QHC) method is proposed to support searching mechanism and to meet fast searching within cloud environment. In this paper multi-keyword ranked search, hierarchical clustering index (MRSE-HCI) architecture is used. For search result verification, least hash subtree is used. The proposed method has several advantages over traditional method in document’s retrieval and rank privacy.

Ms. Shumaila Tajreen and Dr. G.S.S Rao (2017). Hierarchical Clustering Over Rank Keyword Search with Secure and Competent Outlook . International Journal of Computer Engineering In Research Trends, 4(10), 388-391. Retrieved from

Keywords : Cloud Computing, Hierarchical Clustering, Security, Ciphertext search, multi keyword search, ranked search.

[1].  Dynamic Multi-Keyword Ranked Searchable Security Algorithm Using CRSA and B-Tree Prasanna B T#1, C B Akki*2 #Department of ISE, EPCET Associate Professor, Bengaluru, INDIA-560049 *Department of ISE, SJBIT Professor, Bengaluru, INDIA-560060 
[2].  Reusability of Search Index over Encrypted Cloud Data on Dynamic update Kavitha R1, R J Poovaraghan2 Student, M.Tech, SRM University, Chennai, India1 Assistant Professor (OG), Department of Computer Science, SRM University, Chennai, India2.
[3]. Dynamic Multi-keyword Top-k Ranked Search over Encrypted Cloud Data Xingming Sun, Xinhui Wang, Zhihua Xia, Zhangjie Fu and Tao Li Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science & Technology, Nanjing, 210044.
[4]. R. Ostrovsky, D. Boneh, G. Di Crescenzo, and G. Persiano, “Public key encryption with keyword search,” in Advances in Cryptology-Eurocrypt 2004, 2004, pp. 506–522.
[5]. R. Curtmola, J. Garay, S. Kamara and R. Ostrovsky “Searchable symmetric encryption: Improved definitions and efficient construc-tions”Proc. 13th ACM Conf. Comput. Commun. Secur., pp. 79-88, 2006.
[6]. G. Craig “Fully homomorphic encryption using ideal lattices”Proc. 41st Annu. ACM Symp. Theory Comput., vol. 9, pp. 169-178, 2009.
[7]. H. Pang, J. Shen and R. Krishnan ‘Privacy-preserving similarity-based text retrieval’ , ACM Trans. Internet Technol., vol. 10, no. 1, p. 39, Feb., 2010. 
[8]. Q.Wang et al, K. Ren, C.Wang, “Security challenges for the public cloud,” IEEE Internet Computing, 2012, vol. 16, no. 1, pp. 69–73.
[9]. S. Kamara, C. Papamanthou and T. Roeder “Dynamic searchable symmetric encryption”Proc. Conf. Comput. Commun. Secur., pp. 965-976, 2012.
[10]. S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu and M. Steiner “Outsourced symmetric private information retrieval”Proc. ACM SIGSAC Conf. Comput. Commun. Secur., pp. 875-888, Nov., 2013.
[11]. D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu and M. Steiner “Highly-scalable searchable symmetric encryption with support for Boolean que-ries”Proc. Adv. Cryptol,., pp. 353-373, 2013.
[12].  K. Ren, C. Wang, N. Cao, and W. Lou, “Enabling secure and efficient ranked keyword search over outsourced cloud data,” Parallel and Distributed Systems, IEEE Transactions on, 2012, vol. 23, no. 8, pp. 1467–1479.
[13]. S. Jarecki, D. Cash, J.Jaeger, C. Jutla, M. C. Rosu, and M.  Steiner, “Dynamic searchable encryption in very large databases: Data structures and implementation”, vol. 14, 2014,
[14]. R. X. Li, Z. Y. Xu, W. S. Kang, K. C. Yow and C. Z. Xu “Efficient Multi-keyword ranked query over encrypted data in cloud computing”Futur. Gener. Comp. Syst., vol. 30, pp. 179-190, Jan., 2014.
[15]. Chi Chen, Xiaojie Zhu, Peisong Shen “An Efficient Privacy-Preserving Ranked Keyword Search Method”, IEEE Transactions on Parallel and Distributed Systems, Vol. 27, No. 4, April 2016.  
[16] A.Raghavendra Praveen Kumar, K.Tarakesh, and U.Veeresh  ,” A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted.” International Journal of Computer Engineering in Research Trends., vol.2, no.12, pp. 1137-1141, 2015.
[17] Mr. Rahul Hon, and Mrs. N.Sujatha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 314-320, 2016.
[18] Kallem Rajender Reddy, and Y.Sunitha,” A Novel Framework to Measure the Degree of Difficulty on Keyword Query Routing.” International Journal of Computer Engineering in Research Trends., vol.2, no.9, pp. 640-645, 2015.
[19] Vadla Jhansi Rani, and K.Samson Paul,” Secure Multi Keyword Dynamic Search Scheme Supporting Dynamic Update..” International Journal of Computer Engineering in Research Trends., vol.4, no.8, pp. 356-360, 2017.
[20] Mr. M. Veerabrahma Chary  and Mrs.N.Sujatha,” A Novel Additive Multi-Keyword Search for Multiple Data Owners in Cloud Computing.” International Journal of Computer Engineering in Research Trends., vol.3, no.6, pp. 308-313, 2016.

DOI Link : Not yet assigned

Download :

Refbacks : Currently there are no refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal