key escrow problem (since the CA does not know the
private keys of users) and key distribution problem (since
the certificates need not be kept secret) in CBE.
On the other hand, as cryptographic computations are
performed more frequently on small, unprotected, and
easily-stolen devices (e.g., mobile phones), the notion of
forward security [25] was introduced to counter the acute
threat of the private key exposure. In a forward-secure
scheme, the users’ private keys are updated at regular
periods throughout the lifetime of the system;
furthermore, exposure of a user’s private key
corresponding to a given time period does not enable an
adversary to break the scheme (in the appropriate sense)
for any prior time period. Forward-secure scheme has a
number of obvious applications, as it can be used to
protect the secrecy of communications for devices
operating in insecure environments where key exposure is
an immediate concern.
A. Related Work
Since the introduction of CBE [5], there are different
variants or improvements proposed in the literature later
on. Yum and Lee [8] provided a formal equivalence
theorem among IBE, certificateless public-key encryption
(CL-PKE) [3] and CBE. They showed that IBE implies
both CBE and CL-PKE by giving a generic construction
from IBE to those primitives. However, Galindo et al. [9]
pointed out that a dishonest authority could break the
security of the generic constructions given in [8]. These
constructions were inherently flawed due to a naive use
of double encryption without further treatments. Lu et al.
solved this problem and achieved two generic CBE
constructions from PKE and IBE in [11,12]. Al-Riyami
and Paterson [4] gave an analysis of Gentry’s CBE
concept and repaired a number of problems with the
original definition and security model for CBE. They also
presented a generic conversion of CBE from CL-PKE
and claimed that a secure CBE scheme could be
constructed from any secure CL-PKE scheme using this
conversion. Kang and Park [13] pointed out that their
conversion was incorrect due to the flaw in their security
proof. Recently, Wang et al. [14] proposed a certificate-
based proxy cryptosystem based on Gentry’s CBE
scheme. Galindo et al. [10] proposed the first
construction of CBE scheme secure in the standard model.
Liu and Zhou [15] proposed another CBE scheme secure
in the standard model. Moreover, Lu et al. [16] proposed
an efficient CBE scheme secure in the random oracle
model [18,21]. The same authors [17] also proposed the
notion of threshold certificate-based encryption to
improve the reliability of CBE.
The notion of forward security was first proposed in
the context of key-exchange protocols by Günther [23]
and Diffie, et al. [24]. Subsequently, Anderson [25]
suggested forward security for the more challenging non-
interactive setting. The notion of forward security was
first formalized in the context of signature by Bellare and
Miner [19]. Forward security in the symmetric-key
setting has also been studied in [20]. However, the
existence of non-trivial, forward-secure PKE schemes has
been open for a long while since the question was first
posed by Anderson [25]. Until 2003, Canetti, Halevi and
Katz [22] first formalized the notion of forward security
for PKE and constructed the first forward-secure PKE
scheme.
B. Our Contribution
In CBE, once a user accidentally reveals his private
key or an attacker actively compromises it, he can make
his private key be disused by revoking his short-time
certificate. However, anyone who learns the private key
of a user can read all past messages sent to the user since
all the past short-time certificates are public. To fix this
problem in CBE, we propose a new notion called
Forward-Secure Certificate-Based Encryption. This
notion preserves the advantages of CBE such as implicit
certificate and no private key escrow. At the same time it
inherits the properties of the forward-secure PKE. In the
following paper, we first formalize the scheme and
security model for forward-secure CBE. Then we propose
a generic construction of forward-secure CBE from IBE
and forward-secure PKE (fs-PKE), and also construct a
concrete forward-secure CBE scheme.
II.
FORWARD-SECURE CERIFICATE-BASED ENCRYPTION
In this section, we provide the formal definition for
forward-secure CBE and its security model. Our
definitions for forward-secure CBE generalize the
standard definitions for CBE, similar to the way in which
the definitions of fs-PKE [22] generalize the standard
definitions for PKE.
A. Scheme Definition
Definition 1. A forward-secure certificate-based
encryption scheme (fs-CBE) is a tuple of six PPT
algorithms (Setup, SetKeyPair, Certify, KeyUpd, Enc,
Dec) such that:
y Setup takes as input a security parameter
Λ
and the
total number of time periods N. It returns a master-key
msk and the public system parameters params that
include the descriptions of a finite message space MSPC
and a finite ciphertext space CSPC. We consider params
to be an implicit input to the rest of the algorithms.
Usually, this algorithm is run by a CA.
y SetKeyPair takes params as input and returns a
public key upk and an initial secret key usk
0
.
y Certify takes as input the master-key msk, the index
τ
of the current time period, a user’s identity id and his
public key upk. It returns a short-lived certificate Cert
id,
τ
which is sent to the user id.
y KeyUpd takes as input a secret key usk
τ
-1
for the
time period
τ
-1 as well as the index
τ
of the current time
period. It returns a private key usk
τ
for the time period
τ
.
y Enc takes as input the index
τ
of the current time
period, the receiver’s identity id, the receiver’s public key
upk, and a message M. It returns a ciphertext C for the
time period
τ
. We represent the output as a pair <
τ
, C>
and write <
τ
, C> ← Enc(
τ
, id, upk, M).
y Dec takes as input the receiver’s short-lived
certificate Cert
id,
τ
and private key usk
τ
for the time period
τ
, and a ciphertext <
τ
, C>. It returns a message M or the