Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free