Office of Research, Singapore Management Universit

B. Libert

C. Chu

C.P. Schnorr

D. Boneh

E. Fujisaki

F. Bao

G. Ateniese

J. Baek

M. Blaze

M. Green

M. Jakobsson

M. Mambo

P. Golle

R. Canetti

T. ElGamal

T. Matsuo

Crossref

Chosen-Ciphertext Secure Proxy Re-encryption without Pairings

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\u2707, 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

Jian Weng

Robert H.  Deng

Shengli Liu

Kefei Chen

Junzuo Lai

Xuan Wang

Cryptology ePrint Archive

Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings

DENG, Robert H.

Weng, Jian

LIU, Shengli

CHEN, Kefei

Institutional Knowledge at Singapore Management University

Chosen-Ciphertext Secure Proxy Re-Encryption without Pairing

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.3091

Chosen-Ciphertext Secure Proxy Re-Encryption without Pairing

Abstract

Similar works

Full text

Available Versions

Crossref

Cryptology ePrint Archive

Institutional Knowledge at Singapore Management University