Name
Abstract | ||
|---|---|---|
We present compact attribute-based encryption (ABE) schemes for $${\textsf {NC}}^{1}$$ that are adaptively secure under the k-Lin assumption with polynomial security loss. Our KP-ABE scheme achieves ciphertext size that is linear in the attribute length and independent of the policy size even in the many-use setting, and we achieve an analogous efficiency guarantee for CP-ABE. This resolves the central open problem posed by Lewko and Waters (CRYPTO 2011). Previous adaptively secure constructions either impose an attribute “one-use restriction” (or the ciphertext size grows with the policy size) or require q-type assumptions. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00145-019-09335-x | Journal of Cryptology |
Keywords | DocType | Volume |
Public-key cryptography, Attribute-based encryption | Journal | 33 |
Issue | ISSN | Citations |
3 | 0933-2790 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucas Kowalczyk | 1 | 44 | 4.97 |
| Hoeteck Wee | 2 | 1613 | 86.36 |