TY - JOUR
T1 - A ciphertext-policy hidden vector encryption scheme supporting multiuser keyword search
AU - Zhenhua, Liao
AU - Jinmiao, Wang
AU - Bo, Lang
N1 - Publisher Copyright:
© 2014 John Wiley & Sons, Ltd.
PY - 2015/4/1
Y1 - 2015/4/1
N2 - In cloud computing, large amount of data can be effectively stored and managed. People could outsource the encrypted data using searchable encryption (SE) for data security and efficient retrieval. However, most existing SE schemes only support the single-user access, and multiuser searchable encryption is required in many enterprise applications. From the attribute-based encryption (ABE), we found that the flexibility and usability of encryption schemes can be greatly improved by embedding attribute-based access policy in the ciphertext. In this paper, by using the idea of ABE, we propose a ciphertext-policy hidden vector encryption (CPHVE) scheme to support both encryption and search operations for multiple users. In the scheme, a keyword is encrypted with an attribute-based access policy, which can be searched when the users' attributes satisfy the policy. The security of CPHVE is also defined and proved in this paper. Moreover, the CPHVE scheme is based on standard complexity assumptions on bilinear groups of prime order, thus it is more efficient than the existing schemes.
AB - In cloud computing, large amount of data can be effectively stored and managed. People could outsource the encrypted data using searchable encryption (SE) for data security and efficient retrieval. However, most existing SE schemes only support the single-user access, and multiuser searchable encryption is required in many enterprise applications. From the attribute-based encryption (ABE), we found that the flexibility and usability of encryption schemes can be greatly improved by embedding attribute-based access policy in the ciphertext. In this paper, by using the idea of ABE, we propose a ciphertext-policy hidden vector encryption (CPHVE) scheme to support both encryption and search operations for multiple users. In the scheme, a keyword is encrypted with an attribute-based access policy, which can be searched when the users' attributes satisfy the policy. The security of CPHVE is also defined and proved in this paper. Moreover, the CPHVE scheme is based on standard complexity assumptions on bilinear groups of prime order, thus it is more efficient than the existing schemes.
KW - Attribute-based encryption
KW - Cloud computing
KW - Hidden vector encryption
KW - Multiuser searchable encryption
KW - Search on encrypted data
UR - https://www.scopus.com/pages/publications/84924659810
U2 - 10.1002/sec.1044
DO - 10.1002/sec.1044
M3 - 文章
AN - SCOPUS:84924659810
SN - 1939-0114
VL - 8
SP - 879
EP - 887
JO - Security and Communication Networks
JF - Security and Communication Networks
IS - 6
ER -