Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps

Fei TANG; Hongda LI; Jinyong CHANG

doi:10.1587/transfun.E98.A.762

Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps

Fei TANG, Hongda LI, Jinyong CHANG

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.2 pp.762-766

Publication Date: 2015/02/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.762

Type of Manuscript: LETTER

Category: Cryptography and Information Security

Authors

Fei TANG
  Institute of Information Engineering of Chinese Academy of Sciences,Data Assurance and Communication Security Research Center of Chinese Academy of Sciences,University of Chinese Academy Sciences
Hongda LI
  Institute of Information Engineering of Chinese Academy of Sciences,Data Assurance and Communication Security Research Center of Chinese Academy of Sciences
Jinyong CHANG
  Institute of Information Engineering of Chinese Academy of Sciences

Keyword

proxy re-encryption, multi-hop, multilinear maps

Cite this

Copy

Fei TANG, Hongda LI, Jinyong CHANG, "Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 2, pp. 762-766, February 2015, doi: 10.1587/transfun.E98.A.762.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.762/_p

Copy

@ARTICLE{e98-a_2_762,
author={Fei TANG, Hongda LI, Jinyong CHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps},
year={2015},
volume={E98-A},
number={2},
pages={762-766},
abstract={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.},
keywords={},
doi={10.1587/transfun.E98.A.762},
ISSN={1745-1337},
month={February},}

Copy

TY - JOUR
TI - Multi-Hop Unidirectional Proxy Re-Encryption from Multilinear Maps
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 762
EP - 766
AU - Fei TANG
AU - Hongda LI
AU - Jinyong CHANG
PY - 2015
DO - 10.1587/transfun.E98.A.762
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
AB - 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.
ER -