Cryptology ePrint Archive: Report 2017/768

An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing

S.Sharmila Deva Selvi and 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.

Category / Keywords: public-key cryptography / Proxy Re-Encryption, Pairing-less, Public Key, Certificateless, Unidirectional.

Original Publication (with major differences): The 11th International Conference on Provable Security (ProvSec 2017)

Date: received 9 Aug 2017

Contact author: arinjita paul at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170812:072706 (All versions of this report)

Short URL: ia.cr/2017/768

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]