Paper 2018/696

Unbounded Inner Product Functional Encryption from Bilinear Maps

Junichi Tomida and Katsuyuki Takashima

Abstract

Inner product functional encryption (IPFE), introduced by Abdalla et al. (PKC2015), is a kind of functional encryption supporting only inner product functionality. All previous IPFE schemes are bounded schemes, meaning that the vector length that can be handled in the scheme is fixed in the setup phase. In this paper, we propose the first unbounded IPFE schemes, in which we do not have to fix the lengths of vectors in the setup phase and can handle (a priori) unbounded polynomial lengths of vectors. Our first scheme is private-key based and fully function hiding. That is, secret keys hide the information of the associated function. Our second scheme is public-key based and provides adaptive security in the indistinguishability based security definition. Both our schemes are based on SXDH, which is a well-studied standard assumption, and secure in the standard model. Furthermore, our schemes are quite efficient, incurring an efficiency loss by only a small constant factor from previous bounded function hiding schemes.

Note: fixing a citation error

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in ASIACRYPT 2018
Keywords
functional encryptioninner productfunction hidingunboundedbilinear maps
Contact author(s)
tomida junichi @ lab ntt co jp
History
2018-09-10: last of 2 revisions
2018-07-20: received
See all versions
Short URL
https://ia.cr/2018/696
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/696,
      author = {Junichi Tomida and Katsuyuki Takashima},
      title = {Unbounded Inner Product Functional Encryption from Bilinear Maps},
      howpublished = {Cryptology ePrint Archive, Paper 2018/696},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/696}},
      url = {https://eprint.iacr.org/2018/696}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.