Dynamic Searchable Symmetric Encryption Schemes Supporting Range Queries with Forward (and Backward) Security

2018 ◽  
pp. 228-246 ◽  
Author(s):  
Cong Zuo ◽  
Shi-Feng Sun ◽  
Joseph K. Liu ◽  
Jun Shao ◽  
Josef Pieprzyk
Keyword(s):  
Range Queries ◽  
Symmetric Encryption ◽  
Searchable Symmetric Encryption ◽  
Encryption Schemes ◽  
Forward And Backward Security

scholarly journals Forward and Backward-Secure Range-Searchable Symmetric Encryption

2021 ◽  
Vol 2022 (1) ◽  
pp. 28-48
Author(s):  
Jiafan Wang ◽  
Sherman S. M. Chow
Keyword(s):  
Homomorphic Encryption ◽  
Inverted Index ◽  
Range Queries ◽  
Symmetric Encryption ◽  
Forward Security ◽  
Injection Attacks ◽  
Searchable Symmetric Encryption ◽  
Encrypted Database ◽  
Definition Of ◽  
Client Side

Abstract Dynamic searchable symmetric encryption (DSSE) allows a client to query or update an outsourced encrypted database. Range queries are commonly needed. Previous range-searchable schemes either do not support updates natively (SIGMOD’16) or use file indexes of many long bit-vectors for distinct keywords, which only support toggling updates via homomorphically flipping the presence bit. (ESORICS’18). We propose a generic upgrade of any (inverted-index) DSSE to support range queries (a.k.a. range DSSE), without homomorphic encryption, and a specific instantiation with a new trade-off reducing client-side storage. Our schemes achieve forward security, an important property that mitigates file injection attacks. Moreover, we identify a variant of injection attacks against the first somewhat dynamic scheme (ESORICS’18). We also extend the definition of backward security to range DSSE and show that our schemes are compatible with a generic upgrade of backward security (CCS’17). We comprehensively analyze the computation and communication overheads, including implementation details of client-side index-related operations omitted by prior schemes. We show high empirical efficiency for million-scale databases over a million-scale keyword space.

scholarly journals A Dynamic Searchable Symmetric Encryption Scheme for Multiuser with Forward and Backward Security

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xi Zhang ◽  
Ye Su ◽  
Jing Qin
Keyword(s):  
Random Model ◽  
Symmetric Encryption ◽  
Encrypted Data ◽  
Privacy Concerns ◽  
Search Results ◽  
Injection Attacks ◽  
Pseudorandom Functions ◽  
Searchable Symmetric Encryption ◽  
Security Guarantees ◽  
Forward And Backward Security

Dynamic Searchable Symmetric Encryption for Multiuser (M-DSSE) is an advanced form of symmetric encryption. It extends the traditional symmetric encryption to support the operations of adding and deleting the encrypted data and allow an authenticated group of data users to retrieve their respective desired encrypted data in the dynamic database. However, M-DSSE would suffer from the privacy concerns regarding forward and backward security. The former allows an attacker to identify the keywords contained in the added data by lunching file-injection attacks, while the latter allows to utilize the search results and the deleted data to learn the content. To our knowledge, these privacy concerns for M-DSSE have not been fully considered in the existing literatures. Taking account of this fact, we focus on the dynamic searchable symmetric encryption for multiuser meeting the needs of forward and backward security. In order to propose a concrete scheme, the primitives of Pseudorandom Functions (PRF) and the Homomorphic Message Authenticator (HMAC) are employed to construct the inverted index and update the search token. The proposed scheme is proven secure in the random model. And the performance analysis shows that the proposed scheme achieves the enhanced security guarantees at the reasonable price of efficiency.

scholarly journals Efficient and secure multi-functional searchable symmetric encryption schemes

2015 ◽  
Vol 9 (1) ◽  
pp. 34-42 ◽  
Author(s):  
Changhui Hu ◽  
Lidong Han ◽  
Siu Ming Yiu
Keyword(s):  
Symmetric Encryption ◽  
Searchable Symmetric Encryption ◽  
Encryption Schemes

scholarly journals Breach-Resistant Structured Encryption

2019 ◽  
Vol 2019 (1) ◽  
pp. 245-265 ◽  
Author(s):  
Ghous Amjad ◽  
Seny Kamara ◽  
Tarik Moataz
Keyword(s):  
Relational Databases ◽  
Linear Time ◽  
Query Complexity ◽  
Symmetric Encryption ◽  
The Past ◽  
History Independence ◽  
Searchable Symmetric Encryption ◽  
Encryption Schemes ◽  
Concrete Efficiency ◽  
Made In

Abstract Motivated by the problem of data breaches, we formalize a notion of security for dynamic structured encryption (STE) schemes that guarantees security against a snapshot adversary; that is, an adversary that receives a copy of the encrypted structure at various times but does not see the transcripts related to any queries. In particular, we focus on the construction of dynamic encrypted multi-maps which are used to build efficient searchable symmetric encryption schemes, graph encryption schemes and encrypted relational databases. Interestingly, we show that a form of snapshot security we refer to as breach resistance implies previously-studied notions such as a (weaker version) of history independence and write-only obliviousness. Moreover, we initiate the study of dual-secure dynamic STE constructions: schemes that are forward-private against a persistent adversary and breach-resistant against a snapshot adversary. The notion of forward privacy guarantees that updates to the encrypted structure do not reveal their association to any query made in the past. As a concrete instantiation, we propose a new dual-secure dynamic multi-map encryption scheme that outperforms all existing constructions; including schemes that are not dual-secure. Our construction has query complexity that grows with the selectivity of the query and the number of deletes since the client executed a linear-time rebuild protocol which can be de-amortized. We implemented our scheme (with the de-amortized rebuild protocol) and evaluated its concrete efficiency empirically. Our experiments show that it is highly efficient with queries taking less than 1 microsecond per label/value pair.

Toward Practical Searchable Symmetric Encryption

2013 ◽  
pp. 151-167 ◽  
Author(s):  
Wakaha Ogata ◽  
Keita Koiwa ◽  
Akira Kanaoka ◽  
Shin’ichiro Matsuo
Keyword(s):  
Symmetric Encryption ◽  
Searchable Symmetric Encryption

scholarly journals Efficient Searchable Symmetric Encryption Supporting Dynamic Multikeyword Ranked Search

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang
Keyword(s):  
Binary Tree ◽  
Search Time ◽  
Symmetric Encryption ◽  
Time Cost ◽  
Computational Costs ◽  
Related Space ◽  
Insertion And Deletion ◽  
Searchable Symmetric Encryption ◽  
Ranked Search ◽  
Binary Tree Structure

Searchable symmetric encryption that supports dynamic multikeyword ranked search (SSE-DMKRS) has been intensively studied during recent years. Such a scheme allows data users to dynamically update documents and retrieve the most wanted documents efficiently. Previous schemes suffer from high computational costs since the time and space complexities of these schemes are linear with the size of the dictionary generated from the dataset. In this paper, by utilizing a shallow neural network model called “Word2vec” together with a balanced binary tree structure, we propose a highly efficient SSE-DMKRS scheme. The “Word2vec” tool can effectively convert the documents and queries into a group of vectors whose dimensions are much smaller than the size of the dictionary. As a result, we can significantly reduce the related space and time cost. Moreover, with the use of the tree-based index, our scheme can achieve a sublinear search time and support dynamic operations like insertion and deletion. Both theoretical and experimental analyses demonstrate that the efficiency of our scheme surpasses any other schemes of the same kind, so that it has a wide application prospect in the real world.

Sign in / Sign up

Export Citation Format

Share Document