Publication Type

Conference Proceeding Article

Publication Date

12-2008

Abstract

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.

Keywords

Proxy re-encryption, bilinear pairing, chosen-ciphertext security

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

Cryptology and Network Security: 7th International Conference, CANS 2008, Hong-Kong, December 2-4: Proceedings

Volume

5339

First Page

1

Last Page

17

ISBN

9783540896418

Identifier

10.1007/978-3-540-89641-8_1

Publisher

Springer Verlag

Additional URL

http://dx.doi.org/10.1007/978-3-540-89641-8_1

Download

Share

COinS