Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption

Allison Lewko; Tatsuaki Okamoto; Amit Sahai; Katsuyuki Takashima; Brent Waters

doi:10.1007/978-3-642-13190-5_4

Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption

Allison Lewko^*, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters

^*Corresponding author for this work

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

969 Citations (Scopus)

Abstract

We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions were only proven to be selectively secure. Both results use novel strategies to adapt the dual system encryption methodology introduced by Waters. We construct our ABE scheme in composite order bilinear groups, and prove its security from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.

Original language	English
Title of host publication	Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Pages	62-91
Number of pages	30
DOIs	https://doi.org/10.1007/978-3-642-13190-5_4
Publication status	Published - 2010
Externally published	Yes
Event	29th in the Series of EuropeanConferences on the Theory and Application of Cryptographic Techniques, Eurocrypt 2010 - French Riviera, France Duration: 2010 May 30 → 2010 Jun 3

Publication series

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

Conference

Conference	29th in the Series of EuropeanConferences on the Theory and Application of Cryptographic Techniques, Eurocrypt 2010
Country/Territory	France
City	French Riviera
Period	10/5/30 → 10/6/3

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-13190-5_4

Cite this

Lewko, A., Okamoto, T., Sahai, A., Takashima, K., & Waters, B. (2010). Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 62-91). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6110 LNCS). https://doi.org/10.1007/978-3-642-13190-5_4

Fully secure functional encryption : Attribute-based encryption and (hierarchical) inner product encryption. / Lewko, Allison; Okamoto, Tatsuaki; Sahai, Amit et al.

Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. 2010. p. 62-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6110 LNCS).

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

Lewko, A, Okamoto, T, Sahai, A, Takashima, K & Waters, B 2010, Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. in Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6110 LNCS, pp. 62-91, 29th in the Series of EuropeanConferences on the Theory and Application of Cryptographic Techniques, Eurocrypt 2010, French Riviera, France, 10/5/30. https://doi.org/10.1007/978-3-642-13190-5_4

Lewko A, Okamoto T, Sahai A, Takashima K, Waters B. Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. 2010. p. 62-91. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-13190-5_4

Lewko, Allison ; Okamoto, Tatsuaki ; Sahai, Amit et al. / Fully secure functional encryption : Attribute-based encryption and (hierarchical) inner product encryption. Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. 2010. pp. 62-91 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d656589b462347a6bb1c5f48a4837b29,

title = "Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption",

abstract = "We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions were only proven to be selectively secure. Both results use novel strategies to adapt the dual system encryption methodology introduced by Waters. We construct our ABE scheme in composite order bilinear groups, and prove its security from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.",

author = "Allison Lewko and Tatsuaki Okamoto and Amit Sahai and Katsuyuki Takashima and Brent Waters",

year = "2010",

doi = "10.1007/978-3-642-13190-5_4",

language = "English",

isbn = "3642131891",

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

pages = "62--91",

booktitle = "Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

note = "29th in the Series of EuropeanConferences on the Theory and Application of Cryptographic Techniques, Eurocrypt 2010 ; Conference date: 30-05-2010 Through 03-06-2010",

}

TY - GEN

T1 - Fully secure functional encryption

T2 - 29th in the Series of EuropeanConferences on the Theory and Application of Cryptographic Techniques, Eurocrypt 2010

AU - Lewko, Allison

AU - Okamoto, Tatsuaki

AU - Sahai, Amit

AU - Takashima, Katsuyuki

AU - Waters, Brent

PY - 2010

Y1 - 2010

N2 - We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions were only proven to be selectively secure. Both results use novel strategies to adapt the dual system encryption methodology introduced by Waters. We construct our ABE scheme in composite order bilinear groups, and prove its security from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.

AB - We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product predicates. In both cases, previous constructions were only proven to be selectively secure. Both results use novel strategies to adapt the dual system encryption methodology introduced by Waters. We construct our ABE scheme in composite order bilinear groups, and prove its security from three static assumptions. Our ABE scheme supports arbitrary monotone access formulas. Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.

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

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

U2 - 10.1007/978-3-642-13190-5_4

DO - 10.1007/978-3-642-13190-5_4

M3 - Conference contribution

AN - SCOPUS:77954635558

SN - 3642131891

SN - 9783642131899

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

SP - 62

EP - 91

BT - Advances in Cryptology - Eurocrypt 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

Y2 - 30 May 2010 through 3 June 2010

ER -

Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this