期刊
IEEE ACCESS
卷 8, 期 -, 页码 93-103出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2961633
关键词
Searchable encryption; expressive keyword search; key-policy attribute-based encryption; prime-order group
资金
- National Natural Science Foundation of China [61772009, U173610004, 61972095]
- Natural Science Foundation of Jiangsu Province [BK20181304, BK20161511]
Public key encryption with keyword search (PEKS) allows a cloud server to retrieve particular ciphertexts without leaking the contents of the searched ciphertexts. This kind of cryptographic primitive gives users a special way to retrieve the encrypted documents they need while preserving privacy. Nevertheless, most existing PEKS schemes only offer single-keyword search or conjunctive-keyword search. The poorly expressive ability and constantly inaccurate search results make them hard to meet users' requirements. Although several expressive PEKS (EPEKS) schemes were proposed, they entail high computation and communication costs. An ideal EPEKS scheme should enable fast and accurate ciphertext retrieval, while lowering the storage server's load and reducing the amount of communication data. Drawing on the strongly expressive ability of key-policy attribute-based encryption (KP-ABE), we propose a generic construction of EPEKS from KP-ABE. We demonstrate that the derived EPEKS scheme is secure under the chosen keyword attack if the implicit KP-ABE scheme fulfills the anonymity under the chosen plaintext attack. Furthermore, we present a concrete EPEKS scheme over the prime-order groups. The comparison and experimental results indicate that our scheme is more efficient than the existing EPEKS schemes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据