A Dynamic Searchable Symmetric Encryption Scheme for Multiuser with Forward and Backward Security

Abstract EN

Dynamic Searchable Symmetric Encryption for Multiuser (M-DSSE) is an advanced form of symmetric encryption.

It extends the traditional symmetric encryption to support the operations of adding and deleting the encrypted data and allow an authenticated group of data users to retrieve their respective desired encrypted data in the dynamic database.

However, M-DSSE would suffer from the privacy concerns regarding forward and backward security.

The former allows an attacker to identify the keywords contained in the added data by lunching file-injection attacks, while the latter allows to utilize the search results and the deleted data to learn the content.

To our knowledge, these privacy concerns for M-DSSE have not been fully considered in the existing literatures.

Taking account of this fact, we focus on the dynamic searchable symmetric encryption for multiuser meeting the needs of forward and backward security.

In order to propose a concrete scheme, the primitives of Pseudorandom Functions (PRF) and the Homomorphic Message Authenticator (HMAC) are employed to construct the inverted index and update the search token.

The proposed scheme is proven secure in the random model.

And the performance analysis shows that the proposed scheme achieves the enhanced security guarantees at the reasonable price of efficiency.