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

Beijing Youdian Xueyuan xuebao

A New Identity-Based Broadcast Encryption Scheme over Lattice

Xiaoyuan Yang

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

To design a post-quantum secure broadcast encryption scheme,by using the bonsai trees model,an identity-based broadcast encryption scheme over lattice is proposed.The proposed scheme can avoid the decryption failure problem in the existing scheme.The new scheme is provable securied against chosen-plaintext attack where the security is reduced to the hardness of learning with errors in the standard model.Moreover the proposed scheme supports the dynamic expansion of client and deals with the setting of stateless receivers.

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

Lattice-Based Dynamical and Anonymous Broadcast Encryption Scheme

Wang Fenghe, Wang Xuan, Wang Chunxiao

This paper proposes a broadcast encryption scheme over lattice which is dynamical and anonymous simultaneously. The dynamic property means that the authorized user is not fixed in proposed scheme, and the broadcaster can send the message to any receiver without any added operation. The anonymous property means that the identity of an authorized receiver is protected efficiently, any outsider attacker would not find the chosen receiver's identity. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE).

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

Hierarchical Identity-based Broadcast Encryption Scheme on Lattices

Zhang Jinman, Chen Qin

In this paper, a hierarchical identity-based broadcast encryption scheme is proposed based on the learning with errors problem, which is a classic hard problem on lattices. In the proposed scheme, each user's identity is associated with a lattice matrix, then the relationship between the lattice and its sub lattice could easily represent the hierarchical identity construction. Short basis of a lattice can function as a private key of a user, so based on the Sample Basis algorithm the private key of each level's user can be derived. The security proof of our proposed scheme is also given in this paper, which is IND-CCA2 secure against the attacks by outsider users and FS-CCA secure against the attacks by authorized receivers. In addition, compared with the broadcast encryption scheme based on the bilinear mapping, the scheme in this paper is more efficient in the encryption and decryption.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2011•5 citations

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

Jizhong Wang, Chunxiao 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•5 citations

Lattice-based Dynamical and Anonymous Broadcast Encryption Scheme for Wireless Ad Hoc Networks

Fenghe Wang, Xu An Wang, Chunxiao Wang

A lattice-based broadcast encryption scheme is proposed for ad hoc networks in this paper. The proposed scheme is dynamical and anonymous simultaneously. The achievements of the dynamic and anonymity properties are efficient. In fact, the broadcaster can send the message to any receivers set without any added operations. The anonymity properties of the proposed scheme can protect the identity of an authorized receiver. Both dynamic and anonymity properties are important for broadcast encryption to used in many cases like wireless ad hoc network. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE). Compared with known lattice-based broadcast encryption schemes, the proposed scheme shares some advantages with respect to the ciphtertext length and the message-ciphtertext expanse factor.

Journal of Interconnection Networks•Sep 1, 2015•1 citation
To design a post-quantum secure broadcast encryption scheme,by using the bonsai trees model,an identity-based broadcast encryption scheme over lattice is proposed.The proposed scheme can avoid the decryption failure problem in the existing scheme.The new scheme is provable securied against chosen-plaintext attack where the security is reduced to the hardness of learning with errors in the standard model.Moreover the proposed scheme supports the dynamic expansion of client and deals with the setting of stateless receivers.
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.
This paper proposes a broadcast encryption scheme over lattice which is dynamical and anonymous simultaneously. The dynamic property means that the authorized user is not fixed in proposed scheme, and the broadcaster can send the message to any receiver without any added operation. The anonymous property means that the identity of an authorized receiver is protected efficiently, any outsider attacker would not find the chosen receiver's identity. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE).
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 this paper, a hierarchical identity-based broadcast encryption scheme is proposed based on the learning with errors problem, which is a classic hard problem on lattices. In the proposed scheme, each user's identity is associated with a lattice matrix, then the relationship between the lattice and its sub lattice could easily represent the hierarchical identity construction. Short basis of a lattice can function as a private key of a user, so based on the Sample Basis algorithm the private key of each level's user can be derived. The security proof of our proposed scheme is also given in this paper, which is IND-CCA2 secure against the attacks by outsider users and FS-CCA secure against the attacks by authorized receivers. In addition, compared with the broadcast encryption scheme based on the bilinear mapping, the scheme in this paper is more efficient in the encryption and decryption.
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.
A lattice-based broadcast encryption scheme is proposed for ad hoc networks in this paper. The proposed scheme is dynamical and anonymous simultaneously. The achievements of the dynamic and anonymity properties are efficient. In fact, the broadcaster can send the message to any receivers set without any added operations. The anonymity properties of the proposed scheme can protect the identity of an authorized receiver. Both dynamic and anonymity properties are important for broadcast encryption to used in many cases like wireless ad hoc network. The semantic security of the proposed scheme is proven in the standard model under the hardness of the learning with errors problem (LWE). Compared with known lattice-based broadcast encryption schemes, the proposed scheme shares some advantages with respect to the ciphtertext length and the message-ciphtertext expanse factor.