A Confident and Dynamic Multi-Keyword Ordered Search Scheme Over Encrypted Cloud Data


Authors : Santosh Rahane, Yogesh Chikane.

Volume/Issue : Volume 3 - 2018, Issue 6 - June

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://goo.gl/TV3jnP

Thomson Reuters ResearcherID : https://goo.gl/3bkzwv

In view of the growing importance of circulated representation, an increasing number of data owners are convinced to outsource their data to cloud servers for incredible convenience and lower costs in data organization. In any case, confidential data must be encrypted before outsourcing for security requirements, which obsolete the use of data such as record recovery based on the password. In this document, we show a secure search system with the classification of several keywords, which at the same time supports dynamic update of records. The visualization of the vector space and the widely used form tf idf are mixed in the period of creation and query of the file. We create a tree-based record structure and offer “in-depth research” to search for records more efficiently. Taking into account the ultimate goal of opposing quantifiable attacks, the terms of appearance are added to the registration carrier for the blinded list items. Due to the use of our tree-based registration structure, which is substantially substantial, the proposed plan can obtain a sub-straight perspective of time and manage the deletion and inclusion of records in an adaptive way.

Keywords : Search encryption, multiple keyword ordered search, active update.

CALL FOR PAPERS


Paper Submission Last Date
30 - September - 2021

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe