Publication Type

Conference Proceeding Article

Publication Date

6-2011

Abstract

In ciphertext-policy attributed-based encryption (CP-ABE), each ciphertext is labeled by the encryptor with an access structure (also called ciphertext policy) and each private key is associated with a set of attributes. A user should be able to decrypt a ciphertext if and only if his private key attributes satisfy the access structure.The traditional security property of CP-ABE is plaintext privacy, which ciphertexts reveal no information about the underlying plaintext. At ACNS’08, Nishide, Yoneyama and Ohta introduced the notion of ciphertext-policy hiding CP-ABE. In addition to protecting the privacy of plaintexts, ciphertext-policy hiding CP-ABE also protects the description of the access structures associated with ciphertexts. They observed that ciphertext-policy hiding CP-ABE can be constructed from attribute-hiding inner-product predicate encryption (PE), and presented two constructions of ciphertext-policy hiding CP-ABE supporting restricted access structures, which can be expressed as AND gates on multi-valued attributes with wildcards. However, their schemes were only proven selectively secure.In this paper, we first describe the construction of ciphertext-policy hiding CP-ABE from attribute-hiding inner-product PE formally. Then, we propose a concrete construction of ciphertext-policy hiding CP-ABE supporting the same access structure as that of Nishide, Yoneyama and Ohta, but our scheme is proven fully secure.

Keywords

Ciphertext Policy Attribute-Based Encryption, Predicate Encryption, Dual System Encryption

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Information Security Practice and Experience: 7th International Conference, ISPEC 2011, Guangzhou, China, May 30 - June 1: Proceedings

Volume

6672

First Page

24

Last Page

39

ISBN

9783642210310

Identifier

10.1007/978-3-642-21031-0_3

Publisher

Springer Verlag

City or Country

Heidelberg

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1007/978-3-642-21031-0_3

Comments

Lecture Notes in Computer Science, 2011, Volume 6672/2011, 24-39

Share

COinS