.png){kind=icon}
Return
An efficient lattice-based integrated revocable identity-based encryption
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-025-01254-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Revocable identity-based encryption (RIBE) enables data encryption without certificates and allows for the revocation of users, thereby offering a more streamlined and secure approach to dynamic member management. However, the existing revocation models lack strong scalability, rendering the RIBE scheme unsuitable for scenarios where the key generation center (KGC) experiences high workloads and users face heavy storage burdens. Therefore, this paper introduces an integrated revocation model that maintains both the workload for the KGC and the size of the secret keys at a constant level, while also relieving the encryptor of the burden of handling revocation information. By combining online and offline encryption, we construct an OO-IRIBE-EnDKER scheme from lattices, which possesses properties such as anonymity, decryption key exposure resistance (DKER), resistance to quantum computing attacks, and selective security. Finally, the effectiveness of the OO-IRIBE-EnDKER scheme is demonstrated through experimental results.
Keywords:
Lattice
RIBE
Anonymity
DKER
Journal
IF:
3.9
Papers:
28.1W
Citations:
83.5W
Organization
Cited Papers
.png){kind=icon}
ShareSave(Dual) server-aided revocable attribute-based encryption with decryption key exposure resistance
PREAI
ShareSave
ShareSaveShareSave
View more