Efficient Conditional Proxy Re-Encryption with Chosen-Ciphertext Security
Conference Proceeding Article
Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus is more useful in many applications. In this paper, based on a careful observation on the existing definitions and security notions for C-PRE, we re-formalize more rigorous definition and security notions for C-PRE. We further propose a more efficient C-PRE scheme, and prove its chosen-ciphertext security under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model. In addition, we point out that a recent C-PRE scheme fails to achieve the chosen-ciphertext security.
Conditional proxy re-encryption, chosen-ciphertext security, random oracle
Information Security: 12th International Conference, ISC 2009, Pisa, Italy, September 7-9, 2009: Proceedings
City or Country
WENG, Jian; YANG, Yanjiang; TANG, Qiang; and DENG, Robert H..
Efficient Conditional Proxy Re-Encryption with Chosen-Ciphertext Security. (2009). Information Security: 12th International Conference, ISC 2009, Pisa, Italy, September 7-9, 2009: Proceedings. 5735, 151-166. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/476