Indexed by:
Abstract:
Attribute-based keyword search (ABKS), as an important type of searchable encryption, has been widely utilized for secure cloud storage. In a key-policy attribute-based temporary keyword search (KP-ABTKS) scheme, a private key is associated with an access policy that controls the search ability of the user, while a search token is associated with a time interval that controls the search time of the cloud server. However, after a careful study, we uncover that the only existing KP-ABTKS construction is not secure. Through two carefully designed attacks, we first show that the cloud server can search the ciphertext in any time. As a result, their scheme cannot support temporary keyword search. To address this problem, we present an enhanced KP-ABTKS scheme and prove that it is selectively secure against chosen-keyword attack in the random oracle model. The proposed scheme achieves both fine-grained search control and temporary keyword search simultaneously. In addition, the performance evaluation indicates that our scheme is practical.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
IEEE ACCESS
ISSN: 2169-3536
Year: 2020
Volume: 8
Page: 127845-127855
3 . 3 6 7
JCR@2020
3 . 4 0 0
JCR@2023
ESI Discipline: ENGINEERING;
ESI HC Threshold:132
JCR Journal Grade:2
CAS Journal Grade:2
Cited Count:
WoS CC Cited Count: 2
SCOPUS Cited Count: 5
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: