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

Applied Mathematics & Information Sciences

Forward-Secure Identity-based Broadcast Encryption Scheme from Lattice

Xinwen Zhang, Shangping Wang, Wenpeng Zhang

Published Jan 1, 2015• 3 citations
OpenAlex

Abstract

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.

Related papers

Lattice Based Forward-Secure Identity Based Encryption Scheme with Shorter Ciphertext

Kunwar Singh, C. Pandurangan, A. K. Banerjee

In MIST 2012 conference Singh et al [21] presented lattice based forward-secure identity based encryption schemes based on LWE assumption in the random oracle model as well as in the standard model. In this paper we propose lattice based forward-secure identity based encryption scheme with shorter ciphertext in the random oracle model. We have reduced size of the ciphertext C from (m(i+ 2)+ 1)k Zqk to (m+ 1)k Zqk wherekZqk is number of bits required to represent an element of Zq.

Journal of Internet Services and Information Security•Jan 1, 2012•5 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

Forward-Secure Identity-Based Public-Key Encryption without Random Oracles

Jia Yu, Fanyu Kong, Xiangguo Cheng +2 more

In traditional identity-based encryption schemes, security will be entirely lost once secret keys are exposed. However, with more and more use of mobile and unprotected devices, key exposure seems unavoidable. To deal with this problem, we newly propose a forward-secure identity-based public-key encryption scheme. In this primitive, the exposure of the secret key in one period doesn't affect the security of the ciphertext generated in previous periods. Any parameter in our scheme has at most log-squared complexity in terms of the total number of time periods. We also give the semantic security notions of forward-secure identity-based public-key encryption. The proposed scheme is proven semantically secure in the standard model. As far as we are concerned, it is the first forward-secure identity-based public-key encryption scheme without random oracles.

Fundamenta Informaticae•Jan 1, 2011•20 citations

Hierarchical identity-based broadcast encryption scheme from LWE

Chunli Yang, Shihui Zheng, Licheng Wang +2 more

A hierarchical identity-based broadcast encryption (H-IBBE) scheme is an identity-based broadcast encryption (IBBE) scheme in a hierarchical environment. In order to obtain secure H-IBBE schemes in the quantum era, we propose an H-IBBE scheme based on the learning with errors problem assumption. Our scheme achieves indistinguishability from random under adaptive chosen-plaintext and chosen-identity attacks in the random oracle model.

Journal of Communications and Networks•Jun 1, 2014•7 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

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
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.
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).
In traditional identity-based encryption schemes, security will be entirely lost once secret keys are exposed. However, with more and more use of mobile and unprotected devices, key exposure seems unavoidable. To deal with this problem, we newly propose a forward-secure identity-based public-key encryption scheme. In this primitive, the exposure of the secret key in one period doesn't affect the security of the ciphertext generated in previous periods. Any parameter in our scheme has at most log-squared complexity in terms of the total number of time periods. We also give the semantic security notions of forward-secure identity-based public-key encryption. The proposed scheme is proven semantically secure in the standard model. As far as we are concerned, it is the first forward-secure identity-based public-key encryption scheme without random oracles.
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.
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.