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 Multi-User Searchable Symmetric Encryption with Dynamic Updates for Cloud Computing

Information ◽  
2018 ◽  
Vol 9 (10) ◽  
pp. 242 ◽  
Author(s):  
Chen Guo ◽  
Xingbing Fu ◽  
Yaojun Mao ◽  
Guohua Wu ◽  
Fagen Li ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Index Structure ◽  
Symmetric Encryption ◽  
Pseudorandom Functions ◽  
Searchable Symmetric Encryption ◽  
Security Guarantees ◽  
Cloud Servers ◽  
Dynamic Updates

With the advent of cloud computing, more and more users begin to outsource encrypted files to cloud servers to provide convenient access and obtain security guarantees. Searchable encryption (SE) allows a user to search the encrypted files without leaking information related to the contents of the files. Searchable symmetric encryption (SSE) is an important branch of SE. Most of the existing SSE schemes considered single-user settings, which cannot meet the requirements for data sharing. In this work, we propose a multi-user searchable symmetric encryption scheme with dynamic updates. This scheme is applicable to the usage scenario where one data owner encrypts sensitive files and shares them among multiple users, and it allows secure and efficient searches/updates. We use key distribution and re-encryption to achieve multi-user access while avoiding a series of issues caused by key sharing. Our scheme is constructed based on the index structure where a bit matrix is combined with two static hash tables, pseudorandom functions and hash functions. Our scheme is proven secure in the random oracle model.

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 Privacy-Preserving Approximate k-Nearest-Neighbors Search that Hides Access, Query and Volume Patterns

2021 ◽  
Vol 2021 (4) ◽  
pp. 549-574
Author(s):  
Alexandra Boldyreva ◽  
Tianxin Tang
Keyword(s):  
Nearest Neighbors ◽  
Privacy Preserving ◽  
Locality Sensitive Hashing ◽  
Security Model ◽  
Symmetric Encryption ◽  
K Nearest Neighbors ◽  
Encrypted Data ◽  
Generic Construction ◽  
Knn Search ◽  
Security Guarantees

Abstract We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN search and updates. We design a security model and propose a generic construction based on locality-sensitive hashing, symmetric encryption, and an oblivious map. The construction provides very strong security guarantees, not only hiding the information about the data, but also the access, query, and volume patterns. We implement, evaluate efficiency, and compare the performance of two concrete schemes based on an oblivious AVL tree and an oblivious BSkiplist.

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