Abstract:
Cloud computing is increasingly used to host massive datasets. Existing research suggests encrypting sensitive data before outsourcing and using Searchable Symmetric Encryption (SSE) for keyword-based searches over the ciphertexts since the cloud service provider (CSP) is outside the users’ trusted domain.
However, designing an SSE scheme that supports sublinear search time, efficient update and verification, and on-demand information retrieval is difficult. We propose a Verifiable Dynamic Encryption with Ranked Search (VDERS) scheme that lets users perform top-K searches on a dynamic document collection and verify the search results securely and efficiently.
For verifiable document insertion in top-K searches, we first construct VDERS0, a ranked inverted index and verifiable matrix. VDERS, an advanced construction, is then created to support document deletion with lower communication costs. Our VDERS scheme works well in real datasets.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
