Name
Abstract | ||
|---|---|---|
We present simpler and improved constructions of unbounded attribute-based encryption (ABE) schemes with constantsize public parameters under static assumptions in bilinear groups. Concretely, we obtain: a simple and adaptively secure unbounded ABE scheme in composite-order groups, improving upon a previous construction of Lewko and Waters (Eurocrypt '11) which only achieves selective security; an improved adaptively secure unbounded ABE scheme based on the k-linear assumption in prime-order groups with shorter ciphertexts and secret keys than those of Okamoto and Takashima (Asiacrypt '12); the first adaptively secure unbounded ABE scheme for arithmetic branching programs under static assumptions. At the core of all of these constructions is a "bilinear entropy expansion" lemma that allows us to generate any polynomial amount of entropy starting from constant-size public parameters; the entropy can then be used to transform existing adaptively secure "bounded" ABE schemes into unbounded ones. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-78381-9_19 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT I |
DocType | Volume | ISSN |
Conference | 10820 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| jie chen | 1 | 7 | 4.83 |
| Junqing Gong | 2 | 25 | 4.42 |
| Lucas Kowalczyk | 3 | 44 | 4.97 |
| Hoeteck Wee | 4 | 1613 | 86.36 |