A Provably-Secure Unidirectional Proxy Re-encryption Scheme Without Pairing in the Random Oracle Model

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

Abstract

Proxy re-encryption (PRE) enables delegation of decryption rights by entrusting a proxy server with special information, that allows it to transform a ciphertext under one public key into a ciphertext of the same message under a different public key, without learning anything about the underlying plaintext. In Africacrypt 2010, the first PKI-based collusion resistant CCA secure PRE scheme without pairing was proposed in the random oracle model. In this paper, we point out an important weakness in the security proof of the scheme. We also present a collusion-resistant pairing-free unidirectional PRE scheme which meets CCA security under a variant of the computational Diffie-Hellman hardness assumption in the random oracle model.

Cite

CITATION STYLE

APA

Sharmila Deva Selvi, S., Paul, A., & Pandurangan, C. (2018). A Provably-Secure Unidirectional Proxy Re-encryption Scheme Without Pairing in the Random Oracle Model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11261 LNCS, pp. 459–469). Springer Verlag. https://doi.org/10.1007/978-3-030-02641-7_21

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