Proceedings 2014 Network and Distributed System Security Symposium 2014
DOI: 10.14722/ndss.2014.23298
|View full text |Cite
|
Sign up to set email alerts
|

Practical Dynamic Searchable Encryption with Small Leakage

Abstract: Abstract-Dynamic Searchable Symmetric Encryption (DSSE) enables a client to encrypt his document collection in a way that it is still searchable and efficiently updatable. However, all DSSE constructions that have been presented in the literature so far come with several problems: Either they leak a significant amount of information (e.g., hashes of the keywords contained in the updated document) or are inefficient in terms of space or search/update time (e.g., linear in the number of documents).In this paper … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
396
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 423 publications
(397 citation statements)
references
References 35 publications
(53 reference statements)
1
396
0
Order By: Relevance
“…Extensive work has been done in basic SSE, which caters for a single keyword [6]. Recent improvements have been proposed to handle conjunctive search over multiple keywords [5], and to optimise the resolution to cater for large scale data in the presence of updates [4,20,30]. However, all of these works focus on keyword-based retrieval, whereas structured querying (such as SPARQL) over encrypted RDF datasets would require (at least) an unrestricted set of triple query patterns.…”
Section: Related Workmentioning
confidence: 99%
“…Extensive work has been done in basic SSE, which caters for a single keyword [6]. Recent improvements have been proposed to handle conjunctive search over multiple keywords [5], and to optimise the resolution to cater for large scale data in the presence of updates [4,20,30]. However, all of these works focus on keyword-based retrieval, whereas structured querying (such as SPARQL) over encrypted RDF datasets would require (at least) an unrestricted set of triple query patterns.…”
Section: Related Workmentioning
confidence: 99%
“…Our main contribution is designing the first asymptotically-optimal parallelizable dynamic SSE scheme that provides forward privacy. Our scheme outperforms the existing schemes providing forward privacy [6,29], and is competitive with the most efficient dynamic SSE schemes without forward privacy [19,20] while providing stronger security. In particular, our scheme:…”
Section: Introductionmentioning
confidence: 86%
“…Thus, all our leakage is minimal across all known efficient dynamic SSE schemes. Now, we define the security of our DSSE scheme via ideal-real simulation similar to [29]. Definition 2.6 (Security of SSE scheme).…”
Section: Definition 22 (Search Pattern)mentioning
confidence: 99%
See 1 more Smart Citation
“…A scheme achieving sublinear search time using inverted index was also proposed. Most of the subsequent SSE schemes, such as schemes in [5,[20][21][22][23][24][25][26][27] adopted or extended the model proposed by Curtmola et al [19]. All these schemes are based on a single server.…”
Section: Searchable Symmetric Encryption (Sse)mentioning
confidence: 99%