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

Fundamenta Informaticae

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

Jia Yu, Fanyu Kong, Xiangguo Cheng, Rong Hao, Jianxi Fan

Published Jan 1, 2011• 20 citations
Publisher

Abstract

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.

DOI
10.3233/fi-2011-562

Related papers

Forward-secure identity-based encryption with direct chosen-ciphertext security in the standard model

Yang Lu, Jiguo Li

The paradigm of forward security provides a promising approach to deal with the key exposure problem as it can effectively minimize the damage caused by the key exposure. In this paper, we develop a new forward-secure identity-based encryption scheme without random oracles. We formally prove that the proposed scheme is secure against adaptive chosen-ciphertext attacks in the standard model. In the proposed scheme, the running time of the private key extraction and decryption algorithms and the sizes of the user's initial private key and the ciphertext are independent on the total number of time periods, and any other performance parameter has at most log-squared complexity in terms of the total number of time periods. Compared with the previous forward-secure identity-based encryption schemes, the proposed scheme enjoys obvious advantage in the overall performance. To the best of our knowledge, it is the first forward-secure identity-based encryption scheme that achieves direct chosen-ciphertext security in the standard model.

Advances in Mathematics of Communications•Jan 1, 2017•6 citations

Generic Construction of Forward-Secure Identity-Based Encryption

Yang Lu, Jiguo Li

The primitive of forward-secure identity-based encryption was proposed in order to minimize the damage of private key exposure in identity-based encryption setting. This new primitive guarantees that even if the current private keys are compromised, it is not possible to compromise past secret keys and past communications. In this paper, we propose a generic construction of forward-secure identity-based encryption. To do so, we first introduce a relaxed variant of hierarchical identity-based encryption called identity-based binary tree encryption and construct a concrete identity-based binary tree encryption scheme that is provably chosen-ciphertext secure in the standard model. We then show how to generically construct forward-secure identity-based encryption from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a forward-secure identity-based encryption scheme with chosen-ciphertext security in the standard model.

Journal of Computers•Dec 1, 2012•3 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

An Efficient and Provable Secure Certificateless Identification Scheme in the Standard Model

Ji‐Jian Chin, Swee‐Huay Heng, Raphaël C.‐W. Phan

In Asiacrypt 2003, Al-Riyami and Paterson proposed the notion of certificateless cryptography, a technique to remove key escrow from traditional identity-based cryptography as well as circumvent the certificate management problem of traditional public key cryptography.Subsequently much research has been done in the realm of certificateless encryption and signature schemes, but little to no work has been done for the identification primitive until 2013 when Chin et al. rigorously defined certificateless identification and proposed a concrete scheme.However Chin et al.'s scheme was proven in the random oracle model and Canetti et al. has shown that certain schemes provable secure in the random oracle model can be insecure when random oracles are replaced with actual hash functions.Therefore while having a proof in the random oracle model is better than having no proof at all, a scheme to be proven in the standard model would provide stronger security guarantees.In this paper, we propose the first certificateless identification scheme that is both efficient and show our proof of security in the standard model, that is without having to assume random oracles exist.

KSII Transactions on Internet and Information Systems•Jul 29, 2014•9 citations

Forward-Secure Identity-Based Shorter Blind Signature from Lattices

Yanhua Zhang

Blind signature (BS) plays one of key ingredients in electronic cash or electronic voting system. However, the key exposures bring out very serious problems in insecure mobile devices. Forward-secure blind signatures preserve the validity of past signatures and prevent a forger from forging past signatures even if current secret key has been compromised. In this paper, we propose the first forward-secure identity-based shorter blind signature scheme from lattices which can resist quantum attack, and prove that our scheme satisfies the security requirements of blindness, unforgeability, and forward secrecy in the random oracle model. Furthermore, we also extend our construction to a forward-secure identity-based shorter blind signature in the standard model.

American Journal of Networks and Communications•Jan 1, 2016•3 citations

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
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.
The paradigm of forward security provides a promising approach to deal with the key exposure problem as it can effectively minimize the damage caused by the key exposure. In this paper, we develop a new forward-secure identity-based encryption scheme without random oracles. We formally prove that the proposed scheme is secure against adaptive chosen-ciphertext attacks in the standard model. In the proposed scheme, the running time of the private key extraction and decryption algorithms and the sizes of the user's initial private key and the ciphertext are independent on the total number of time periods, and any other performance parameter has at most log-squared complexity in terms of the total number of time periods. Compared with the previous forward-secure identity-based encryption schemes, the proposed scheme enjoys obvious advantage in the overall performance. To the best of our knowledge, it is the first forward-secure identity-based encryption scheme that achieves direct chosen-ciphertext security in the standard model.
The primitive of forward-secure identity-based encryption was proposed in order to minimize the damage of private key exposure in identity-based encryption setting. This new primitive guarantees that even if the current private keys are compromised, it is not possible to compromise past secret keys and past communications. In this paper, we propose a generic construction of forward-secure identity-based encryption. To do so, we first introduce a relaxed variant of hierarchical identity-based encryption called identity-based binary tree encryption and construct a concrete identity-based binary tree encryption scheme that is provably chosen-ciphertext secure in the standard model. We then show how to generically construct forward-secure identity-based encryption from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a forward-secure identity-based encryption scheme with chosen-ciphertext security in the standard model.
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.
In Asiacrypt 2003, Al-Riyami and Paterson proposed the notion of certificateless cryptography, a technique to remove key escrow from traditional identity-based cryptography as well as circumvent the certificate management problem of traditional public key cryptography.Subsequently much research has been done in the realm of certificateless encryption and signature schemes, but little to no work has been done for the identification primitive until 2013 when Chin et al. rigorously defined certificateless identification and proposed a concrete scheme.However Chin et al.'s scheme was proven in the random oracle model and Canetti et al. has shown that certain schemes provable secure in the random oracle model can be insecure when random oracles are replaced with actual hash functions.Therefore while having a proof in the random oracle model is better than having no proof at all, a scheme to be proven in the standard model would provide stronger security guarantees.In this paper, we propose the first certificateless identification scheme that is both efficient and show our proof of security in the standard model, that is without having to assume random oracles exist.
Blind signature (BS) plays one of key ingredients in electronic cash or electronic voting system. However, the key exposures bring out very serious problems in insecure mobile devices. Forward-secure blind signatures preserve the validity of past signatures and prevent a forger from forging past signatures even if current secret key has been compromised. In this paper, we propose the first forward-secure identity-based shorter blind signature scheme from lattices which can resist quantum attack, and prove that our scheme satisfies the security requirements of blindness, unforgeability, and forward secrecy in the random oracle model. Furthermore, we also extend our construction to a forward-secure identity-based shorter blind signature in the standard model.