Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps

Fei TANG  Hongda LI  Jinyong CHANG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E98-A    No.2    pp.762-766
Publication Date: 2015/02/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E98.A.762
Type of Manuscript: LETTER
Category: Cryptography and Information Security
proxy re-encryption,  multi-hop,  multilinear maps,  

Full Text: PDF>>
Buy this Article

In a proxy re-encryption (PRE) scheme, a delegator gives a re-encryption key to a semi-trusted proxy, then the proxy can transform the delegator's ciphertexts into one that can be decrypted by a delegatee who is appointed by the delegator. The proxy cannot, however, learn anything about the encrypted messages. At CCS 2007, Canetti and Hohenberger left an interesting open problem of how to design a PRE scheme that is simultaneously unidirectional and multi-hop. This is a rather interesting problem since in some applications we may need this feature, such as in the scenario of email forwarding, a delegatee wants forward his emails that received from the delegator to another delegatee. In this work we design an unidirectional and multi-hop PRE scheme by using multilinear maps. A shortcoming of our scheme is that its security relies on some rather strong assumptions in the setting of multilinear groups.