Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption

Tatsuaki Okamoto, Katsuyuki Takashima*

*この研究の対応する著者

研究成果: Article査読

2 被引用数 (Scopus)

抄録

This paper presents a fully secure (adaptively secure) practical functional encryption scheme for a large class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a standard assumption, the decisional linear assumption, in the standard model. Our scheme is constructed on the concept of dual pairing vector spaces and a hierarchical reduction technique on this concept is employed for the security proof. The proposed functional encryption scheme covers, as special cases, (1) key-policy, ciphertext-policy and unified-policy attribute-based encryption with non-monotone access structures, (2) (hierarchical) attribute-hiding functional encryption with inner-product relations and functional encryption with nonzero inner-product relations and (3) spatial encryption and a more general class of encryption than spatial encryption.

本文言語English
ページ(範囲)1491-1573
ページ数83
ジャーナルJournal of Cryptology
32
4
DOI
出版ステータスPublished - 2019 10 1
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ サイエンスの応用
  • 応用数学

フィンガープリント

「Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル