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

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

Lattice-Based Dynamical and Anonymous Broadcast Encryption Scheme

Wang Fenghe, Wang Xuan, Wang Chunxiao

Published Nov 1, 2015• 4 citations
Publisher

Abstract

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).

DOI
10.1109/3pgcic.2015.35

Related papers

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

A New Identity-Based Broadcast Encryption Scheme over Lattice

Xiaoyuan Yang

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.

Beijing Youdian Xueyuan xuebao•Jan 1, 2012•0 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

Forward-Secure Identity-based Broadcast Encryption Scheme from Lattice

Xinwen Zhang, Shangping Wang, Wenpeng Zhang

Motivated by an identity-based broadcast encryption scheme from lattice(1) and a forward-secure identity-based encryption scheme(2), we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encrypt ion scheme and forward-security scheme, that is, it is forward-secure for the secret keys used previously, and we prove that it is semantic secure based on LWE (Learning With Error)assumption(3) in the random oracle model. In addition, our construction is believed to be secure against quantum computer.

Applied Mathematics & Information Sciences•Jan 1, 2015•3 citations

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

Efficient multi-receiver identity-based signcryption from lattice assumption

Xiaojun Zhang, Chunxiang Xu, Jingting Xue

Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.

International Journal of Electronic Security and Digital Forensics•Dec 19, 2017•16 citations
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).
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.
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.
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.
Motivated by an identity-based broadcast encryption scheme from lattice(1) and a forward-secure identity-based encryption scheme(2), we propose a forward-secure identity-based broadcast encryption scheme from lattice by adding the forward-security mechanism on broadcast encryption scheme. Our scheme satisfies the security requirements of both the broadcast encrypt ion scheme and forward-security scheme, that is, it is forward-secure for the secret keys used previously, and we prove that it is semantic secure based on LWE (Learning With Error)assumption(3) in the random oracle model. In addition, our construction is believed to be secure against quantum computer.
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.
Signcryption is a public-key cryptographic primitive which combines the functions of public-key encryption and digital signature into a single logical step at low computational and communication costs. While multi-receiver signcryption is suited for a situation where a sender wants to send a signcrypted message to multiple receivers in a confidential and authenticated way. Due to this attractive property, recently, multi-receiver signcryption plays an important role in some practical applications such as virtual conference as well as authenticated mail transferring. In this paper, we present an efficient multi-receiver identity-based signcryption (MIBSC) scheme from lattice assumption which is believed to resist quantum computer attacks. The proposed scheme is provably secure in the random oracle model, which has the indistinguishability against chosen ciphertext attacks under the hardness of learning with errors (LWE), and existentially unforgeability against chosen message attacks under the small integer solution assumption (SIS). Moreover, we also compare our MIBSC scheme with existing schemes from performance efficiency and security, the result shows that our proposed scheme is more efficient and more secure. In particular, our scheme can be properly applied in the post-quantum communication environments.