Paper 2012/671

Fully Secure Unbounded Inner-Product and Attribute-Based Encryption

Tatsuaki Okamoto and Katsuyuki Takashima

Abstract

In this paper, we present the first inner-product encryption (IPE) schemes that are unbounded in the sense that the public parameters do not impose additional limitations on the predicates and attributes used for encryption and decryption keys. All previous IPE schemes were bounded, or have a bound on the size of predicates and attributes given public parameters fixed at setup. The proposed unbounded IPE schemes are fully (adaptively) secure and fully attribute-hiding in the standard model under a standard assumption, the decisional linear (DLIN) assumption. In our unbounded IPE schemes, the inner-product relation is generalized, where the two vectors of inner-product can be different sizes and it provides a great improvement of efficiency in many applications. We also present the first fully secure unbounded attribute-based encryption (ABE) schemes, and the security is proven under the DLIN assumption in the standard model. To achieve these results, we develop novel techniques, indexing and consistent randomness amplification, on the (extended) dual system encryption technique and the dual pairing vector spaces (DPVS).

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. This is a full version of a paper appearing in Asiacrypt 2012.
Keywords
functional encryptionattribute-based encryptionpredicate encryptionunboundedness
Contact author(s)
Takashima Katsuyuki @ aj mitsubishielectric co jp
History
2012-11-28: received
Short URL
https://ia.cr/2012/671
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/671,
      author = {Tatsuaki Okamoto and Katsuyuki Takashima},
      title = {Fully Secure Unbounded Inner-Product and Attribute-Based Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/671},
      year = {2012},
      url = {https://eprint.iacr.org/2012/671}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.