Multi-level Access in Searchable Symmetric Encryption

Author(s):  
James Alderman ◽  
Keith M. Martin ◽  
Sarah Louise Renwick
2020 ◽  
Vol XXIII (1) ◽  
pp. 213-220
Author(s):  
Marius Iulian Mihailescu

Accessing the files remotely offers a rentable solution for file storage. If the files are sensitive these should be encrypted before they will be outsourced for assuring confidentiality. These being said, the searching process becomes a real challenging problem. Most of the schemes consider only the scenarios where the users can search entirely over the encrypted files or data. In practice, the sensitive data are classified using an access control policy and different users should have different rights. The current paper will examine and propose a scheme of a multi-level access control policy (MlACP) based on searchable symmetric encryption (SSE) for the software infrastructures that ensure the interoperability of the software applications that access and work with documents and files. The proof of MlACP is The accessibility of the documents is defined by an access control policy designed to take into consideration the applicability in a multitude of IT infrastructures’, such as maritime, environmental protection and ecology, physics analysis and statistics software applications.


Author(s):  
Wakaha Ogata ◽  
Keita Koiwa ◽  
Akira Kanaoka ◽  
Shin’ichiro Matsuo

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang

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.


Author(s):  
Md Iftekhar Salam ◽  
Wei-Chuen Yau ◽  
Ji-Jian Chin ◽  
Swee-Huay Heng ◽  
Huo-Chong Ling ◽  
...  

2020 ◽  
Vol 17 (6) ◽  
pp. 1322-1332 ◽  
Author(s):  
Xueqiao Liu ◽  
Guomin Yang ◽  
Yi Mu ◽  
Robert H. Deng

Sign in / Sign up

Export Citation Format

Share Document