Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption
Searchable encryption enables the data owner to outsource their data to the cloud server while retaining the search ability. Recently, some researchers proposed a variant of searchable encryption, named single-writer/multi-reader searchable encryption (SMSE), in which any authorized data user can pe...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Graz University of Technology
2019-03-01
|
| Series: | Journal of Universal Computer Science |
| Subjects: | |
| Online Access: | https://lib.jucs.org/article/22594/download/pdf/ |
| _version_ | 1819067210066296832 |
|---|---|
| author | Yunling Wang Jianfeng Wang Shi-Feng Sun Joseph Liu Willy Susilo Joonsang Baek Ilsun You Xiaofeng Chen |
| author_facet | Yunling Wang Jianfeng Wang Shi-Feng Sun Joseph Liu Willy Susilo Joonsang Baek Ilsun You Xiaofeng Chen |
| author_sort | Yunling Wang |
| collection | DOAJ |
| description | Searchable encryption enables the data owner to outsource their data to the cloud server while retaining the search ability. Recently, some researchers proposed a variant of searchable encryption, named single-writer/multi-reader searchable encryption (SMSE), in which any authorized data user can perform a search query. That is, each document identifier is encrypted using attribute-based encryption (ABE), such that an arbitrary authorized user whose attributes match the corresponding access policy can access the document. However, the cloud server cannot determine whether the user has the ability to decrypt the matched data. Thus, it has to response all the search results to the data user, which causes a heavy communication and computation cost. To cope with this problem, we present a novel SMSE scheme based on server-side match technique, where the cloud can filter the documents that cannot be decrypted by the user and only return the matched ones. In addition, the decryption is also efficient, independent with the access policy structure. Security and efficiency evaluation show that our proposed scheme can achieve the desired security goals, while dramatically reducing the communication and computation overhead. |
| first_indexed | 2024-12-21T16:14:38Z |
| format | Article |
| id | doaj.art-cae6c980c1a24ab482c2576fd481f595 |
| institution | Directory Open Access Journal |
| issn | 0948-6968 |
| language | English |
| last_indexed | 2024-12-21T16:14:38Z |
| publishDate | 2019-03-01 |
| publisher | Graz University of Technology |
| record_format | Article |
| series | Journal of Universal Computer Science |
| spelling | doaj.art-cae6c980c1a24ab482c2576fd481f5952022-12-21T18:57:43ZengGraz University of TechnologyJournal of Universal Computer Science0948-69682019-03-0125322224410.3217/jucs-025-03-022222594Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast DecryptionYunling Wang0Jianfeng Wang1Shi-Feng Sun2Joseph Liu3Willy Susilo4Joonsang Baek5Ilsun You6Xiaofeng Chen7Xidian UniversityXidian UniversityMonash UniversityMonash UniversityUniversity of WollongongUniversity of WollongongSoonchunhyang UniversityXidian UniversitySearchable encryption enables the data owner to outsource their data to the cloud server while retaining the search ability. Recently, some researchers proposed a variant of searchable encryption, named single-writer/multi-reader searchable encryption (SMSE), in which any authorized data user can perform a search query. That is, each document identifier is encrypted using attribute-based encryption (ABE), such that an arbitrary authorized user whose attributes match the corresponding access policy can access the document. However, the cloud server cannot determine whether the user has the ability to decrypt the matched data. Thus, it has to response all the search results to the data user, which causes a heavy communication and computation cost. To cope with this problem, we present a novel SMSE scheme based on server-side match technique, where the cloud can filter the documents that cannot be decrypted by the user and only return the matched ones. In addition, the decryption is also efficient, independent with the access policy structure. Security and efficiency evaluation show that our proposed scheme can achieve the desired security goals, while dramatically reducing the communication and computation overhead.https://lib.jucs.org/article/22594/download/pdf/cloud computingsearchable encryptionmulti-clie |
| spellingShingle | Yunling Wang Jianfeng Wang Shi-Feng Sun Joseph Liu Willy Susilo Joonsang Baek Ilsun You Xiaofeng Chen Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption Journal of Universal Computer Science cloud computing searchable encryption multi-clie |
| title | Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption |
| title_full | Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption |
| title_fullStr | Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption |
| title_full_unstemmed | Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption |
| title_short | Towards Multi-user Searchable Encryption Supporting Boolean Query and Fast Decryption |
| title_sort | towards multi user searchable encryption supporting boolean query and fast decryption |
| topic | cloud computing searchable encryption multi-clie |
| url | https://lib.jucs.org/article/22594/download/pdf/ |
| work_keys_str_mv | AT yunlingwang towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT jianfengwang towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT shifengsun towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT josephliu towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT willysusilo towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT joonsangbaek towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT ilsunyou towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption AT xiaofengchen towardsmultiusersearchableencryptionsupportingbooleanqueryandfastdecryption |