CBE from CL-PKE: A Generic Construction and Efficient Schemes

Al-Riyami, Sattam S.; Paterson, Kenneth G.

doi:10.1007/978-3-540-30580-4_27

Cited by 121 publications

(123 citation statements)

References 11 publications

Supporting

Mentioning

121

Contrasting

Unclassified

Order By: Relevance

“…It first identifies some weaknesses in generic constructions independently considered in [1] and [29]. It shows that one of these flaws is also present in the second provably secure CLE scheme of Al-Riyami and Paterson [3] where it can be very easily fixed. The paper then explains how to obtain generic constructions which are provably secure in the random oracle model.…”

Section: Introductionmentioning

confidence: 99%

“…A more recent work [3] thoroughly investigated the connections between the CLE and CBE paradigms by proposing a simplified definition and a revised security model for certificate based encryption before proving that any secure certificateless encryption (CLE) scheme can be turned into a secure CBE in the amended model.…”

Section: Introductionmentioning

confidence: 99%

“…Among other related results, we mention a paper [16] describing a somewhat similar scheme to [3], another work [9] that investigates identity-based and certificateless extensions of key encapsulation mechanisms. Both works [9,16] considered a model of security which is noticeably weaker (albeit realistic in practice) than the original one [2].…”

Section: Introductionmentioning

confidence: 99%

“…A very recent paper by Baek et al [4] also showed how to devise a certificateless encryption scheme without pairings. The latter construction enjoys a better efficiency than pairing-based proposals [2,3,16] but is supported by a weaker security model and prevents users from generating their public key independently from the system's authority. Finally, Dent and Kudla [17] investigated the feasibility of provably secure CLE schemes in the standard model and ruled out the use of some particular proof techniques for achieving this purpose in accordance with intuitive arguments given in [16].…”

Section: Introductionmentioning

confidence: 99%

“…The second contribution of the paper is to describe a new efficient pairingbased scheme yielding some advantages over previous constructions [2,3,16,9]: its encryption operation does not require to compute a pairing (only the decryption algorithm does) and is thus generally faster than in previous proposals [2,3,16,9]. The security proof of the new scheme is nevertheless obtained under a stronger computational assumption than for previous schemes in the literature.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Libert

Quisquater

2006

Public Key Cryptography - PKC 2006

123

View full text Add to dashboard Cite

Abstract. Certificateless cryptography (CL-PKC) is a concept that aims at enjoying the advantages of identity based cryptography without suffering from its inherent key escrow. Several methods were recently suggested to generically construct a certificateless encryption (CLE) scheme by combining identity based schemes with ordinary public key cryptosystems. Whilst the security of one of these generic compositions was proved in a relaxed security model, we show that all them are insecure against chosen-ciphertext attacks in the strongest model of Al-Riyami and Paterson. We show how to easily fix these problems and give a method to achieve generic CLE constructions which are provably CCA-secure in the random oracle model. We finally propose a new efficient pairingbased scheme that performs better than previous proposals without precomputation. We also prove its security in the random oracle model.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Libert

Quisquater

2006

Public Key Cryptography - PKC 2006

123

View full text Add to dashboard Cite

show abstract

Efficient revocable certificateless public key encryption with a delegated revocation authority

Tsai

Tseng

Huang

2015

Security Comm Networks

View full text Add to dashboard Cite

Quite recently, Shen et al. proposed a revocable certificateless public key encryption (RCL‐PKE) scheme in the standard model, in which the key generation center (KGC) can efficiently revoke misbehaving or compromised users. However, their scheme was shown to be insecure. Moreover, the work of revoking users is executed only by the KGC, and their scheme requires high computation cost. In this paper, we propose the first secure RCL‐PKE scheme with a delegated revocation authority in the standard model. We emphasize that the delegated revocation authority shares the responsibility for user revocation to reduce the load of the KGC and provide the revocation flexibility. When compared with Shen et al.'s scheme, our scheme has better performance in terms of each user's private key size and computation cost. Under the decisional bilinear Diffie–Hellman and collision‐resistant hash function assumptions, we demonstrate that the proposed RCL‐PKE scheme is semantically secure in the standard model. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Efficient certificate‐based encryption schemes without pairing

Kim

Hwang

2016

Security Comm Networks

View full text Add to dashboard Cite

Recently, a lot of researches focused on identity‐based encryption (IBE). The advantage of this scheme is that it can reduce the cost of the public key infrastructure by simplifying certificate management. Although IBE has its own innovations, one of its weaknesses is the key escrow problem. That is, the private key generator in IBE knows decryption keys for all identities and consequently can decrypt any ciphertexts. The certificate‐based encryption (CBE) scheme proposed in EUROCRYPT 2003 provides a solution for the key escrow problem by allowing the certification authority to possess a partial decryption key that comprises the full decryption key together with the user‐generated private key. In this paper, we propose new CBE schemes without pairing and prove them to be Indistinguishability under Chosen Ciphertext Attack secure in the random oracle model based on the hardness of the computational Diffie–Hellman problem. When compared with other CBE schemes, our schemes are significantly efficient in terms of performance, which makes our schemes suitable for computation‐limited node (e.g., sensor, wearable device) networks. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

CBE from CL-PKE: A Generic Construction and Efficient Schemes

Cited by 121 publications

References 11 publications

On Constructing Certificateless Cryptosystems from Identity Based Encryption

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Efficient revocable certificateless public key encryption with a delegated revocation authority

Efficient certificate‐based encryption schemes without pairing

Contact Info

Product

Resources

About