TY - GEN
T1 - Practical ciphertext-policy attribute-based encryption
T2 - 13th International Conference on Applied Cryptography and Network Security, ACNS 2015
AU - Liu, Zhen
AU - Wong, Duncan S.
PY - 2015
Y1 - 2015
N2 - In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), a user’s decryption key is associated with attributes which in general are not related to the user’s identity, and the same set of attributes could be shared between multiple users. From the decryption key, if the user created a decryption blackbox for sale, this malicious user could be difficult to identify from the blackbox. Hence in practice, a useful CPABE scheme should have some tracing mechanism to identify this ‘traitor’ from the blackbox. In addition, being able to revoke compromised keys is also an important step towards practicality, and for scalability, the scheme should support an exponentially large number of attributes. However, none of the existing traceable CP-ABE schemes simultaneously supports revocation and large attribute universe. In this paper, we construct the first practical CP-ABE which possesses these three important properties: (1) blackbox traceability, (2) revocation, and (3) supporting large universe. This new scheme achieves the fully collusion-resistant blackbox traceability, and when compared with the latest fully collusionresistant blackbox traceable CP-ABE schemes, this new scheme achieves the same efficiency level, enjoying the sub-linear overhead of O(√ N), where N is the number of users in the system, and attains the same security level, namely, the fully collusion-resistant traceability against policyspecific decryption blackbox, which is proven in the standard model with selective adversaries. The scheme supports large attribute universe, and attributes do not need to be pre-specified during the system setup. In addition, the scheme supports revocation while keeping the appealing capability of conventional CP-ABE, i.e. it is highly expressive and can take any monotonic access structures as ciphertext policies.
AB - In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), a user’s decryption key is associated with attributes which in general are not related to the user’s identity, and the same set of attributes could be shared between multiple users. From the decryption key, if the user created a decryption blackbox for sale, this malicious user could be difficult to identify from the blackbox. Hence in practice, a useful CPABE scheme should have some tracing mechanism to identify this ‘traitor’ from the blackbox. In addition, being able to revoke compromised keys is also an important step towards practicality, and for scalability, the scheme should support an exponentially large number of attributes. However, none of the existing traceable CP-ABE schemes simultaneously supports revocation and large attribute universe. In this paper, we construct the first practical CP-ABE which possesses these three important properties: (1) blackbox traceability, (2) revocation, and (3) supporting large universe. This new scheme achieves the fully collusion-resistant blackbox traceability, and when compared with the latest fully collusionresistant blackbox traceable CP-ABE schemes, this new scheme achieves the same efficiency level, enjoying the sub-linear overhead of O(√ N), where N is the number of users in the system, and attains the same security level, namely, the fully collusion-resistant traceability against policyspecific decryption blackbox, which is proven in the standard model with selective adversaries. The scheme supports large attribute universe, and attributes do not need to be pre-specified during the system setup. In addition, the scheme supports revocation while keeping the appealing capability of conventional CP-ABE, i.e. it is highly expressive and can take any monotonic access structures as ciphertext policies.
KW - Attribute-based encryption
KW - Ciphertext-policy
KW - Large attribute universe
KW - Revocation
KW - Traitor tracing
UR - https://www.scopus.com/pages/publications/84955272408
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84955272408&origin=recordpage
U2 - 10.1007/978-3-319-28166-7_7
DO - 10.1007/978-3-319-28166-7_7
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783319281650
VL - 9092
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 127
EP - 146
BT - Applied Cryptography and Network Security
A2 - Malkin, Tal
A2 - Lewko, Allison Bishop
A2 - Kolesnikov, Vladimir
A2 - Polychronakis, Michalis
PB - Springer Verlag
Y2 - 2 June 2015 through 5 June 2015
ER -