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

Advances in Mathematics of Communications

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

Yang Lu, Jiguo Li

Published Jan 1, 2017• 6 citations
Publisher

Abstract

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.

DOI
10.3934/amc.2017010

Related papers

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

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

Identity-Based Threshold Decryption Schemes Secure against Chosen Ciphertext Attacks in the Standard Model

Mei Qi, He Da

We propose two efficient Identity-Based threshold decryption schemes.They are proved secure against chosen ciphertext attacks under the standard decisional bilinear Diffie-Hellman assumption.The first one is constructed from(one of) the Selective ID-Based Encryption(Selective-IBE) scheme proposed by Boneh and Boyen recently,yet the second one is transformed from the Full ID-Based Encryption(Full-IBE) scheme obtained by Waters.As the based IBE schemes,the attacker in the first proposal has to choose the challenge identity before the common parameter is generated.while the attacker in the second one could choose the identity adaptively.To the best of our knowledge,previous related schemes could only be proved secure in the random oracle model.

Journal of the Graduate School of the Chinese Academy of Sciences•Jan 1, 2006•1 citation

Multi-receiver Identity-Based Key Encapsulation in the Standard Model

Yang Ming, Xiaoqin Shen

In this paper, we present a novel multi-receiver identity-based key encapsulation mechanism (mID-KEM) scheme which is provably secure against chosen ciphertext attacks in the standard model and has several advantages over previous constructions without random oracles, including short public parameters, short private keys, computational efficiency in decapsulation algorithm and tight security reduction. To our best knowledge, our construction is the first in the literature to achieve such a high security level (CCA-security in the full security model).

Information Science and Management Engineering•Aug 1, 2010•3 citations

Constructing Forward-Secure Identity-Based Encryption from Identity-Based Binary Tree Encryption

Yang Lu, Jiguo Li

In this paper, we propose a generic construction of forward-secure identity-based encryption. 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 which is provably secure in the standard model. We then show that forward-secure identity-based encryption can be generically constructed from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a direct chosen-ciphertext secure forward-secure identity-based encryption scheme without random oracles.

International Symposium on Information Science and Engineering•Dec 1, 2012•1 citation

ID-Based Proxy Re-encryption Scheme with Chosen-Ciphertext Security

Woo Kwon Koo, Jungyeon Hwang, Hyoung-Joong Kim +1 more

A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert a ciphertext for Alice into the ciphertext for Bob. Recently, ID-based proxy re-encryption schemes are receiving considerable attention for a variety of applications such as distributed storage, DRM, and email-forwarding system. And a non-interactive identity-based proxy re-encryption scheme was proposed for achieving CCA-security by Green and Ateniese. In the paper, we show that the identity-based proxy re-encryption scheme is unfortunately vulnerable to a collusion attack. The collusion of a proxy and a malicious user enables two parties to derive other honest users' private keys and thereby decrypt ciphertexts intended for only the honest user. To solve this problem, we propose two ID-based proxy re-encryption scheme schemes, which are proved secure under CPA and CCA in the random oracle model. For achieving CCA-security, we present self-authentication tag based on short signature. Important features of proposed scheme is that ciphertext structure is preserved after the ciphertext is re-encrypted. Therefore it does not lead to ciphertext expansion. And there is no limitation on the number of re-encryption.

Journal of the Institute of Electronics Engineers of Korea•Jan 1, 2009•1 citation
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.
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 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.
We propose two efficient Identity-Based threshold decryption schemes.They are proved secure against chosen ciphertext attacks under the standard decisional bilinear Diffie-Hellman assumption.The first one is constructed from(one of) the Selective ID-Based Encryption(Selective-IBE) scheme proposed by Boneh and Boyen recently,yet the second one is transformed from the Full ID-Based Encryption(Full-IBE) scheme obtained by Waters.As the based IBE schemes,the attacker in the first proposal has to choose the challenge identity before the common parameter is generated.while the attacker in the second one could choose the identity adaptively.To the best of our knowledge,previous related schemes could only be proved secure in the random oracle model.
In this paper, we present a novel multi-receiver identity-based key encapsulation mechanism (mID-KEM) scheme which is provably secure against chosen ciphertext attacks in the standard model and has several advantages over previous constructions without random oracles, including short public parameters, short private keys, computational efficiency in decapsulation algorithm and tight security reduction. To our best knowledge, our construction is the first in the literature to achieve such a high security level (CCA-security in the full security model).
In this paper, we propose a generic construction of forward-secure identity-based encryption. 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 which is provably secure in the standard model. We then show that forward-secure identity-based encryption can be generically constructed from identity-based binary tree encryption. Based on the proposed identity-based binary tree encryption scheme, we obtain a direct chosen-ciphertext secure forward-secure identity-based encryption scheme without random oracles.
A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert a ciphertext for Alice into the ciphertext for Bob. Recently, ID-based proxy re-encryption schemes are receiving considerable attention for a variety of applications such as distributed storage, DRM, and email-forwarding system. And a non-interactive identity-based proxy re-encryption scheme was proposed for achieving CCA-security by Green and Ateniese. In the paper, we show that the identity-based proxy re-encryption scheme is unfortunately vulnerable to a collusion attack. The collusion of a proxy and a malicious user enables two parties to derive other honest users' private keys and thereby decrypt ciphertexts intended for only the honest user. To solve this problem, we propose two ID-based proxy re-encryption scheme schemes, which are proved secure under CPA and CCA in the random oracle model. For achieving CCA-security, we present self-authentication tag based on short signature. Important features of proposed scheme is that ciphertext structure is preserved after the ciphertext is re-encrypted. Therefore it does not lead to ciphertext expansion. And there is no limitation on the number of re-encryption.