RL-ABE: A Revocable Lattice Attribute Based Encryption Scheme Based on R-LWE Problem in Cloud Storage

In this article, we propose a revocable lattice-based CP-ABE (Ciphertext-Policy Attribute-Based Encryption) scheme (RL-ABE), which is suitable to be applied in the cloud storage. The RL-ABE scheme can resist quantum algorithm attack and ensure fine-grained access control to the users' rights in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on services computing 2022-03, Vol.15 (2), p.1026-1035
Main Authors: Zhao, Siyu, Jiang, Rui, Bhargava, Bharat
Format: Article
Language:English
Subjects:
Access control
Algorithms
attribute revocation
Ciphertext-policy attribute-based encryption
Cloud computing
Cybersecurity
Encryption
lattice-based cryptosystem
Lattices
Machine learning
Permission
Resists
ring learning with error problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, we propose a revocable lattice-based CP-ABE (Ciphertext-Policy Attribute-Based Encryption) scheme (RL-ABE), which is suitable to be applied in the cloud storage. The RL-ABE scheme can resist quantum algorithm attack and ensure fine-grained access control to the users' rights in achieving shared data. In addition, our scheme can realize attribute revocation, which can expediently renew users' attributes to grant or revoke their access rights. Then, we formally prove the security of our scheme based on the hardness of Ring Learning with Error problem(R-LWE) to resist quantum algorithm attack, and prove our scheme can solve security threatens to withstand collusion attacks. Finally, the performance analysis shows the high efficiency of our scheme compared with other related schemes.
ISSN:1939-1374
1939-1374
2372-0204
DOI:10.1109/TSC.2020.2973256