Publication Type

Journal Article

Version

Postprint

Publication Date

12-2010

Abstract

Proxy re-encryption realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob. Proxy re-encryption is a very useful primitive, having many applications in distributed file systems, outsourced filtering of encrypted spam, access control over network storage, and so on. Lately, Weng et al. proposed the first unidirectional proxy re-encryption scheme without using bilinear pairs. However, Weng et al.'s construction does not possess collusion resilience, in the sense that a coalition of the proxy and the delegatee can recover the delegator's private key. This is a serious weakness, since a user's private key should be strictly not revealed in any case. In this work, we present a scheme solving this problem, based on Weng et al.'s construction. We further extend our scheme to address several drawbacks inherent in virtually all existing proxy re-encryption schemes.

Keywords

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

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

Information Sciences

Volume

180

Issue

24

First Page

5077

Last Page

5089

ISSN

0020-0255

Identifier

10.1016/j.ins.2010.08.017

Publisher

Elsevier

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1016/j.ins.2010.08.017

Share

COinS