Paper Title
TOWARDS ACHIEVING KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA WITH SYMMETRIC-KEY BASED VERIFICATION
Article Identifiers
: Authors
Keywords
Bloom filter, Cloud computing, IDF rule, Scheme, Vector space
Abstract
Cloud computing has become a popular approach to manage personal data for the economic savings and management flexibility in recent year. However, the sensitive data must be encrypted before outsourcing to cloud servers for the consideration of privacy, which makes some traditional data utilization functions, such as the plaintext keyword search, impossible. To solve this problem, we present multi-keyword ranked search scheme over encrypted cloud data supporting dynamic operations efficiently. Our scheme utilizes the vector space model combined with TF IDF rule and cosine similarity measure to achieve a multi-keyword ranked search. However, traditional solutions have to suffer high computational costs. In order to achieve the sub-linear search time, our scheme introduces Bloom filter to build a search index tree. What is more, our scheme can support dynamic operation properly and effectively on the account of the property of the Bloom filter, which means that the updating cost of our scheme is lower than other schemes. We present our basic scheme first, which is secure under the known cipher text model. Then, the enhanced scheme is presented later to guarantee security even under the known background model. The experiments on the real-world data set show that the performances of our proposed schemes are satisfactory.
Downloads
How To Cite (APA)
Dr K. Vijaya Bhaskar, U. Muni Sekhar, S. Nayaz, & B VaraLakshmi (October-2023). TOWARDS ACHIEVING KEYWORD SEARCH OVER DYNAMIC ENCRYPTED CLOUD DATA WITH SYMMETRIC-KEY BASED VERIFICATION. INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT, 8(10), a169-a177. https://ijnrd.org/papers/IJNRD2310020.pdf
Issue
Volume 8 Issue 10, October-2023
Pages : a169-a177
Other Publication Details
Paper Reg. ID: IJNRD_206198
Published Paper Id: IJNRD2310020
Downloads: 000122254
Research Area: Engineering
Author Type: Indian Author
Country: -, -, India
Published Paper PDF: https://ijnrd.org/papers/IJNRD2310020.pdf
Published Paper URL: https://ijnrd.org/viewpaperforall?paper=IJNRD2310020
About Publisher
Journal Name: INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT(IJNRD)
UGC CARE JOURNAL PUBLICATION | ISSN: 2456-4184 | IMPACT FACTOR: 8.76 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.76 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJNRD (IJ Publication) Janvi Wave | IJNRD.ORG | IJNRD.COM | IJPUB.ORG
Copyright & License
© 2025 — Authors hold the copyright of this article. This work is licensed under a Creative Commons Attribution 4.0 International License. and The Open Definition.
You are free to share, adapt, and redistribute the material, provided proper credit is given to the original author. 🛡️ Disclaimer: The content, data, and findings in this article are based on the authors’ research and have been peer-reviewed for academic purposes only. Readers are advised to verify all information before practical or commercial use. The journal and its editorial board are not liable for any errors, losses, or consequences arising from its use.
Publication Timeline
Article Preview: View Full Paper
Call For Paper
IJNRD is a Scholarly Open Access, Peer-Reviewed, Refereed, and UGC CARE Journal Publication with a High Impact Factor of 8.76 (calculated by Google Scholar & Semantic Scholar | AI-Powered Research Tool). It is a Multidisciplinary, Monthly, Low-Cost, and Transparent Peer Review Journal Publication that adheres to the UGC CARE 2025 Peer-Reviewed Journal Policy and aligns with Scopus Journal Publication standards to ensure the highest level of research quality and credibility.
IJNRD offers comprehensive Journal Publication Services including indexing in all major databases and metadata repositories, Digital Object Identifier (Crossref DOI) assignment for each published article with additional fees, citation generation tools, and full Open Access visibility to enhance global research reach and citation impact.
The INTERNATIONAL JOURNAL OF NOVEL RESEARCH AND DEVELOPMENT (IJNRD) aims to advance applied, theoretical, and experimental research across diverse academic and professional fields. The journal promotes global knowledge exchange among researchers, developers, academicians, engineers, and practitioners, serving as a trusted platform for innovative, peer-reviewed journal publication and scientific collaboration.
Indexing Coverage: Google Scholar, SSRN, ResearcherID-Publons, Semantic Scholar (AI-Powered Research Tool), Microsoft Academic, Academia.edu, arXiv.org, ResearchGate, CiteSeerX, ResearcherID (Thomson Reuters), Mendeley, DocStoc, ISSUU, Scribd, and many other recognized academic repositories.
How to submit the paper?
By Our website
Click Here to Submit Paper Online
You can now publish your research in IJNRD. IJNRD is a Transparent Peer-Reviewed Open Access Journal Publication (Refereed Journal), aligning with New UGC and UGC CARE recommendations.
For more details, refer to the official notice: UGC Public Notice
Submit Paper Online
Important Dates for Current issue
Paper Submission Open For: December 2025
Current Issue: Volume 10 | Issue 12 | December 2025
Impact Factor: 8.76
Last Date for Paper Submission: Till 31-Dec-2025
Notification of Review Result: Within 1-2 Days after Submitting paper.
Publication of Paper: Within 01-02 Days after Submititng documents.
Frequency: Monthly (12 issue Annually).
Journal Type: IJNRD is an International Peer-reviewed, Refereed, and Open Access Journal with Transparent Peer Review as per the new UGC CARE 2025 guidelines, offering low-cost multidisciplinary publication with Crossref DOI and global indexing.
Subject Category: Research Area
Call for Paper: More Details
Approval, Licenses and Indexing: More Details
