.png){kind=icon}
返回
Revocable attribute-based encryption from standard lattices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2022.103698.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Attribute-based encryption (ABE) is an attractive extension of public key encryption, which provides fine-grained and role-based access to encrypted data. In its key-policy flavor, the secret key is associated with an access policy and the ciphertext is marked with a set of attributes. In many practical applications, and in order to address scenarios where users become malicious or their secret keys are compromised, it is necessary to design an efficient revocation mechanism for ABE. However, prior works on revocable key-policy ABE schemes are based on classical number-theoretic assumptions, which are vulnerable to quantum attacks. In this work, we propose the first revocable key-policy ABE scheme that offers an efficient revocation mechanism while maintaining fine-grained access control to encrypted data. Our scheme is based on the learning with errors (LWE) problem, which is widely believed to be quantum-resistant. Our scheme supports polynomial -depth policy function and has short secret keys, where the size of the keys depends only on the depth of the supported policy function. Furthermore, we prove that our scheme satisfies selective revocation list security in the standard model under the LWE assumption.
Keyword:
Attribute-based encryption
Revocable mechanism
Lattices
Learning with errors
Revocable attribute-based encryption
期刊
C
IF:
3.1
论文数:
2.3K
被引数:
2.0K
机构
引用论文
Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage面向多权限云存储的可表达、高效、可撤销的数据访问控制
PREAI
分享收藏Two-Factor Data Access Control With Efficient Revocation for Multi-Authority Cloud Storage Systems.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容