PROJECT TITLE :

Enabling Verifiable and Dynamic Ranked Search Over Outsourced Data

ABSTRACT:

The Cloud Computing paradigm, which has a lot of potential, is increasingly being used by users as potential storage locations for their massive datasets. Existing research suggests encrypting sensitive data before outsourcing it and adopting Searchable Symmetric Encryption (SSE) to facilitate keyword-based searches over the ciphertexts. This is because the cloud service provider (CSP) is not within the trusted domain of the users. To design an efficient SSE scheme that simultaneously supports sublinear search time, efficient update and verification, and on-demand information retrieval remains a challenging task. However, this is a task that must be accomplished. In order to solve this problem, we have come up with the idea of a scheme called Verifiable Dynamic Encryption with Ranked Search (VDERS). This allows a user to perform top-K searches on a dynamic document collection and verify the accuracy of the search results in a way that is both secure and time-effective. To be more specific, we first present a fundamental construction that we call VDERS0. In this construction, a ranked inverted index and a verifiable matrix are built in order to facilitate the insertion of verifiable documents in top-K searches. After that, an innovative construction called VDERS is developed to further support document deletion while simultaneously lowering the cost of Communication. Extensive testing of our VDERS scheme on real datasets has shown that it is both efficient and effective.