Forward-Secure Searchable Encryption on Labeled Bipartite Graphs

Lai, Russell W. F.; Chow, Sherman S. M.

doi:10.1007/978-3-319-61204-1_24

Cited by 32 publications

(37 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, several forward-private DSSE schemes only relying on symmetric primitives have been proposed (e.g., [20], [21], [22], [23]), some of which offer parallelism (e.g., [20], [21], [23]), and improved I/O access with computation efficiency using a caching strategy (e.g., [20], [21], [22]). For example, Lai et al in [20] modeled the relationship between keywords and files in DSSE as bipartite graphs. The authors also proposed a novel data structure called cascaded triangles, which offers parallelism and efficient update (add/delete).…”

Section: Related Workmentioning

confidence: 99%

“…• Highly secure against File-Injection Attacks: IM-DSSE offers forward privacy (see [2] or §4 for definition) which is an imperative security feature to mitigate the impact of practical file-injection attacks [11], [16]. Only a limited number of DSSE schemes offer this property (i.e., [2], [11], [15], [18], [20], [21], [22], [23]), some of which incur high client storage with costly update (e.g., [2]) or high delay, due to oblivious access techniques (e.g., [18]) and public-key operations (e.g., [11]). Additionally, IM-DSSE offers size-obliviousness property, where it hides all size information involved with the encrypted index and update query including (i) update query size (i.e., number of unique keywords in the updated file); (ii) and the number of keyword-file pairs in the database.…”

Section: Improvements Over Preliminary Versionmentioning

confidence: 99%

“…• Fully Parallelizable: IM-DSSE also supports parallelization (as in [5], [20], [21], [23]) for both update and search operations and, therefore, it takes full advantage of modern computing architecture to minimize the delay of cryptographic operations. Experiments on Amazon cloud indicates that the search latency of our framework is highly practical and mostly dominated by the clientserver communication (see §5).…”

Section: Improvements Over Preliminary Versionmentioning

confidence: 99%

“…Scheme 2 presents IM-DSSE I .AddToken Algorithm and IM-DSSE I .Add Algorithm for file addition procedure in IM-DSSE I (modifications for file deletion follow the same principle). Specifically, we substitute encryption and decryption using random oracle H(r i ||j||u j ) with block cipher encryption E.Enc ri (·, l||u l ) and E.Dec ri (·, l||u l ), respectively, where u l is a block counter (see steps 12,20). Since I is encrypted by blocks, to update a column during the file update, the client needs to retrieve a whole block and its state from the server first (step 6).…”

Section: Im-dsse I : Minimized Search Latencymentioning

confidence: 99%

See 3 more Smart Citations

A Secure Searchable Encryption Framework for Privacy-Critical Cloud Storage Services

Hoang

Yavuz

Merchan

2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Searchable encryption has received a significant attention from the research community with various constructions being proposed, each achieving asymptotically optimal complexity for specific metrics (e.g., search, update). Despite their elegance, the recent attacks and deployment efforts have shown that the optimal asymptotic complexity might not always imply practical performance, especially if the application demands a high privacy. In this article, we introduce a novel Dynamic Searchable Symmetric Encryption (DSSE) framework called Incidence Matrix (IM)-DSSE, which achieves a high level of privacy, efficient search/update, and low client storage with actual deployments on real cloud settings. We harness an incidence matrix along with two hash tables to create an encrypted index, on which both search and update operations can be performed effectively with minimal information leakage. This simple set of data structures surprisingly offers a high level of DSSE security while achieving practical performance. Specifically, IM-DSSE achieves forward-privacy, backward-privacy and size-obliviousness simultaneously. We also create several DSSE variants, each offering different trade-offs that are suitable for different cloud applications and infrastructures. We fully implemented our framework and evaluated its performance on a real cloud system (Amazon EC2). We have released IM-DSSE as an open-source library for wide development and adaptation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Improvements Over Preliminary Versionmentioning

confidence: 99%

Section: Improvements Over Preliminary Versionmentioning

confidence: 99%

Section: Im-dsse I : Minimized Search Latencymentioning

confidence: 99%

See 2 more Smart Citations

A Secure Searchable Encryption Framework for Privacy-Critical Cloud Storage Services

Hoang

Yavuz

Merchan

2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Curtmola et al [19] proposed the most widely used security definition and the first scheme with non-trivial search time. It has since been improved in several ways, e.g., support for multiple users [49], [50], [33], more expressive queries including relational databases, conjunctive keywords, and graph queries [13], [34], [17], [41], [35], [22], [40], or efficient ondisk storage [14], [43], [7], [23], [20].…”

Section: B Related Workmentioning

confidence: 99%

Dynamic Searchable Encryption with Small Client Storage

Demertzis

Chamani

Papadopoulos

et al. 2020

Proceedings 2020 Network and Distributed System Security Symposium

View full text Add to dashboard Cite

We study the problem of dynamic searchable encryption (DSE) with forward-and-backward privacy. Many DSE schemes have been proposed recently but the most efficient ones have one limitation: they require maintaining one operation counter for each unique keyword, either stored locally at the client or stored encrypted at the server and accessed obliviously (e.g., with an oblivious map) during every operation. We propose three new schemes that overcome the above limitation and achieve constant permanent client storage with improved performance, both asymptotically and experimentally, compared to prior stateof-the-art works. In particular, our first two schemes adopt a "static-to-dynamic" transformation which eliminates the need for oblivious accesses during searches. Due to this, they are the first practical schemes with minimal client storage and non-interactive search. Our third scheme is the first quasi-optimal forward-andbackward DSE scheme with only a logarithmic overhead for retrieving the query result (independently of previous deletions). While it does require an oblivious access during search in order to keep permanent client storage minimal, its practical performance is up to four orders of magnitude better than the best existing scheme with quasi-optimal search.

show abstract

Forward Secure Searchable Encryption Using Key-Based Blocks Chain Technique

Huang

et al. 2018

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Forward-Secure Searchable Encryption on Labeled Bipartite Graphs

Cited by 32 publications

References 14 publications

A Secure Searchable Encryption Framework for Privacy-Critical Cloud Storage Services

A Secure Searchable Encryption Framework for Privacy-Critical Cloud Storage Services

Dynamic Searchable Encryption with Small Client Storage

Forward Secure Searchable Encryption Using Key-Based Blocks Chain Technique

Contact Info

Product

Resources

About