Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation.
In: Theoretical Computer Science, Jg. 847 (2020-12-22), S. 1-16
Online
academicJournal
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. [ABSTRACT FROM AUTHOR]
Titel: |
Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation.
|
---|---|
Autor/in / Beteiligte Person: | Lai, Junzuo ; Huang, Zhengan ; Au, Man Ho ; Mao, Xianping |
Link: | |
Zeitschrift: | Theoretical Computer Science, Jg. 847 (2020-12-22), S. 1-16 |
Veröffentlichung: | 2020 |
Medientyp: | academicJournal |
ISSN: | 0304-3975 (print) |
DOI: | 10.1016/j.tcs.2020.09.031 |
Schlagwort: |
|
Sonstiges: |
|