An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
| Autor: | Chandrasekaran Pandu Rangan, Arinjita Paul, S. Sharmila Deva Selvi |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
021110 strategic
defence & security studies Cryptographic primitive Theoretical computer science business.industry Computer science 0211 other engineering and technologies Cryptography 02 engineering and technology Proxy re-encryption Random oracle Public-key cryptography Pairing Ciphertext 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Key escrow |
| Zdroj: | Provable Security ISBN: 9783319686363 ProvSec |
| DOI: | 10.1007/978-3-319-68637-0_25 |
| Popis: | Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] 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 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. 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|