Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data
G.Lucy, D.Jaya Narayana Reddy, R.Sandeep Kumar, ,
Affiliations Pursuing M.Tech, CSE Branch, Dept of CSEAssistant Professor, Department of Computer Science and Engineering</br>Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Utilizing Cloud Computing, people can store their information on remote servers and permit information
access to open clients through the cloud servers. As the outsourced information are liable to contain touchy protection data,
they are regularly scrambled before transferred to the cloud. This, on the other hand, altogether restrains the ease of use of
outsourced information because of the trouble of seeking over the encoded information. In this paper, we address this issue
by building up the fine-grained multi-watchword hunt plans over scrambled cloud information. Our unique commitments are
three-fold. To begin with, we present the significance scores and inclination elements upon watchwords which empower the
exact catchphrase seek and customized client experience. Second, we build up a handy and exceptionally effective multicatchphrase inquiry plan. The proposed plan can backing entangled rationale seek the blended "AND", "OR" and "NO"
operations of catchphrases. Third, we further utilize the ordered sub-lexicons procedure to accomplish better proficiency on
list building, trapdoor producing and question. Finally, we examine the security of the proposed plans as far as secrecy of
reports, security assurance of file and trapdoor, and unlinkability of trapdoor. Through broad investigations utilizing this
present reality dataset, we approve the execution of the proposed plans. Both the security examination and test results
show that the proposed plans can accomplish the same security level contrasting with the current ones and better execution
as far as usefulness, question multifaceted nature and effectiveness.
G.Lucy,D.Jaya Narayana Reddy,R.Sandeep Kumar."Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.919-923, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1220.pdf,
 H. Liang, L. X. Cai, D. Huang, X. Shen, and D. Peng, â€œAn smdp-based service model for interdomain resource allocation in mobile cloud networks,â€ IEEE Transactions on Vehicular Technology, vol. 61, no. 5, pp. 2222â€“2232, 2012.
 M. M. Mahmoud and X. Shen, â€œA cloud-based scheme for protecting source-location privacy against hotspot-locating attack in wireless sensor networks,â€ IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 10, pp. 1805â€“1818, 2012.
 Q. Shen, X. Liang, X. Shen, X. Lin, and H. Luo, â€œExploiting geo-distributed clouds for e-health monitoring system with minimum service delay and privacy preservation,â€ IEEE Journal of Biomedical and Health Informatics, vol. 18, no. 2, pp. 430â€“439, 2014.
 T. Jung, X. Mao, X. Li, S.-J. Tang, W. Gong, and L. Zhang, â€œPrivacy-preserving data aggregation without secure channel: multivariate poly-nomial evaluation,â€ in Proceedings of INFOCOM. IEEE, 2013, pp. 2634â€“2642.
 Y. Yang, H. Li, W. Liu, H. Yang, and M. Wen, â€œSecure dynamic searchable symmetric encryption with constant document update cost,â€ in Proceedings of GLOBCOM. IEEE, 2014, to appear.
 N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, â€œPrivacy-preserving multi-keyword ranked search over encrypted cloud data,â€ IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 222â€“233, 2014.
 https://support.google.com/websearch/answer/173 733?hl=en.
 D. X. Song, D. Wagner, and A. Perrig, â€œPractical techniques for searches on encrypted data,â€ in Proceedings of S&P. IEEE, 2000, pp. 44â€“55.
 R. Li, Z. Xu, W. Kang, K. C. Yow, and C.-Z. Xu, â€œEfficient multi-keyword ranked query over encrypted data in cloud computing,â€ Future Generation Computer Systems, vol. 30, pp. 179â€“ 190, 2014.
 H. Li, D. Liu, Y. Dai, T. H. Luan, and X. Shen, â€œEnabling efficient multi-keyword ranked search over encrypted cloud data through blind storage,â€ IEEE Transactions on Emerging Topics in Computing, 2014, DOI10.1109/TETC.2014.2371239.
 C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, â€œSecure ranked keyword search over encrypted cloud data,â€ in Proceedings of ICDCS. IEEE, 2010, pp. 253â€“262.
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
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
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.