Dynamic searchable symmetric encryption (DSSE) is a useful cryptographic tool in encrypted cloud storage. However, it has been reported that DSSE usually suffers from file-injection attacks and content leak of deleted documents. To mitigate these attacks, forward privacy and backward privacy have been proposed. Nevertheless, the existing forward backward-private DSSE schemes can only support single keyword queries. To address this problem, in this paper, we propose two DSSE schemes supporting range queries. One is forward-private and supports a large number of documents. The other can achieve backward privacy, while it can only support a limited number of documents. Finally, we also give the security proofs of the proposed DSSE schemes in the random oracle model.
@cite_7 were the first using symmetric encryption to facilitate keyword search over the encrypted data. Later, @cite_6 gave a formal definition for SSE and the corresponding security model in the static setting. To make SSE more scalable and expressive, @cite_16 proposed a new scalable SSE supporting Boolean queries. Following this construction, many extensions have been proposed. @cite_10 extended it to process a much richer collection of queries. For instance, they used a binary tree with keywords labelled according to the tree levels to support range queries. @cite_2 made another extension to support general Boolean queries. 's construction has also been extended into multi-user setting @cite_8 @cite_21 @cite_4 . However, the above schemes cannot support data update. To solve this problem, some DSSE schemes have been proposed @cite_15 @cite_1 .
@cite_4 @cite_7 @cite_8 @cite_21 @cite_1 @cite_6 @cite_2 @cite_15 @cite_16 @cite_10
1502708590 2294724888 2152516507 2586817631
This work presents the design and analysis of the first searchable symmetric encryption (SSE) protocol that supports conjunctive search and general Boolean queries on outsourced symmetrically- encrypted data and that scales to very large databases and arbitrarily-structured data including free text search. To date, work in this area has focused mainly on single-keyword search. For the case of conjunctive search, prior SSE constructions required work linear in the total number of documents in the database and provided good privacy only for structured attribute-value data, rendering these solutions too slow and inflexible for large practical databases. We extend the searchable symmetric encryption (SSE) protocol of [, Crypto’13] adding support for range, substring, wildcard, and phrase queries, in addition to the Boolean queries supported in the original protocol. Our techniques apply to the basic single-client scenario underlying the common SSE setting as well as to the more complex Multi-Client and Outsourced Symmetric PIR extensions of [, CCS’13]. We provide performance information based on our prototype implementation, showing the practicality and scalability of our techniques to very large databases, thus extending the performance results of [, NDSS’14] to these rich and comprehensive query types. Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it. SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems. To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (, CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment. A Searchable Symmetric Encryption (SSE) scheme allows a server to search a user's data without having to decrypt the data. This provides the user with a high degree of privacy and is particularly useful when data is stored on Cloud. Numerous SSE schemes have already been proposed and while most have excellent security properties, few meet high performance requirements and most only support searching for a single keyword at a time. The SSE scheme of (CRYPTO 2013) is notable for its high efficiency on restricted forms of Boolean queries, but has low efficiency for, or does not support, other common forms of boolean queries. In this paper, we propose a generalization and optimization of the SSE scheme, which extends to support a much larger class of boolean queries, and performs no worse, and often with much higher efficiency than the scheme for the remaining queries.