Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity

2017 ◽  
pp. 94-124 ◽  
Author(s):  
Seny Kamara ◽  
Tarik Moataz
Keyword(s):  
Linear Complexity ◽  
Symmetric Encryption ◽  
Worst Case ◽  
Searchable Symmetric Encryption

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.

scholarly journals Implementation of searchable symmetric encryption for privacy-preserving keyword search on cloud storage

2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Md Iftekhar Salam ◽  
Wei-Chuen Yau ◽  
Ji-Jian Chin ◽  
Swee-Huay Heng ◽  
Huo-Chong Ling ◽  
...  
Keyword(s):  
Cloud Storage ◽  
Keyword Search ◽  
Privacy Preserving ◽  
Symmetric Encryption ◽  
Searchable Symmetric Encryption

Multi-User Verifiable Searchable Symmetric Encryption for Cloud Storage

2020 ◽  
Vol 17 (6) ◽  
pp. 1322-1332 ◽  
Author(s):  
Xueqiao Liu ◽  
Guomin Yang ◽  
Yi Mu ◽  
Robert H. Deng
Keyword(s):  
Cloud Storage ◽  
Symmetric Encryption ◽  
Searchable Symmetric Encryption
Sign in / Sign up

Export Citation Format

Share Document