A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data
Nowadays, searchable encryption technology has become the focus of research. Owing to the enormous growth in data storage capacity arising from individual users, business organizations, enterprises and government agencies, it will take these data owners a great deal of time to construct and update i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9019683/ |
| _version_ | 1818735495595687936 |
|---|---|
| author | Lianggui Liu Qiuxia Chen |
| author_facet | Lianggui Liu Qiuxia Chen |
| author_sort | Lianggui Liu |
| collection | DOAJ |
| description | Nowadays, searchable encryption technology has become the focus of research. Owing to the enormous growth in data storage capacity arising from individual users, business organizations, enterprises and government agencies, it will take these data owners a great deal of time to construct and update indexes in the field of encrypted search in untrusted cloud environment. This has become an urgent problem to be solved. In this paper, based on multiple keywords ranked search, a novel category group index mechanism is proposed. By classifying documents, we create group vectors in each index which can not only transform a high-dimensional secret key into several low-dimensional keys to accelerate the process of encrypting indexes but also improve the flexibility of adding, modifying or deleting documents. When updating indexes, only the group vectors corresponding to the changed category keyword sets need to be updated. During the retrieval process of the proposed mechanism, a novel “targeted search” method is designed. With this method, instead of calculating the whole products, cloud server only needs to calculate some inner products of group vectors corresponding to query keywords in the trapdoor and each index to improve the search speed and efficiency. Extensive theoretical analysis and experiment results demonstrate that the method is more feasible and more effective than the compared schemes. |
| first_indexed | 2024-12-18T00:22:10Z |
| format | Article |
| id | doaj.art-a48a8653c8c041e0afddf3b56287fc4d |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-18T00:22:10Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-a48a8653c8c041e0afddf3b56287fc4d2022-12-21T21:27:18ZengIEEEIEEE Access2169-35362020-01-018546015461010.1109/ACCESS.2020.29774309019683A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud DataLianggui Liu0https://orcid.org/0000-0002-2512-737XQiuxia Chen1College of Information Science and Technology, Zhejiang Shuren University, Hangzhou, ChinaCollege of Information Science and Technology, Zhejiang Shuren University, Hangzhou, ChinaNowadays, searchable encryption technology has become the focus of research. Owing to the enormous growth in data storage capacity arising from individual users, business organizations, enterprises and government agencies, it will take these data owners a great deal of time to construct and update indexes in the field of encrypted search in untrusted cloud environment. This has become an urgent problem to be solved. In this paper, based on multiple keywords ranked search, a novel category group index mechanism is proposed. By classifying documents, we create group vectors in each index which can not only transform a high-dimensional secret key into several low-dimensional keys to accelerate the process of encrypting indexes but also improve the flexibility of adding, modifying or deleting documents. When updating indexes, only the group vectors corresponding to the changed category keyword sets need to be updated. During the retrieval process of the proposed mechanism, a novel “targeted search” method is designed. With this method, instead of calculating the whole products, cloud server only needs to calculate some inner products of group vectors corresponding to query keywords in the trapdoor and each index to improve the search speed and efficiency. Extensive theoretical analysis and experiment results demonstrate that the method is more feasible and more effective than the compared schemes.https://ieeexplore.ieee.org/document/9019683/Encrypted searchgroup vectordimension reductioncategory updatetargeted search |
| spellingShingle | Lianggui Liu Qiuxia Chen A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data IEEE Access Encrypted search group vector dimension reduction category update targeted search |
| title | A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data |
| title_full | A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data |
| title_fullStr | A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data |
| title_full_unstemmed | A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data |
| title_short | A Novel Category Group Index Mechanism for Efficient Ranked Search of Encrypted Cloud Data |
| title_sort | novel category group index mechanism for efficient ranked search of encrypted cloud data |
| topic | Encrypted search group vector dimension reduction category update targeted search |
| url | https://ieeexplore.ieee.org/document/9019683/ |
| work_keys_str_mv | AT liangguiliu anovelcategorygroupindexmechanismforefficientrankedsearchofencryptedclouddata AT qiuxiachen anovelcategorygroupindexmechanismforefficientrankedsearchofencryptedclouddata AT liangguiliu novelcategorygroupindexmechanismforefficientrankedsearchofencryptedclouddata AT qiuxiachen novelcategorygroupindexmechanismforefficientrankedsearchofencryptedclouddata |