You are looking at a specific version 20170528:184010 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Minor revision. The 1st IEEE International Workshop on Big Data and IoT Security in Smart Computing - IEEE BITS 2017
Keywords
public-key cryptographyattribute-based encryptiondirect chosen-ciphertext securitytwin Diffie-Hellman
Contact author(s)
anada @ sun ac jp
History
2018-05-29: last of 4 revisions
2017-05-28: received
See all versions
Short URL
https://ia.cr/2017/469
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.