Practical, Dynamic and Efficient Integrity Verification for Symmetric Searchable Encryption

Abstract

Symmetric searchable encryption (SSE) has been proposed for years and widely used in cloud storage. It enables individuals and enterprises to outsource their encrypted personal data to cloud server and achieves efficient search. Currently most SSE schemes are working in the semi-honest or curious cloud server model in which the search results are not absolutely trustworthy. Thus, the verifiable SSE (VSSE) schemes are proposed to enable data integrity verification. However, the majority of existing VSSE schemes have their own limitations, such as not supporting dynamics (data updates), working in single-user mode or not practical etc. In this paper, we propose a practical, dynamic and efficient integrity verification method for SSE construction that is decoupled from original SSE schemes. This paper proposed a practical and general SSE (PGSSE for short) scheme to achieve more efficient data integrity verification in comparison with the state-of-the-art schemes. The proposed PGSSE can be applied to any top-k ranked SSE scheme to achieve integrity verification and efficient data updates. Security analysis and experimental results demonstrate that the proposed PGSSE scheme is secure and efficient.