Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 222-244 |
| Number of pages | 23 |
| Journal | Journal of Universal Computer Science |
| Volume | 25 |
| Issue number | 3 |
| Publication status | Published - 28 Mar 2019 |
Keywords
- Cloud computing
- Fast decryption
- Multi-client
- Searchable encryption
Cite this
}
Towards multi-user searchable encryption supporting Boolean query and fast decryption. / Wang, Yunling; Wang, Jianfeng; Sun, Shi-Feng; Liu, Joseph K.; Susilo, Willy; Baek, Joonsang; You, Ilsun; Chen, Xiaofeng.
In: Journal of Universal Computer Science, Vol. 25, No. 3, 28.03.2019, p. 222-244.Research output: Contribution to journal › Article › Research › peer-review
TY - JOUR
T1 - Towards multi-user searchable encryption supporting Boolean query and fast decryption
AU - Wang, Yunling
AU - Wang, Jianfeng
AU - Sun, Shi-Feng
AU - Liu, Joseph K.
AU - Susilo, Willy
AU - Baek, Joonsang
AU - You, Ilsun
AU - Chen, Xiaofeng
PY - 2019/3/28
Y1 - 2019/3/28
N2 - 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.
AB - 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.
KW - Cloud computing
KW - Fast decryption
KW - Multi-client
KW - Searchable encryption
UR - http://www.scopus.com/inward/record.url?scp=85069434294&partnerID=8YFLogxK
M3 - Article
VL - 25
SP - 222
EP - 244
JO - Journal of Universal Computer Science
JF - Journal of Universal Computer Science
SN - 0948-695X
IS - 3
ER -