Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program

Identity-based proxy re-encryption (IBPRE) is a powerful cryptographic tool for various applications, such as access control system, secure data sharing, and secure e-mail forwarding. Most of the existing efficient IBPRE schemes are based on the Diffie-Hellman assumption, and they only focus on the...

Full description

Bibliographic Details
Main Authors: Zengpeng Li, Chunguang Ma, Ding Wang
Format: Article
Language:English
Published: IEEE 2017-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8012380/
id doaj-9ef26b687202409487d895c4c5393491
record_format Article
spelling doaj-9ef26b687202409487d895c4c53934912021-03-29T20:05:40ZengIEEEIEEE Access2169-35362017-01-015162141622810.1109/ACCESS.2017.27407208012380Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching ProgramZengpeng Li0https://orcid.org/0000-0003-0758-7230Chunguang Ma1Ding Wang2College of Computer Sciences and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Sciences and Technology, Harbin Engineering University, Harbin, ChinaSchool of Electronics Engineering and Computer Science, Peking University, Beijing, ChinaIdentity-based proxy re-encryption (IBPRE) is a powerful cryptographic tool for various applications, such as access control system, secure data sharing, and secure e-mail forwarding. Most of the existing efficient IBPRE schemes are based on the Diffie-Hellman assumption, and they only focus on the single-hop construction. Based on the work of Chandran et al.'s lattice-based proxy re-encryption (PRE) scheme (PKC'14) and Yamada's lattice-based identity-based encryption (IBE) scheme (EUROCRYPT'16), in this paper, we first show the possibility of assembling lattice-based IBE into lattice-based PRE. Then, we present the construction of a new efficient single-hop homomorphic IBPRE from learning with errors (LWEs) via key homomorphic computation. Furthermore, using branching program (BP), we obtain an efficient multi-hop IBPRE scheme. To the best of our knowledge, our scheme is the first multi-hop homomorphic IBPRE scheme via BP. Our scheme supports homomorphic evaluation and is proved secure under the decisional LWE assumption.https://ieeexplore.ieee.org/document/8012380/Multi-hopidentity-based proxy re-encryptionkey switching mechanismhomomorphic evaluation
collection DOAJ
language English
format Article
sources DOAJ
author Zengpeng Li
Chunguang Ma
Ding Wang
spellingShingle Zengpeng Li
Chunguang Ma
Ding Wang
Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
IEEE Access
Multi-hop
identity-based proxy re-encryption
key switching mechanism
homomorphic evaluation
author_facet Zengpeng Li
Chunguang Ma
Ding Wang
author_sort Zengpeng Li
title Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
title_short Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
title_full Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
title_fullStr Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
title_full_unstemmed Towards Multi-Hop Homomorphic Identity-Based Proxy Re-Encryption via Branching Program
title_sort towards multi-hop homomorphic identity-based proxy re-encryption via branching program
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2017-01-01
description Identity-based proxy re-encryption (IBPRE) is a powerful cryptographic tool for various applications, such as access control system, secure data sharing, and secure e-mail forwarding. Most of the existing efficient IBPRE schemes are based on the Diffie-Hellman assumption, and they only focus on the single-hop construction. Based on the work of Chandran et al.'s lattice-based proxy re-encryption (PRE) scheme (PKC'14) and Yamada's lattice-based identity-based encryption (IBE) scheme (EUROCRYPT'16), in this paper, we first show the possibility of assembling lattice-based IBE into lattice-based PRE. Then, we present the construction of a new efficient single-hop homomorphic IBPRE from learning with errors (LWEs) via key homomorphic computation. Furthermore, using branching program (BP), we obtain an efficient multi-hop IBPRE scheme. To the best of our knowledge, our scheme is the first multi-hop homomorphic IBPRE scheme via BP. Our scheme supports homomorphic evaluation and is proved secure under the decisional LWE assumption.
topic Multi-hop
identity-based proxy re-encryption
key switching mechanism
homomorphic evaluation
url https://ieeexplore.ieee.org/document/8012380/
work_keys_str_mv AT zengpengli towardsmultihophomomorphicidentitybasedproxyreencryptionviabranchingprogram
AT chunguangma towardsmultihophomomorphicidentitybasedproxyreencryptionviabranchingprogram
AT dingwang towardsmultihophomomorphicidentitybasedproxyreencryptionviabranchingprogram
_version_ 1724195330172387328