Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings

Jian Weng; Robert H.  Deng; Shengli Liu; Kefei Chen; Junzuo Lai; Xuan Wang

Paper 2008/509 Original: eprint.iacr.org/2008/509 ↗

Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2009-05-04: last updated; 2008-12-02: published
Short URL: https://ia.cr/2008/509
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2008/509,
      author = {Jian Weng and Robert H.  Deng and Shengli Liu and Kefei Chen and Junzuo Lai and Xuan Wang},
      title = {Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/509},
      year = {2008},
      url = {https://eprint.iacr.org/2008/509}
}