Chosen-Ciphertext Secure Proxy Re-Encryption without Pairing
Conference Proceeding Article
In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into a ciphertext intended for Bob, without learning the underlying plaintext. Proxy re-encryption has found many practical applications, such as encrypted email forwarding, secure distributed file systems, and outsourced filtering of encrypted spam. In ACM CCS'07, Canetti and Hohenberger presented a proxy re-encryption scheme with chosen-ciphertext security, and left an important open problem to construct a chosen-ciphertext secure proxy re-encryption scheme without pairings. In this paper, we solve this open problem by proposing a new proxy re-encryption scheme without resort to bilinear pairings. Based on the computational Diffie-Hellman (CDH) problem, the chosen-ciphertext security of the proposed scheme is proved in the random oracle model.
Proxy re-encryption, bilinear pairing, chosen-ciphertext security
Information Security and Trust
Cryptology and Network Security: 7th International Conference, CANS 2008, Hong-Kong, December 2-4: Proceedings
DENG, Robert H.; Weng, Jian; LIU, Shengli; and CHEN, Kefei.
Chosen-Ciphertext Secure Proxy Re-Encryption without Pairing. (2008). Cryptology and Network Security: 7th International Conference, CANS 2008, Hong-Kong, December 2-4: Proceedings. 5339, 1-17. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/295