[Resource Topic] 2008/509: Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings

Welcome to the resource topic for 2008/509

Title:
Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings

Authors: Jian Weng, Robert H. Deng, Shengli Liu, Kefei Chen, Junzuo Lai, Xuan Wang

Abstract:

Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the same message intended for Bob. 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 bidirectional PRE 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 propose a bidirectional PRE scheme with chosen-ciphertext security. The proposed scheme is fairly efficient due to two distinguished features: (i) it does not use the costly bilinear pairings; (ii) the computational cost and the ciphertext length decrease with re-encryption.

ePrint: https://eprint.iacr.org/2008/509

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .