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

Lecture notes in computer science

Identity-Based Encryption from Lattices Using Approximate Trapdoors

Malika Izabachène, Lucas Prabel, Adeline Roux-Langlois

Published Jan 1, 2023• 8 citations
Publisher
DOI
10.1007/978-3-031-35486-1_13

Related papers

Lattice-based group encryptions with only one trapdoor

Jing Pan, Jiang Zhang, Fangguo Zhang +2 more

Science China Information Sciences•Mar 16, 2022•3 citations

A Survey on Identity-Based Encryption from Lattices

Goichiro Hanaoka, Shota Yamada

Mathematics for industry•Jul 25, 2017•4 citations

HIBE Scheme Based on Programmable Hash Function on Lattices

YE Qing, WANG Mingming, TANG Yongli, QIN Panke, WANG Yongjun

To address the computational complexity of trapdoor generation of Hierarchical Identity-Based Encryption(HIBE) scheme on lattices under the standard mode,this paper proposes a HIBE scheme based on programmable hash function.First,the trapdoor is generated by MP12 trapdoor function.Then,the master public key,the master private key and the ciphertext are obtained by programmable hash function.Experimental results show that compared with the HIBE scheme with fixed dimension under the standard mode,the computational complexity of trapdoor generation of this method is significantly diminished,and the length of the main public key is reduced to O(logbn),which can satisfy the INDr-aID-CPA security.

•Jan 1, 2020•0 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

Towards Compact Identity-Based Encryption on Ideal Lattices

Huiwen Jia, Yupu Hu, Chunming Tang +1 more

Lecture notes in computer science•Jan 1, 2024•7 citations

A Compact Multi-Identity Fully Homomorphic Encryption Scheme Without Fresh Ciphertexts

Ziwei Wang, Ruwei Huang, Xiyi Wei

The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.

Applied Sciences•Jan 6, 2025•2 citations
To address the computational complexity of trapdoor generation of Hierarchical Identity-Based Encryption(HIBE) scheme on lattices under the standard mode,this paper proposes a HIBE scheme based on programmable hash function.First,the trapdoor is generated by MP12 trapdoor function.Then,the master public key,the master private key and the ciphertext are obtained by programmable hash function.Experimental results show that compared with the HIBE scheme with fixed dimension under the standard mode,the computational complexity of trapdoor generation of this method is significantly diminished,and the length of the main public key is reduced to O(logbn),which can satisfy the INDr-aID-CPA security.
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.
The lattice-based multi-identity fully homomorphic encryption scheme combines the quantum security of lattice cryptography with the advantage of identity-based encryption. However, existing schemes face challenges such as large key sizes, inefficient ciphertext expansion processes, and reliance on outdated trapdoor designs, limiting their compactness and practicality. In this study, we propose a novel Compact Multi-Identity Fully Homomorphic Encryption Scheme (WZ-MIBFHE) that eliminates the need for fresh ciphertexts during expansion. First, we construct a compact identity-based encryption scheme by combining the YJW23 trapdoor and ABB10 under the standard model, proving its IND-sID-CPA security. The scheme is then adapted to ensure correctness and security when integrated with the decomposition method for ciphertext expansion. This adaptation also utilizes approximation errors to reduce overall noise. Finally, we expand the modified IBE scheme’s ciphertext using the decomposition method to construct the WZ-MIBFHE scheme. Compared to existing methods, WZ-MIBFHE reduces the lattice dimension to nlogq+logbq, improves public and private key sizes, and significantly lowers ciphertext expansion rates by removing the need for fresh ciphertexts. These improvements enhance both the compactness and efficiency of the scheme, making it a promising solution for multi-identity homomorphic encryption.