Forward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates

Kim, Kee Sung; Kim, Minkyu; Lee, Dongsoo; Park, Je Hong; Kim, Woo-Hwan

doi:10.1145/3133956.3133970

Cited by 119 publications

(78 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic SSE schemes were designed to handle large DBs with possible updates (see details in subsection IV-D). Concurrently to our work [13] proposed a combination of the forward and inverted index approach. Keyword search in the public-key setting (PEKS) was introduced by [2] and later improved in several directions [4].…”

Section: A Related Workmentioning

confidence: 99%

Searchable Symmetric Encryption for Restricted Search

Horváth

Vajda

2018

JCOMSS

View full text Add to dashboard Cite

Abstract-The proliferation of cloud computing highlights the importance of techniques that permit both secure storage of sensitive data and flexible data management at the same time. One line of research with this double motivation is the study of Searchable Symmetric Encryption (SSE) that has provided several outstanding results in the recent years. These solutions achieve sublinear keyword search in huge databases by using various data structures to store keywords and document identifiers. In this work, we focus on certain scenarios in which search over the whole database is not necessary and show that the otherwise inefficient sequential scan (in linear time) can be very practical. This is due to the fact that adding new entries to the database comes for free in this case while updating a complex data structure without information leakage is rather complicated. To demonstrate the practicality of our approach we build a simple SSE scheme based on bilinear pairings and prove its security against adaptive chosen-keyword attacks in the standard model under the widely used Symmetric eXternal Diffie-Hellman (SXDH) assumption.

show abstract

Section: A Related Workmentioning

confidence: 99%

Searchable Symmetric Encryption for Restricted Search

Horváth

Vajda

2018

JCOMSS

View full text Add to dashboard Cite

show abstract

“…for users to securely and dynamically build the encrypted database [34][35][36][37]. Since 2016 several schemes have been proposed to achieve this goal using different cryptographic primitives, including Sophos [20] (uses trapdoor permutation (TDP)), Diana [24] (uses Constrained Pseudorandom Function (CPRF)), and Dual [25] (uses keyed hash function). Among them, Diana [24] and Dual [25] only use symmetric primitives and are more efficient.…”

Section: The Need For Forward Privacymentioning

confidence: 99%

“…Since 2016 several schemes have been proposed to achieve this goal using different cryptographic primitives, including Sophos [20] (uses trapdoor permutation (TDP)), Diana [24] (uses Constrained Pseudorandom Function (CPRF)), and Dual [25] (uses keyed hash function). Among them, Diana [24] and Dual [25] only use symmetric primitives and are more efficient. Backward privacy (BP) is a related security notion that prevents search operations from leaking the matching elements after they have been deleted.…”

Section: The Need For Forward Privacymentioning

confidence: 99%

“…It has both high security and efficiency. Experiment results show that with the large dataset (wikipedia) and RockDB, in multiple thread environment, Khons is at least 3× faster than Dual [25] and 2× than Fides [24].…”

Section: )mentioning

confidence: 99%

“…There exist some differences among our scheme, [21] and [25] even we all employ forward and backward indexes simultaneously. Notice that the order of the pointers of elements in Khons is the opposite of [21] and [25]. Namely the new file will point to the old file, so that adding a new file no longer require changing the pointing of the previous file.…”

Section: Comparisonmentioning

confidence: 99%

See 2 more Smart Citations

Searchable Symmetric Encryption with Forward Search Privacy

Huang

et al. 2021

IEEE Trans. Dependable and Secure Comput.

137

View full text Add to dashboard Cite

Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries in practice. Although SSE is powerful and feature-rich, it is always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement for any newly designed SSE schemes. However, the subsequent search operations can still leak a significant amount of information. To further strengthen security, we extend the definition of forward privacy and propose the notion of "forward search privacy". Intuitively, it requires search operations over newly added documents do not leak any information about past queries. The enhanced security notion poses new challenges to the design of SSE. We address the challenges by developing the hidden pointer technique (HPT) and propose a new SSE scheme called Khons, which satisfies our security notion (with the original forward privacy notion) and is also efficient. We implemented Khons and our experiment results on large dataset (wikipedia) show that it is more efficient than existing SSE schemes with forward privacy.

show abstract

FTPS: Efficient fault‐tolerant dynamic phrase search over outsourced encrypted data with forward and backward privacy

Zhou

Liu

Vijayakumar³

2022

Concurrency and Computation

View full text Add to dashboard Cite

With the popularity of cloud computing, more and more users store sensitive information in cloud servers. In order to protect the data over the cloud server, symmetric encryption with keyword search has been developed and the phrase search has been proposed subsequently to overcome the inefficiency produced by single/multi-keyword search. However, most existing phrase search schemes fails to support fault-tolerant search which is essential to users. Therefore, this paper proposes a fault-tolerant dynamic phrase search scheme with forward privacy and backward privacy (FTPS). Piecewise Linear Chaotic Map and minhash function are used to blur information, and Bloom filter based index is constructed to realize efficient search and dynamic update simultaneously. Security analysis proves that FTPS can properly preserve the privacy of search user, and experimental results show that FTPS is practical.

show abstract

Forward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates

Cited by 119 publications

References 23 publications

Searchable Symmetric Encryption for Restricted Search

Searchable Symmetric Encryption for Restricted Search

Searchable Symmetric Encryption with Forward Search Privacy

FTPS: Efficient fault‐tolerant dynamic phrase search over outsourced encrypted data with forward and backward privacy

Contact Info

Product

Resources

About