Name
Abstract | ||
|---|---|---|
We revisit the method of designing public-key puncturable encryption schemes and present a generic conversion by leveraging the techniques of distributed key-distribution and revocable encryption. In particular, we first introduce a refined version of identity-based revocable encryption, named key-homomorphic identity-based revocable key encapsulation mechanism with extended correctness. Then, we propose a generic construction of puncturable key encapsulation mechanism from the former by merging the idea of distributed key-distribution. Compared to the state-of-the-art, our generic construction supports unbounded number of punctures and multiple tags per message, thus achieving more fine-grained revocation of decryption capability. Further, it does not rely on random oracles, not suffer from non-negligible correctness error, and results in a variety of efficient schemes with distinct features. More precisely, we obtain the first scheme with very compact ciphertexts in the standard model, and the first scheme with support for both unbounded size of tags per ciphertext and unbounded punctures as well as constant-time puncture operation. Moreover, we get a comparable scheme proven secure under the standard DBDH assumption, which enjoys both faster encryption and decryption than previous works based on the same assumption, especially when the number of tags associated with the ciphertext is large. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-45374-9_11 | IACR Cryptology ePrint Archive |
DocType | Volume | Citations |
Journal | 2020 | 2 |
PageRank | References | Authors |
0.36 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shifeng Sun | 1 | 59 | 15.53 |
| Amin Sakzad | 2 | 114 | 18.69 |
| Ron Steinfeld | 3 | 1065 | 72.74 |
| Joseph K. Liu | 4 | 99 | 17.73 |
| Dawu Gu | 5 | 644 | 103.50 |