Paper 2017/768
An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing
S. Sharmila Deva Selvi, Arinjita Paul, and C. Pandu Rangan
Abstract
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of certificateless public key cryptography which offers the advantage of identity-based cryptography without suffering from the key escrow problem. The existing certificateless PRE (CLPRE) schemes rely on costly bilinear pairing operations. In ACM ASIA-CCS SCC 2015, Srinivasan et al. proposed the first construction of a certificateless PRE scheme without resorting to pairing in the random oracle model. However, in this work, we demonstrate a flaw in the CCA-security proof of their scheme. Also, we present the first construction of a CLPRE scheme without pairing which meets CCA security under the computational Diffie-Hellman hardness assumption in the random oracle model.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Major revision. The 11th International Conference on Provable Security (ProvSec 2017)
- Keywords
- Proxy Re-EncryptionPairing-lessPublic KeyCertificatelessUnidirectional.
- Contact author(s)
- arinjita paul @ gmail com
- History
- 2017-08-12: received
- Short URL
- https://ia.cr/2017/768
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/768, author = {S. Sharmila Deva Selvi and Arinjita Paul and C. Pandu Rangan}, title = {An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/768}, year = {2017}, url = {https://eprint.iacr.org/2017/768} }