Multi-user Verifiable Searchable Symmetric Encryption for Cloud Storage

Tags: , ,

Aim:

The main aim of this paper is to define an ideal functionality for MVSSE under the Universally Composable (UC-) security framework and prove that our ideal functionality implies the security requirements of a secure MVSSE, and our multi-user verifiable SSE scheme is UC-secure.

Existing System:

In the existing cloud data storage system, all types of files are stored in cloud and it does not have any file security. So Symmetric key encryption (SSE) is introduced to encrypt files and brings the high security due to its high efficiency. In a typical SSE scheme, a users stores encrypted files on a cloud storage server and later can retrieve the encrypted files containing specific keywords. The basic security requirement of SSE is that the cloud server learns no information about the files or the keywords during the searching process. Some SSE schemes also offer additional functionalities such as detecting cheating behavior of a malicious server (i.e., verifiability) and allowing update (e.g., modifying, deleting and adding) of documents on the server. However, the SSE schemes were designed for single users, which mean the searching can only be done by the data owner, whereas in reality people often use cloud storage to share files with other users.

Proposed System:

In the proposed system, we present a multi-user verifiable searchable symmetric encryption (MVSSE) scheme that achieves all the desirable features of a verifiable SSE and allows multiple users to perform searching. We then define an ideal functionality for MVSSE under the Universally Composable (UC-) security framework and prove that our ideal functionality implies the security requirements of a secure MVSSE, and our multi-user verifiable SSE scheme is UC-secure. We also implement our scheme to verify its high performance based on some real dataset.