Efficient (Hierarchical) inner-product encryption tightly reduced from the decisional linear assumption

Tatsuaki Okamoto*, Katsuyuki Takashima

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

Abstract

This paper proposes an inner-product encryption (IPE) scheme, which achieves selectively fully-attribute-hiding security in the standard model almost tightly reduced from the decisional linear (DLIN) assumption, and whose ciphertext is almost the shortest among the existing (weakly/fully) attribute-hiding IPE schemes, i.e., it consists of n + 4 elements of G and 1 element of Gr for a prime-order symmetric bilinear group (G, Gr), where n is the dimension of attribute/predicate vectors. We also present a variant of the proposed IPE scheme that enjoys shorter public and secret keys with preserving the security. A hierarchical IPE (HIPE) scheme can be realized that has short ciphertexts and selectively fully-attribute-hiding security almost tightly reduced from the DLIN assumption.

Original languageEnglish
Pages (from-to)42-52
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE96-A
Issue number1
DOIs
Publication statusPublished - 2013 Jan
Externally publishedYes

Keywords

  • Attribute-hiding
  • Functional encryption
  • Inner-product encryption
  • Short ciphertexts/secret-keys
  • Tight security reduction

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Efficient (Hierarchical) inner-product encryption tightly reduced from the decisional linear assumption'. Together they form a unique fingerprint.

Cite this