Title | ||
---|---|---|
Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation. |
Abstract | ||
---|---|---|
In ACM CCS 2007, Canetti and Hohenberger left an open problem of how to construct a multi-hop unidirectional proxy re-encryption scheme secure against chosen-ciphertext attacks (CCA). To resolve this problem, we utilize the recent advances in indistinguishability obfuscation, overcome several obstacles and propose a multi-hop unidirectional proxy re-encryption scheme. The proposed scheme is proved to be CCA-secure in the standard model (i.e., without using the random oracle heuristic), and its ciphertext remains constant-size regardless of how many times it has been transformed. It is worth noting that, our techniques proposed in this paper can also be used to construct an identity-based multi-hop unidirectional PRE scheme with constant-size ciphertexts and CCA-security in the standard model. (C) 2020 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
---|---|---|
2020 | 10.1016/j.tcs.2020.09.031 | THEORETICAL COMPUTER SCIENCE |
Keywords | DocType | Volume |
Multi-hop,Unidirectional proxy re-encryption,Chosen-Ciphertext attack,Indistinguishability obfuscation | Journal | 847 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Junzuo Lai | 1 | 419 | 24.55 |
Zhengan Huang | 2 | 0 | 0.34 |
Man Ho Au | 3 | 1444 | 97.70 |
Xianping Mao | 4 | 86 | 3.47 |