Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

Tatsuaki OKAMOTO; Katsuyuki TAKASHIMA

doi:10.1587/transfun.E99.A.92

Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

Tatsuaki OKAMOTO, Katsuyuki TAKASHIMA

Full Text Views

0

Share
Cite this

Summary :

This paper proposes the first (practical) inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz, Sahai and Waters), while the existing (practical) IPE schemes are either fully attribute-hiding but selectively secure or adaptively secure but weakly attribute-hiding. The proposed IPE scheme is proven to be adaptively secure and fully attribute-hiding under the decisional linear assumption in the standard model. The IPE scheme is comparably as efficient as the existing (practical) attribute-hiding IPE schemes. We also present a variant of the proposed IPE scheme with the same security that achieves shorter public and secret keys. A hierarchical IPE scheme can be constructed that is also adaptively secure and fully attribute-hiding under the same assumption. In this paper, we extend the dual system encryption technique by Waters into a more general manner, in which new forms of ciphertext and secret keys are employed and new types of information theoretical tricks are introduced along with several forms of computational reduction.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.1 pp.92-117

Publication Date: 2016/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E99.A.92

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category

Authors

Tatsuaki OKAMOTO
NTT Corporation
Katsuyuki TAKASHIMA
Mitsubishi Electric Corporation

Keyword

functional encryption, inner product encryption, attribute-hiding

Cite this

Copy

Tatsuaki OKAMOTO, Katsuyuki TAKASHIMA, "Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption" in IEICE TRANSACTIONS on Fundamentals, vol. E99-A, no. 1, pp. 92-117, January 2016, doi: 10.1587/transfun.E99.A.92.
Abstract: This paper proposes the first (practical) inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz, Sahai and Waters), while the existing (practical) IPE schemes are either fully attribute-hiding but selectively secure or adaptively secure but weakly attribute-hiding. The proposed IPE scheme is proven to be adaptively secure and fully attribute-hiding under the decisional linear assumption in the standard model. The IPE scheme is comparably as efficient as the existing (practical) attribute-hiding IPE schemes. We also present a variant of the proposed IPE scheme with the same security that achieves shorter public and secret keys. A hierarchical IPE scheme can be constructed that is also adaptively secure and fully attribute-hiding under the same assumption. In this paper, we extend the dual system encryption technique by Waters into a more general manner, in which new forms of ciphertext and secret keys are employed and new types of information theoretical tricks are introduced along with several forms of computational reduction.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.92/_p

Copy

@ARTICLE{e99-a_1_92,
author={Tatsuaki OKAMOTO, Katsuyuki TAKASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption},
year={2016},
volume={E99-A},
number={1},
pages={92-117},
abstract={This paper proposes the first (practical) inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz, Sahai and Waters), while the existing (practical) IPE schemes are either fully attribute-hiding but selectively secure or adaptively secure but weakly attribute-hiding. The proposed IPE scheme is proven to be adaptively secure and fully attribute-hiding under the decisional linear assumption in the standard model. The IPE scheme is comparably as efficient as the existing (practical) attribute-hiding IPE schemes. We also present a variant of the proposed IPE scheme with the same security that achieves shorter public and secret keys. A hierarchical IPE scheme can be constructed that is also adaptively secure and fully attribute-hiding under the same assumption. In this paper, we extend the dual system encryption technique by Waters into a more general manner, in which new forms of ciphertext and secret keys are employed and new types of information theoretical tricks are introduced along with several forms of computational reduction.},
keywords={},
doi={10.1587/transfun.E99.A.92},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 92
EP - 117
AU - Tatsuaki OKAMOTO
AU - Katsuyuki TAKASHIMA
PY - 2016
DO - 10.1587/transfun.E99.A.92
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2016
AB - This paper proposes the first (practical) inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz, Sahai and Waters), while the existing (practical) IPE schemes are either fully attribute-hiding but selectively secure or adaptively secure but weakly attribute-hiding. The proposed IPE scheme is proven to be adaptively secure and fully attribute-hiding under the decisional linear assumption in the standard model. The IPE scheme is comparably as efficient as the existing (practical) attribute-hiding IPE schemes. We also present a variant of the proposed IPE scheme with the same security that achieves shorter public and secret keys. A hierarchical IPE scheme can be constructed that is also adaptively secure and fully attribute-hiding under the same assumption. In this paper, we extend the dual system encryption technique by Waters into a more general manner, in which new forms of ciphertext and secret keys are employed and new types of information theoretical tricks are introduced along with several forms of computational reduction.
ER -