Fully secure functional encryption with general relations from the decisional linear assumption

Tatsuaki Okamoto; Katsuyuki Takashima

doi:10.1007/978-3-642-14623-7_11

Fully secure functional encryption with general relations from the decisional linear assumption

Tatsuaki Okamoto^*, Katsuyuki Takashima

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

376 Citations (Scopus)

Abstract

This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.

Original language	English
Title of host publication	Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings
Pages	191-208
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-14623-7_11
Publication status	Published - 2010
Externally published	Yes
Event	30th Annual International Cryptology Conference, CRYPTO 2010 - Santa Barbara, CA, United States Duration: 2010 Aug 15 → 2010 Aug 19

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6223 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	30th Annual International Cryptology Conference, CRYPTO 2010
Country/Territory	United States
City	Santa Barbara, CA
Period	10/8/15 → 10/8/19

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-14623-7_11

Cite this

Okamoto, T., & Takashima, K. (2010). Fully secure functional encryption with general relations from the decisional linear assumption. In Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings (pp. 191-208). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6223 LNCS). https://doi.org/10.1007/978-3-642-14623-7_11

Fully secure functional encryption with general relations from the decisional linear assumption. / Okamoto, Tatsuaki; Takashima, Katsuyuki.
Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings. 2010. p. 191-208 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6223 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Okamoto, T & Takashima, K 2010, Fully secure functional encryption with general relations from the decisional linear assumption. in Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6223 LNCS, pp. 191-208, 30th Annual International Cryptology Conference, CRYPTO 2010, Santa Barbara, CA, United States, 10/8/15. https://doi.org/10.1007/978-3-642-14623-7_11

Okamoto T, Takashima K. Fully secure functional encryption with general relations from the decisional linear assumption. In Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings. 2010. p. 191-208. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-14623-7_11

Okamoto, Tatsuaki ; Takashima, Katsuyuki. / Fully secure functional encryption with general relations from the decisional linear assumption. Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings. 2010. pp. 191-208 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{246b68225a0d42a3b3e7e8e072ac223a,

title = "Fully secure functional encryption with general relations from the decisional linear assumption",

abstract = "This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.",

author = "Tatsuaki Okamoto and Katsuyuki Takashima",

year = "2010",

doi = "10.1007/978-3-642-14623-7_11",

language = "English",

isbn = "3642146228",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "191--208",

booktitle = "Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings",

note = "30th Annual International Cryptology Conference, CRYPTO 2010 ; Conference date: 15-08-2010 Through 19-08-2010",

}

TY - GEN

T1 - Fully secure functional encryption with general relations from the decisional linear assumption

AU - Okamoto, Tatsuaki

AU - Takashima, Katsuyuki

PY - 2010

Y1 - 2010

N2 - This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.

AB - This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.

UR - http://www.scopus.com/inward/record.url?scp=77957011503&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957011503&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14623-7_11

DO - 10.1007/978-3-642-14623-7_11

M3 - Conference contribution

AN - SCOPUS:77957011503

SN - 3642146228

SN - 9783642146220

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 191

EP - 208

BT - Advances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings

T2 - 30th Annual International Cryptology Conference, CRYPTO 2010

Y2 - 15 August 2010 through 19 August 2010

ER -

Fully secure functional encryption with general relations from the decisional linear assumption

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this