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

Frontiers of Information Technology & Electronic Engineering

Efficient hierarchical identity based encryption scheme in the standard model over lattices

Fenghe Wang, Chunxiao Wang, Zhenhua Liu

Published Aug 1, 2016• 5 citations
Publisher

Abstract

Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption (HIBE) scheme in the standard model whose public key size is only ( dm 2 + mn ) log q bits and whose message-ciphertext expansion factor is only log q , where d is the maximum hierarchical depth and ( n , m , q ) are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2 d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is (2 dm 2 + mn + m ) log q . To reduce the message-ciphertext expansion factor of the proposed scheme to log q , the encryption algorithm of this scheme is built based on Gentry’s encryption scheme, by which m 2 bits of plaintext are encrypted into m 2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.

DOI
10.1631/fitee.1500219

Related papers

Full Secure Identity-Based Encryption Scheme over Lattices in the Standard Model

Wang Jizhong, Wang Chunxiao

Using a known lattice-based chosen plain-text secure encryption scheme and the Bonsai trees primitive, a identity-based encryption (IBE) scheme is proposed in this paper. A public matrices chosen rule that has been used in a known efficient lattice-based chosen ciphtertext secure encryption scheme is used in this paper to reduce the public key size and the message-to ciphtertext expanse factor. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Since a new public key chosen rule is used in our design scheme, the public key size of the proposed scheme would be short. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)•Nov 1, 2015•3 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

Adaptively Secure Efficient (H)IBE over Ideal Lattice with Short Parameters

Yuan Zhang, Yuan Liu, Yurong Guo +2 more

Identity-based encryption (IBE), and its hierarchical extension (HIBE), are interesting cryptographic primitives that aim at the implicit authentication on the users' public keys by using users' identities directly. During the past several decades, numerous elegant pairing-based (H)IBE schemes were proposed. However, most pairing-related security assumptions suffer from known quantum algorithmic attacks. Therefore, the construction of lattice-based (H)IBE became one of the hot directions in recent years. In the setting of most existing lattice-based (H)IBE schemes, each bit of a user's identity is always associated with a parameter matrix. This always leads to drastic but unfavorable increases in the sizes of the system public parameters. To overcome this issue, we propose a flexible trade-off mechanism between the size of the public parameters and the involved computational cost using the blocking technique. More specifically, we divide an identity into l' segments and associate each segment with a matrix, while increasing the lattice modulo slightly for maintaining the same security level. As a result, for the setting of 160-bit identities, we show that the size of the public parameters can be reduced by almost 89.7% (resp. 93.8%) while increasing the computational cost by merely 5.2% (resp. 12.25%) when l' is a set of 16 (resp. 8). Finally, our IBE scheme is extended to an HIBE scheme, and both of them are proved to achieve the indistinguishability of ciphertexts against adaptively chosen identity and chosen plaintext attack (IND-ID-CPA) in the standard model, assuming that the well-known ring learning with error (RLWE) problem over the involved ideal lattices is intractable, even in the post-quantum era.

Entropy•Nov 2, 2020•6 citations

Full secure identity-based encryption scheme over lattices for wireless sensor networks in the standard model

Chunxiao Wang, Jizhong Wang

This paper proposes a lattice-based identity-based encryption scheme which can be used in wireless sensor networks to achieve secure communication. More precisely, a known lattice-based chosen plain-text secure encryption scheme and the bonsai trees primitive are used to design an identity-based encryption (IBE) scheme in this paper. To reduce the public key size of the proposed IBE scheme, a public matrices chosen rule is used in this paper which reduces the public key size of proposed scheme to be close to half of that of a known lattice-based scheme. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.

International Journal of High Performance Computing and Networking•Jan 1, 2018•6 citations

Efficient Lattice based (H)IB-DRE

Kunwar Pal Singh

In CCS'04, Diament etc al. presented special kind of public key encryption called Dual Receiver Encryption (DRE).In DRE, sender encrypts the plaintext using public keys of two independent receivers.Both independent receivers can decrypt the ciphertext into the same plaintext using their own private keys.This new cryptography primitive has applications in construction of complete nonmalleability and plaintext-awareness public key encryption, for a secure management of data that is to be disseminated to distributed processors, for ubiquitous and mobile computing applications.Daode Zhang et.al. constructed lattice-based IB-DRE scheme which is secure against stronger security notion i.e. adaptive-ID.We present hierarchical identity based dual encryption (HIB-DRE) scheme under LWE assumption.To the best of our knowledge, this gives the first provably secure HIB-DRE scheme in the lattice based setting.Independent work by Naccache[1] and Chatterjee -Sarkar[2] presented a variant of Waters's identity based encryption scheme to reduce Public Parameters.They have considered an identity of l-bits as l chunks where size of each chunk is l/l .This reduces the Public Parameter (PP) size from l to l n × m matrices.This idea was named as blocking technique [3].We have used blocking technique to reduce the size of PP.Daode Zhang et.al.[4] presented adaptive secure IB-DRE scheme.This scheme[4] contains l + 1, n × m matrices as PPs, where l denotes the number of the bits in identity.Using blocking technique we have reduced the size of PP by around factor β .Because of this the size of prime number q in field Z q is increased by 2 β which results in increase in computation cost.We have shown that compared to Daode Zhang et.al.scheme the size of the PP can be decreased approximately by 80% and the time complexity is increased by only 1.40% for a suitably chosen β .

Journal of Wireless Mobile Networks Ubiquitous Computing and Dependable Applications•Dec 30, 2022•0 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
Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption (HIBE) scheme in the standard model whose public key size is only ( dm 2 + mn ) log q bits and whose message-ciphertext expansion factor is only log q , where d is the maximum hierarchical depth and ( n , m , q ) are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2 d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is (2 dm 2 + mn + m ) log q . To reduce the message-ciphertext expansion factor of the proposed scheme to log q , the encryption algorithm of this scheme is built based on Gentry’s encryption scheme, by which m 2 bits of plaintext are encrypted into m 2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.
Using a known lattice-based chosen plain-text secure encryption scheme and the Bonsai trees primitive, a identity-based encryption (IBE) scheme is proposed in this paper. A public matrices chosen rule that has been used in a known efficient lattice-based chosen ciphtertext secure encryption scheme is used in this paper to reduce the public key size and the message-to ciphtertext expanse factor. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Since a new public key chosen rule is used in our design scheme, the public key size of the proposed scheme would be short. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.
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.
Identity-based encryption (IBE), and its hierarchical extension (HIBE), are interesting cryptographic primitives that aim at the implicit authentication on the users' public keys by using users' identities directly. During the past several decades, numerous elegant pairing-based (H)IBE schemes were proposed. However, most pairing-related security assumptions suffer from known quantum algorithmic attacks. Therefore, the construction of lattice-based (H)IBE became one of the hot directions in recent years. In the setting of most existing lattice-based (H)IBE schemes, each bit of a user's identity is always associated with a parameter matrix. This always leads to drastic but unfavorable increases in the sizes of the system public parameters. To overcome this issue, we propose a flexible trade-off mechanism between the size of the public parameters and the involved computational cost using the blocking technique. More specifically, we divide an identity into l' segments and associate each segment with a matrix, while increasing the lattice modulo slightly for maintaining the same security level. As a result, for the setting of 160-bit identities, we show that the size of the public parameters can be reduced by almost 89.7% (resp. 93.8%) while increasing the computational cost by merely 5.2% (resp. 12.25%) when l' is a set of 16 (resp. 8). Finally, our IBE scheme is extended to an HIBE scheme, and both of them are proved to achieve the indistinguishability of ciphertexts against adaptively chosen identity and chosen plaintext attack (IND-ID-CPA) in the standard model, assuming that the well-known ring learning with error (RLWE) problem over the involved ideal lattices is intractable, even in the post-quantum era.
This paper proposes a lattice-based identity-based encryption scheme which can be used in wireless sensor networks to achieve secure communication. More precisely, a known lattice-based chosen plain-text secure encryption scheme and the bonsai trees primitive are used to design an identity-based encryption (IBE) scheme in this paper. To reduce the public key size of the proposed IBE scheme, a public matrices chosen rule is used in this paper which reduces the public key size of proposed scheme to be close to half of that of a known lattice-based scheme. Under the hardness of the decision variant of the learning with errors (LWE) problem, we prove that the proposed IBE scheme is indistinguishable against the adaptive chosen identities and chosen-plaintext attack in the standard model. Moreover, the message-to-ciphtertext expanse factor of this scheme is also controlled efficiently which is nearly closed to that of Gentry's scheme. Due to the quantum intractability of the LWE problem on which the scheme is based, the proposed IBE scheme is secure even in quantum-era.
In CCS'04, Diament etc al. presented special kind of public key encryption called Dual Receiver Encryption (DRE).In DRE, sender encrypts the plaintext using public keys of two independent receivers.Both independent receivers can decrypt the ciphertext into the same plaintext using their own private keys.This new cryptography primitive has applications in construction of complete nonmalleability and plaintext-awareness public key encryption, for a secure management of data that is to be disseminated to distributed processors, for ubiquitous and mobile computing applications.Daode Zhang et.al. constructed lattice-based IB-DRE scheme which is secure against stronger security notion i.e. adaptive-ID.We present hierarchical identity based dual encryption (HIB-DRE) scheme under LWE assumption.To the best of our knowledge, this gives the first provably secure HIB-DRE scheme in the lattice based setting.Independent work by Naccache[1] and Chatterjee -Sarkar[2] presented a variant of Waters's identity based encryption scheme to reduce Public Parameters.They have considered an identity of l-bits as l chunks where size of each chunk is l/l .This reduces the Public Parameter (PP) size from l to l n × m matrices.This idea was named as blocking technique [3].We have used blocking technique to reduce the size of PP.Daode Zhang et.al.[4] presented adaptive secure IB-DRE scheme.This scheme[4] contains l + 1, n × m matrices as PPs, where l denotes the number of the bits in identity.Using blocking technique we have reduced the size of PP by around factor β .Because of this the size of prime number q in field Z q is increased by 2 β which results in increase in computation cost.We have shown that compared to Daode Zhang et.al.scheme the size of the PP can be decreased approximately by 80% and the time complexity is increased by only 1.40% for a suitably chosen β .
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.