4.7 Article

Flexible attribute-based proxy re-encryption for efficient data sharing

Journal

INFORMATION SCIENCES
Volume 511, Issue -, Pages 94-113

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.09.052

Keywords

Data security; Cryptographic access control; Access policy flexibility; Proxy re-encryption; Attribute-based encryption

Funding

  1. National Natural Science Foundation of China [61902123, 61972058, 61872130, 61772191, 61702028, 61772538, 61672083, 61532021, 61300217, 91646203]
  2. Science and Technology Key Projects of Hunan Province [2015TP1004, 2016JC2012, 2018TP1009]
  3. Science and Technology Key Projects of Changsha City [kq1801008, kq1804008]
  4. National Key Research and Development Program of China [2017YFB0902900, 2017YFB0802500]
  5. National Cryptography Development Fund [MMJJ20170106]
  6. Aeronautical Science Foundation of China [2017ZC51038]
  7. Foundation of Science and Technology on Information Assurance Laboratory [61421120305162112006]

Ask authors/readers for more resources

An increasing number of people are sharing their data through third-party platforms. Attribute-based encryption (ABE) is a promising primitive that allows enforcing fine-grained access control on the data to be shared. An issue in ABE is that a priori access policies should be determined during the system setup or encryption phase, but these policies will become obsolete over time. Another issue is that the decryption of ABE generally requires complicated and expensive computations, which may be unaffordable for resource-limited users (e.g., mobile-device users). To address these issues, we propose a new paradigm called hybrid attribute-based proxy re-encryption (HAPRE). In HAPRE, a semitrusted proxy can be authorized to convert ciphertexts of an ABE scheme into ciphertexts of an identity-based encryption (IBE) scheme without letting the proxy know the underlying messages. With these features, HAPRE enables resource-limited users to efficiently access the data previously encrypted by ABE. We construct two HAPRE schemes by utilizing a compact IBE scheme and a key rerandomization technique, and then we prove that the schemes are semantically secure and collusion resistant. Theoretical and experimental analyses demonstrate the efficiency of the HAPRE schemes. (C) 2019 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available