Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Adaptive-ID Secure Revocable Identity-Based Encryption from Lattices via Subset Difference Method.

Shantian Cheng, Juanyang Zhang

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

Abstract. In view of the expiration or reveal of user’s private credential (or private key) in a real-istic scenario, identity-based encryption (IBE) schemes with an efficient key revocation mechanism, or for short, revocable identity-based encryption (RIBE) schemes, become prominently significant. In this paper, we present an RIBE scheme from lattices by combining two Agrawal et al.’s IBE schemes with the subset difference (SD) method. Our scheme is secure against adaptive identity-time attacks in the standard model under the learning with errors (LWE) assumption. In particular, our scheme serves as one solution to the challenge posed by Chen et al. (ACISP ’12). 1

Related papers

Revocable Identity-Based Encryption Scheme Under LWE Assumption in the Standard Model

Yaling Zhang, Shangping Wang, Qing Du

A revocable identity-based encryption (IBE) scheme under learning with error (LWE) assumption from lattice is proposed; compared with the existing IBE schemes from lattices, two improvements are available in the new scheme. First, the revocation mechanism for identity of user (or thing) is added in the new scheme to manage the dynamic user (or thing) identity in the system, and making the IBE scheme from lattice becomes more practical than ever before. Second, the security of the new scheme is based on the LWE assumption from lattice, so our construction has a solid secure foundation. The scheme is proved to be secured against adaptive-ID attacks under LWE assumption from lattice in the standard model.

IEEE Access•Jan 1, 2018•3 citations

Revocable Identity-Based Encryption from Lattices.

Jie Chen, Hoon Wei Lim, San Ling +2 more

Abstract. In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices. Moreover, our key revocation techniques from lattices can be applied to obtain revocable functional encryption schemes in the similar setting.

•Jan 1, 2011•0 citations

Adaptively Secure Lattice-based Revocable IBE in the QROM: Compact Parameters, Tight Security, and Anonymity.

Atsushi Takayasu

Revocable identity-based encryption (RIBE) is an extension of IBE that satisfies a key revocation mechanism to manage a number of users dynamically and efficiently. To resist quantum attacks, two adaptively secure lattice-based RIBE schemes are known in the (quantum) random oracle model ((Q)ROM). Wang et al.’s scheme that is secure in the ROM has large secret keys depending on the depth of a binary tree and its security reduction is not tight. Ma and Lin’s scheme that is secure in the QROM has large ciphertexts depending on the length of identities and is not anonymous. In this paper, we propose an adaptively secure lattice-based RIBE scheme that is secure in the QROM. Our scheme has compact parameters, where the ciphertext-size is smaller than Wang et al.’s scheme and the secret key size is the same as Ma and Lin’s scheme. Moreover, our scheme is anonymous and its security reduction is completely tight. We design the proposed scheme by modifying Ma–Lin’s scheme instantiated by the Gentry–Peikert–Vaikuntanathan (GPV) IBE. We can obtain the advantages of our scheme by making use of Katsumata et al.’s proof technique of the GPV IBE in the QROM.

•Jan 1, 2021•0 citations

Full secure identity-based encryption scheme with short public key size over lattices in the standard model

Fenghe Wang, Zhenhua Liu, Chunxiao Wang

An efficient identity-based encryption (IBE) scheme over lattice is proposed in this paper. Under the hardness of the learning with errors (LWE) problem, the proposed scheme is semantic secure against adaptive chosen identity and chosen plaintext attack in the standard model. To improve the efficiency of the lattice-based IBE scheme, unlike the identity string is encoded into a matrix by a group of public matrices in several known constructions, the identity string of l bits is encoded into a vector with the help of l+1 vectors in this paper. With the help of this idea, we achieve the private key extraction of IBE scheme at the same lattice. Then, the public key of the proposed scheme only consists of one n×m matrix and l+1 vectors, compared with that the public keys of the known lattice-based IBE schemes all consist as a group of n×m matrices. Hence, the public key size of this scheme is shorter than that of the known constructions.

International Journal of Computer Mathematics•Mar 16, 2015•20 citations

Revocable IBE with Decryption Key Exposure Resistance from NTRU Lattice

Dandan Zhang, Shanqiang Feng, Fengyin Li

Revocable identity-based encryption (RIBE) adds a key revocation mechanism to traditional identity-based encryption (IBE), enabling dynamic key management for key management or key expiration. To mitigate the damage to the confidentiality of all ciphertexts from short-term decryption key leakage, decryption key exposure resistance is proposed for RIBE, protecting other time periods’ ciphertexts. However, lots of high dimensional public key matrices and long ciphertexts are applied in lattice-based RIBE schemes with DKER, which leads to high computational overhead and high communication overhead. By replacing short basis trapdoor with NTRU trapdoor, revocable IBE with decryption key exposure resistance from NTRU lattice is proposed, which reduces the dimensions of public key matrices and shortens ciphertexts, thereby achieving higher efficiency. Additionally, under the RLWE assumption, RIBE with DKER from NTRU lattice is proved to be selective identity secure in the standard model.

International Conference on Enterprise Systems (ES)•Apr 12, 2025•0 citations

An efficient lattice-based integrated revocable identity-based encryption

Haodong Huang, Juyan Li, Shujun Bi +1 more

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.

Scientific Reports•May 14, 2025•3 citations
Abstract. In view of the expiration or reveal of user’s private credential (or private key) in a real-istic scenario, identity-based encryption (IBE) schemes with an efficient key revocation mechanism, or for short, revocable identity-based encryption (RIBE) schemes, become prominently significant. In this paper, we present an RIBE scheme from lattices by combining two Agrawal et al.’s IBE schemes with the subset difference (SD) method. Our scheme is secure against adaptive identity-time attacks in the standard model under the learning with errors (LWE) assumption. In particular, our scheme serves as one solution to the challenge posed by Chen et al. (ACISP ’12). 1
A revocable identity-based encryption (IBE) scheme under learning with error (LWE) assumption from lattice is proposed; compared with the existing IBE schemes from lattices, two improvements are available in the new scheme. First, the revocation mechanism for identity of user (or thing) is added in the new scheme to manage the dynamic user (or thing) identity in the system, and making the IBE scheme from lattice becomes more practical than ever before. Second, the security of the new scheme is based on the LWE assumption from lattice, so our construction has a solid secure foundation. The scheme is proved to be secured against adaptive-ID attacks under LWE assumption from lattice in the standard model.
Abstract. In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices. Moreover, our key revocation techniques from lattices can be applied to obtain revocable functional encryption schemes in the similar setting.
Revocable identity-based encryption (RIBE) is an extension of IBE that satisfies a key revocation mechanism to manage a number of users dynamically and efficiently. To resist quantum attacks, two adaptively secure lattice-based RIBE schemes are known in the (quantum) random oracle model ((Q)ROM). Wang et al.’s scheme that is secure in the ROM has large secret keys depending on the depth of a binary tree and its security reduction is not tight. Ma and Lin’s scheme that is secure in the QROM has large ciphertexts depending on the length of identities and is not anonymous. In this paper, we propose an adaptively secure lattice-based RIBE scheme that is secure in the QROM. Our scheme has compact parameters, where the ciphertext-size is smaller than Wang et al.’s scheme and the secret key size is the same as Ma and Lin’s scheme. Moreover, our scheme is anonymous and its security reduction is completely tight. We design the proposed scheme by modifying Ma–Lin’s scheme instantiated by the Gentry–Peikert–Vaikuntanathan (GPV) IBE. We can obtain the advantages of our scheme by making use of Katsumata et al.’s proof technique of the GPV IBE in the QROM.
An efficient identity-based encryption (IBE) scheme over lattice is proposed in this paper. Under the hardness of the learning with errors (LWE) problem, the proposed scheme is semantic secure against adaptive chosen identity and chosen plaintext attack in the standard model. To improve the efficiency of the lattice-based IBE scheme, unlike the identity string is encoded into a matrix by a group of public matrices in several known constructions, the identity string of l bits is encoded into a vector with the help of l+1 vectors in this paper. With the help of this idea, we achieve the private key extraction of IBE scheme at the same lattice. Then, the public key of the proposed scheme only consists of one n×m matrix and l+1 vectors, compared with that the public keys of the known lattice-based IBE schemes all consist as a group of n×m matrices. Hence, the public key size of this scheme is shorter than that of the known constructions.
Revocable identity-based encryption (RIBE) adds a key revocation mechanism to traditional identity-based encryption (IBE), enabling dynamic key management for key management or key expiration. To mitigate the damage to the confidentiality of all ciphertexts from short-term decryption key leakage, decryption key exposure resistance is proposed for RIBE, protecting other time periods’ ciphertexts. However, lots of high dimensional public key matrices and long ciphertexts are applied in lattice-based RIBE schemes with DKER, which leads to high computational overhead and high communication overhead. By replacing short basis trapdoor with NTRU trapdoor, revocable IBE with decryption key exposure resistance from NTRU lattice is proposed, which reduces the dimensions of public key matrices and shortens ciphertexts, thereby achieving higher efficiency. Additionally, under the RLWE assumption, RIBE with DKER from NTRU lattice is proved to be selective identity secure in the standard model.
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.