Dynamic multi-keyword searchable encryption scheme
Users of cloud storage often outsource their data to cloud servers to save local storage resources.However, cloud storage data is out of the user’s physical control, which may lead to malicious theft or disclosure of private data on cloud.At present, dynamic searchable encryption schemes are mostly...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2023-04-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023028 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841529685030207488 |
|---|---|
| author | Chenghao YUAN Yong LI Shuang REN |
| author_facet | Chenghao YUAN Yong LI Shuang REN |
| author_sort | Chenghao YUAN |
| collection | DOAJ |
| description | Users of cloud storage often outsource their data to cloud servers to save local storage resources.However, cloud storage data is out of the user’s physical control, which may lead to malicious theft or disclosure of private data on cloud.At present, dynamic searchable encryption schemes are mostly based on symmetric searchable encryption, which need to establish a secure key sharing channel in advance, and cannot be directly applied to data sharing in cloud storage scenarios.For the secure sharing scenario of multi-party data in cloud storage, a dynamic multi-keyword searchable encryption scheme was proposed.The forward index was constructed by a cuckoo filter to enable data owners to perform documents and index dynamic updates.The conjunctive multi-keywords search was supported by combining bilinear pairing with Lagrangian interpolation polynomials.To reduce the computational overhead in the ciphertext retrieval phase, a combination of inverted index and forward index was constructed to improve the retrieval efficiency of cloud server.This scheme is provably secure with the indistinguishability in adaptively chosen keyword attack under decision linear Diffie-Hellman problem.Simulation experiments were conducted to analyze the execution efficiency of the scheme for keyword search and index update in different datasets.The results show that the scheme effectively avoids the linear correlation between the retrieval time and the number of ciphertexts, and reduces the computational overhead in the update operation with a large amount of data. |
| format | Article |
| id | doaj-art-33eeb64db3884f6bb7bf3c3aafec7790 |
| institution | Kabale University |
| issn | 2096-109X |
| language | English |
| publishDate | 2023-04-01 |
| publisher | POSTS&TELECOM PRESS Co., LTD |
| record_format | Article |
| series | 网络与信息安全学报 |
| spelling | doaj-art-33eeb64db3884f6bb7bf3c3aafec77902025-01-15T03:16:22ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2023-04-01914315359576441Dynamic multi-keyword searchable encryption schemeChenghao YUANYong LIShuang RENUsers of cloud storage often outsource their data to cloud servers to save local storage resources.However, cloud storage data is out of the user’s physical control, which may lead to malicious theft or disclosure of private data on cloud.At present, dynamic searchable encryption schemes are mostly based on symmetric searchable encryption, which need to establish a secure key sharing channel in advance, and cannot be directly applied to data sharing in cloud storage scenarios.For the secure sharing scenario of multi-party data in cloud storage, a dynamic multi-keyword searchable encryption scheme was proposed.The forward index was constructed by a cuckoo filter to enable data owners to perform documents and index dynamic updates.The conjunctive multi-keywords search was supported by combining bilinear pairing with Lagrangian interpolation polynomials.To reduce the computational overhead in the ciphertext retrieval phase, a combination of inverted index and forward index was constructed to improve the retrieval efficiency of cloud server.This scheme is provably secure with the indistinguishability in adaptively chosen keyword attack under decision linear Diffie-Hellman problem.Simulation experiments were conducted to analyze the execution efficiency of the scheme for keyword search and index update in different datasets.The results show that the scheme effectively avoids the linear correlation between the retrieval time and the number of ciphertexts, and reduces the computational overhead in the update operation with a large amount of data.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023028searchable encryptioncloud storagecuckoo filterinverted index |
| spellingShingle | Chenghao YUAN Yong LI Shuang REN Dynamic multi-keyword searchable encryption scheme 网络与信息安全学报 searchable encryption cloud storage cuckoo filter inverted index |
| title | Dynamic multi-keyword searchable encryption scheme |
| title_full | Dynamic multi-keyword searchable encryption scheme |
| title_fullStr | Dynamic multi-keyword searchable encryption scheme |
| title_full_unstemmed | Dynamic multi-keyword searchable encryption scheme |
| title_short | Dynamic multi-keyword searchable encryption scheme |
| title_sort | dynamic multi keyword searchable encryption scheme |
| topic | searchable encryption cloud storage cuckoo filter inverted index |
| url | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2023028 |
| work_keys_str_mv | AT chenghaoyuan dynamicmultikeywordsearchableencryptionscheme AT yongli dynamicmultikeywordsearchableencryptionscheme AT shuangren dynamicmultikeywordsearchableencryptionscheme |