Cryptology ePrint Archive: Report 2017/469

Short CCA-Secure Ciphertext-Policy Attribute-Based Encryption

Hiroaki Anada and Seiko Arita

Abstract: We propose a technique of individually modifying an attribute-based encryption scheme (ABE) that is secure against chosen-plaintext attacks (CPA) into an ABE scheme that is secure against chosen-ciphertext attacks (CCA) in the standard model. We demonstrate the technique in the case of the Waters ciphertext-policy ABE (CP-ABE). Our technique is helpful when a Diffie-Hellman tuple to be verified is in the terminal group of a bilinear map. We utilize the Twin Diffie-Hellman Trapdoor Test of Cash, Kiltz and Shoup, and it results in expansion of secret key length and decryption cost of computation by a factor of four, whereas public key length, ciphertext length and encryption cost of computation remain almost the same. In the case that the size of attribute sets are small, those lengths and costs are smaller than those of the CP-ABE obtained via the generic transformation of Yamada et al. in PKC 2011.

Category / Keywords: public-key cryptography / public-key cryptography, attribute-based encryption, direct chosen-ciphertext security, twin Diffie-Hellman

Original Publication (with minor differences): The 1st IEEE International Workshop on Big Data and IoT Security in Smart Computing - IEEE BITS 2017

Date: received 25 May 2017

Contact author: anada at sun ac jp

Available format(s): PDF | BibTeX Citation

Version: 20170528:184010 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]