A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update
The revocable ciphertext-policy attribute-based encryption (R-CP-ABE) is an extension of ciphertext-policy attribute-based encryption (CP-ABE), which can realize user direct revocation and maintain a short revocation list. However, the revoked users can still decrypt the previously authorized encryp...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2020-01-01
|
Series: | Security and Communication Networks |
Online Access: | http://dx.doi.org/10.1155/2020/8856592 |
id |
doaj-55bc4a269edd4fe6a2d6ac9122e6492c |
---|---|
record_format |
Article |
spelling |
doaj-55bc4a269edd4fe6a2d6ac9122e6492c2021-01-04T00:00:07ZengHindawi-WileySecurity and Communication Networks1939-01222020-01-01202010.1155/2020/8856592A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext UpdateZhe Liu0Fuqun Wang1Kefei Chen2Fei Tang3Department of MathematicsDepartment of MathematicsDepartment of MathematicsSchool of Cyber Security and Information LawThe revocable ciphertext-policy attribute-based encryption (R-CP-ABE) is an extension of ciphertext-policy attribute-based encryption (CP-ABE), which can realize user direct revocation and maintain a short revocation list. However, the revoked users can still decrypt the previously authorized encrypted data with their old key. The R-CP-ABE scheme should provide a mechanism to protect the encrypted data confidentiality by disqualifying the revoked users from accessing the previously encrypted data. Motivated by practical needs, we propose a new user R-CP-ABE scheme that simultaneously supports user direct revocation, short revocation list, and ciphertext update by incorporating the identity-based and time-based revocable technique. The scheme provides a strongly selective security proof under the modified decisional q-parallel bilinear Diffie–Hellman Exponent problem, where “strongly” means that the adversary can query the secret key of a user whose attribute set satisfies the challenge ciphertext access structure and whose identity is in the revocation list.http://dx.doi.org/10.1155/2020/8856592 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Zhe Liu Fuqun Wang Kefei Chen Fei Tang |
spellingShingle |
Zhe Liu Fuqun Wang Kefei Chen Fei Tang A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update Security and Communication Networks |
author_facet |
Zhe Liu Fuqun Wang Kefei Chen Fei Tang |
author_sort |
Zhe Liu |
title |
A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update |
title_short |
A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update |
title_full |
A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update |
title_fullStr |
A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update |
title_full_unstemmed |
A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update |
title_sort |
new user revocable ciphertext-policy attribute-based encryption with ciphertext update |
publisher |
Hindawi-Wiley |
series |
Security and Communication Networks |
issn |
1939-0122 |
publishDate |
2020-01-01 |
description |
The revocable ciphertext-policy attribute-based encryption (R-CP-ABE) is an extension of ciphertext-policy attribute-based encryption (CP-ABE), which can realize user direct revocation and maintain a short revocation list. However, the revoked users can still decrypt the previously authorized encrypted data with their old key. The R-CP-ABE scheme should provide a mechanism to protect the encrypted data confidentiality by disqualifying the revoked users from accessing the previously encrypted data. Motivated by practical needs, we propose a new user R-CP-ABE scheme that simultaneously supports user direct revocation, short revocation list, and ciphertext update by incorporating the identity-based and time-based revocable technique. The scheme provides a strongly selective security proof under the modified decisional q-parallel bilinear Diffie–Hellman Exponent problem, where “strongly” means that the adversary can query the secret key of a user whose attribute set satisfies the challenge ciphertext access structure and whose identity is in the revocation list. |
url |
http://dx.doi.org/10.1155/2020/8856592 |
work_keys_str_mv |
AT zheliu anewuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT fuqunwang anewuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT kefeichen anewuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT feitang anewuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT zheliu newuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT fuqunwang newuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT kefeichen newuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate AT feitang newuserrevocableciphertextpolicyattributebasedencryptionwithciphertextupdate |
_version_ |
1714959820114624512 |