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

Idealizing Identity-Based Encryption

Dennis Hofheinz, Christian Matt, Ueli M. Maurer

Published Jan 1, 2015• 8 citations
Publisher
DOI
10.1007/978-3-662-48797-6_21

Related papers

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

Identity-based leveled fully homomorphic encryption over ideal lattices

Weili Wang, Bin Hu, Xiufeng Zhao

This paper proposes an efficient identity-based leveled fully homomorphic encryption (IBFHE) scheme over ideal lattice. First, we achieve an identity-based encryption (IBE) scheme in dual-LWE cryptosystem. Then, we take advantage of the eigenvector method to compile the IBE scheme into an IBFHE scheme. Compared with the previous scheme, our scheme is of shorter key size, smaller storage, and higher efficiency, owing to a new trapdoor generation function and algebraic structure of ideal lattice. The security analysis shows that our scheme is selective-identity secure against chosen-plaintext attacks in the standard model.

IEEE International Conference on Big Data Analysis (ICBDA)•Mar 1, 2017•2 citations

Identity-Based Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation

Efficient Identity-based Encryption Scheme over Ideal Lattice

WEI Lihao,AI Jieqing,LIU Shenghan

Recently,Identity-based Encryption(IBE) scheme based on lattices becomes one of the focuses of cryptographic research.But the IBE scheme based on standard lattice have large key size and high ciphertext expansion rate.So based on ideal lattices,this paper presents an efficient identity-based encryption scheme with small key size and low ciphertext expansion rate.The proposed scheme uses a method that combines the NTRU digital signature and the dual encryption based on ideal lattices.It is provably secure in the random oracle model.Analysis results show that the public key and the private key of key generation center contain one ring element and four ring elements respectively.The decryption key of each user is comprised of two ring elements.The ciphertext contains only two ring elements and the ciphertext expansion rate is a small constant.The encryption and decryption require four and two multiplications in the polynomial ring.Hence,the IBE scheme is more computationally efficient than that of traditional number theory based IBE scheme.

•Jul 1, 2016•0 citations

On the Power of Hierarchical Identity-Based Encryption

Mohammad Mahmoody, Ameer Mohammed

Lecture notes in computer science•Jan 1, 2016•11 citations

Universally Composable Identity-Based Encryption

Ryo Nishimaki, Y. MANABE, T. OKAMOTO

Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e. g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relations among them have been clarified recently. This paper, for the first time, investigates the security of IBE in the universally composable (UC) framework. This paper first defines the UC-security of IBE, i. e., we define the ideal functionality of IBE, FIBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2008•4 citations
This paper proposes an efficient identity-based leveled fully homomorphic encryption (IBFHE) scheme over ideal lattice. First, we achieve an identity-based encryption (IBE) scheme in dual-LWE cryptosystem. Then, we take advantage of the eigenvector method to compile the IBE scheme into an IBFHE scheme. Compared with the previous scheme, our scheme is of shorter key size, smaller storage, and higher efficiency, owing to a new trapdoor generation function and algebraic structure of ideal lattice. The security analysis shows that our scheme is selective-identity secure against chosen-plaintext attacks in the standard model.
Recently,Identity-based Encryption(IBE) scheme based on lattices becomes one of the focuses of cryptographic research.But the IBE scheme based on standard lattice have large key size and high ciphertext expansion rate.So based on ideal lattices,this paper presents an efficient identity-based encryption scheme with small key size and low ciphertext expansion rate.The proposed scheme uses a method that combines the NTRU digital signature and the dual encryption based on ideal lattices.It is provably secure in the random oracle model.Analysis results show that the public key and the private key of key generation center contain one ring element and four ring elements respectively.The decryption key of each user is comprised of two ring elements.The ciphertext contains only two ring elements and the ciphertext expansion rate is a small constant.The encryption and decryption require four and two multiplications in the polynomial ring.Hence,the IBE scheme is more computationally efficient than that of traditional number theory based IBE scheme.
Identity-based encryption (IBE) is one of the most important primitives in cryptography, and various security notions of IBE (e. g., IND-ID-CCA2, NM-ID-CCA2, IND-sID-CPA etc.) have been introduced. The relations among them have been clarified recently. This paper, for the first time, investigates the security of IBE in the universally composable (UC) framework. This paper first defines the UC-security of IBE, i. e., we define the ideal functionality of IBE, FIBE. We then show that UC-secure IBE is equivalent to conventionally-secure (IND-ID-CCA2-secure) IBE.