In this paper, 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.
CITATION STYLE
Lai, J., Huang, Z., Au, M. H., & Mao, X. (2018). Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10946 LNCS, pp. 805–812). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_49
Mendeley helps you to discover research relevant for your work.