Efficient Conjunctive Keyword Search on Encrypted Data Storage System

Byun, Jin Wook; Lee, Dong Hoon; Lim, Jongsik

doi:10.1007/11774716_15

Cited by 75 publications

(30 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since 2004, several articles focus on extending the search options to enable especially conjunctive search [15,6,18,19,22,23,16,3,7]. A natural question arises then: why do we need special schemes for performing conjunctive queries?…”

Section: State Of the Artmentioning

confidence: 98%

Boolean symmetric searchable encryption

Moataz

Shikfa²

2013

Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

View full text Add to dashboard Cite

In this article we tackle the issue of searchable encryption with a generalized query model. Departing from many previous works that focused on queries consisting of a single keyword, we consider the the case of queries consisting of arbitrary boolean expressions on keywords, that is to say conjunctions and disjunctions of keywords and their complement. Our construction of boolean symmetric searchable encryption BSSE is mainly based on the orthogonalization of the keyword field according to the Gram-Schmidt process. Each document stored in an outsourced server is associated with a label which contains all the keywords corresponding to the document, and searches are performed by way of a simple inner product. Furthermore, the queries in the BSSE scheme are randomized. This randomization hides the search pattern of the user since the search results cannot be associated deterministically to queries. We formally define an adaptive security model for the BSSE scheme. In addition, the search complexity is in O(n) where n is the number of documents stored in the outsourced server.

show abstract

Section: State Of the Artmentioning

confidence: 98%

Boolean symmetric searchable encryption

Moataz

Shikfa²

2013

Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

View full text Add to dashboard Cite

show abstract

“…In public key settings, a first conjunctive keyword searchable scheme is defined by Park et al [8]. Subsequently, the schemes with the improved communication and storage efficiency are proposed in [9,28]. Boneh and Waters have given a generalized scheme [29] for conjunction as well as for subset queries.…”

Section: Related Workmentioning

confidence: 99%

Multiuser Searchable Encryption with Token Freshness Verification

Sharma¹,

Jinwala²

2017

Security and Communication Networks

View full text Add to dashboard Cite

A Multiuser Searchable Encryption (MUSE) can be defined with the notion of Functional Encryption (FE) where a user constructs a search token from a search key issued by an Enterprise Trusted Authority (ETA). In such scheme, a user possessing search key constructs search token at any time and consequently requests the server to search over encrypted data. Thus, an FE based MUSE scheme is not suitable for the applications where a log of search activities is maintained at the enterprise site to identify dishonest search query from any user. In addition, none of the existing searchable schemes provides security against token replay attack to avoid reuse of the same token. In this paper, therefore we propose an FE based scheme, Multiuser Searchable Encryption with Token Freshness Verification (MUSE-TFV). In MUSE-TFV, a user prepares one-time usable search token in cooperation with ETA and thus every search activity is logged at the enterprise site. Additionally, by verifying the freshness of a token, the server prevents reuse of the token. With formal security analysis, we prove the security of MUSE-TFV against chosen keyword attack and token replay attack. With theoretical and empirical analysis, we justify the effectiveness of MUSE-TFV in practical applications.

show abstract

“…All other dedicated solutions require server work that is linear in the size of the database. Of these solutions, the one that provides the best privacy guarantees is due to Golle et al [13], with variants presented in later work, e.g., [1,3]. They show how to build for each conjunctive query a set of tokens that can be tested against each document in the database (more precisely, against an encoded version of the document's keywords) to identify matching documents.…”

Section: Introductionmentioning

confidence: 99%

“…Our implementation of this protocol, which we name OXT, uses only DH-type operations over any DiffieHellman group which enables the use of the secure and most efficient DH elliptic curves (with additional common-base optimizations). 3 The complexity of our search protocols is independent of the number of documents in the database. To search for documents containing w 1 , .…”

Section: Introductionmentioning

confidence: 99%

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries

Cash

Jarecki

Jutla³

et al. 2013

Lecture Notes in Computer Science

595

611

View full text Add to dashboard Cite

Abstract. 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 symmetricallyencrypted data and that scales to very large databases and arbitrarilystructured 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.In contrast, our solution provides a realistic and practical trade-off between performance and privacy by efficiently supporting very large databases at the cost of moderate and well-defined leakage to the outsourced server (leakage is in the form of data access patterns, never as direct exposure of plaintext data or searched values). We present a detailed formal cryptographic analysis of the privacy and security of our protocols and establish precise upper bounds on the allowed leakage. To demonstrate the real-world practicality of our approach, we provide performance results of a prototype applied to several large representative data sets, including encrypted search over the whole English Wikipedia (and beyond).

show abstract

Efficient Conjunctive Keyword Search on Encrypted Data Storage System

Cited by 75 publications

References 8 publications

Boolean symmetric searchable encryption

Boolean symmetric searchable encryption

Multiuser Searchable Encryption with Token Freshness Verification

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries

Contact Info

Product

Resources

About