Name
Abstract | ||
|---|---|---|
We present compact attribute-based encryption (ABE) schemes for NC1 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 |
|---|---|---|
2019 | 10.1007/978-3-030-17653-2_1 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT I |
Field | DocType | Volume |
Discrete mathematics,Open problem,Polynomial,Computer science,Attribute-based encryption,Theoretical computer science,Encryption,Ciphertext,Public-key cryptography | Conference | 11476 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucas Kowalczyk | 1 | 44 | 4.97 |
| Hoeteck Wee | 2 | 1613 | 86.36 |