Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings

Nuttapong Attrapadung; Shota Yamada

Paper 2015/157

Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings

Nuttapong Attrapadung and Shota Yamada

Abstract

We show a generic conversion that converts an attribute based encryption (ABE) scheme for arbitrary predicate into an ABE scheme for its dual predicate. In particular, it can convert key-policy ABE (KP-ABE) into ciphertext-policy ABE (CP-ABE), and vice versa, for dually related predicates. It is generic in the sense that it can be applied to arbitrary predicates. On the other hand, it works only within the generic ABE framework recently proposed by Attrapadung (Eurocrypt'14), which provides a generic compiler that compiles a simple primitive called pair encodings into fully secure ABE. Inside this framework, Attrapadung proposed the first generic dual conversion that works only for subclass of encodings, namely, perfectly secure encodings. However, there are many predicates for which realizations of such encodings are not known, and hence the problems of constructing fully secure ABE for their dual predicates were left unsolved. In this paper, we revisit the dual conversion of Attrapadung, and show that, somewhat surprisingly, the very same conversion indeed also works for broader classes of encodings, namely, computationally secure encodings. Consequently, we thus solve the above open problems as we obtain the first fully secure realizations of completely-unbounded CP-ABE and CP-ABE with short keys for Boolean formulae, via applying the conversion to previously proposed KP-ABE. Moreover, we provide a generic conversion that converts ABE into its dual-policy variant. Dual-policy ABE (DP-ABE) conjunctively combines both KP-ABE and CP-ABE into one primitive, and hence can be useful in general-purpose applications. As for instantiations, we obtain the first realizations of fully secure DP-ABE for formulae, unbounded DP-ABE for formulae, and DP-ABE for regular languages. The latter two systems are the first to realize such functionalities, let alone are fully secure.

Note: Add concrete descriptions of instantiations for self-containment.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Minor revision. CT-RSA 2015
DOI: 10.1007/978-3-319-16715-2_5
Keywords: Attribute-based encryption Dual scheme conversion Key-policy Ciphertext-policy Dual-policy Full security Dual system encryption Pair Encoding Functional Encryption
Contact author(s): n attrapadung @ aist go jp
History: 2015-06-15: revised; 2015-02-27: received; See all versions
Short URL: https://ia.cr/2015/157
License: CC BY

BibTeX

@misc{cryptoeprint:2015/157,
      author = {Nuttapong Attrapadung and Shota Yamada},
      title = {Duality in {ABE}: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/157},
      year = {2015},
      doi = {10.1007/978-3-319-16715-2_5},
      url = {https://eprint.iacr.org/2015/157}
}