A dynamic and non-interactive boolean searchable symmetric encryption in multi-client setting

Searchable symmetric encryption (SSE) allows one to outsource a collection of encrypted documents to a remote server, and later conduct keyword searches on these encrypted documents, while revealing minimal information to the server. Most existing SSE schemes are only proved adaptively secure against the untrusted server in the random oracle model. To enhance security, we consider the security in the standard model when designing an SSE scheme. We extend the OXT protocol of Cash et al. to support arbitrary boolean query in multi-client setting while achieving update of documents. Our scheme realizes access control on documents without requiring per-query interaction between the data owner and each client. In addition, we give a new effective T-set instantiation, which supports update of the index files. Besides, our scheme achieves provable security against adaptive adversarial server and malicious clients in the standard model. Finally, performance analysis shows the applicability of our scheme.