Name
Abstract | ||
|---|---|---|
We present a new public key broadcast encryption scheme where both the ciphertext and secret keys consist of a constant number of group elements. Our result improves upon the work of Boneh, Gentry and Waters (Crypto'05) as well as several recent follow-ups (TCC'16A, Asiacrypt'16) in two ways: (i) we achieve adaptive security instead of selective security, and (ii) our construction relies on the decisional k-Linear Assumption in prime-order groups (as opposed to q-type assumptions or subgroup decisional assumptions in composite-order groups); our improvements come at the cost of a larger public key. Finally, we show that our scheme achieves adaptive security in the multi-ciphertext setting with a security loss that is independent of the number of challenge ciphertexts. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-98113-0_7 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 11035 | 0302-9743 |
Citations | PageRank | References |
1 | 0.40 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Romain Gay | 1 | 15 | 0.95 |
| Lucas Kowalczyk | 2 | 44 | 4.97 |
| Hoeteck Wee | 3 | 1613 | 86.36 |