Certificateless public key encryption in the selective-ID security model (without random oracles)

Jong Hwan Park, Kyu Young Choi, Jung Yeon Hwang, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

The concept of Certificateless Public Key Encryption (CLPKE) eliminates the use of certificates in certified Public Key Encryption (PKE) scheme and the key-escrow problem in Identity Based Encryption (IBE) scheme. Al-Riyami and Paterson first proposed a CL-PKE scheme and proved its security in their security model (AP-model) using idealized random oracles. Several generic constructions were also proposed to construct a CL-PKE scheme by composing the standard PKE and IBE schemes. Recently, it was proved that some generic constructions are not secure against chosen ciphertext attacks in light of the security goals in the AP-model. In this paper, we show that all the known generic constructions are not secure against chosen ciphertext attacks, in the AP-model or a weaker security model than the AP-model. We also propose a CL-PKE scheme which is provably secure against chosen ciphertext attacks without random oracles. Our construction is proven secure in the selective-ID security model, reflecting the feature of CL-PKE scheme.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages60-82
Number of pages23
Volume4575 LNCS
DOIs
Publication statusPublished - 2007 Dec 1
Event1st International Conference on Pairing-Based Cryptography, Pairing 2007 - Tokyo, Japan
Duration: 2007 Jul 22007 Jul 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4575 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other1st International Conference on Pairing-Based Cryptography, Pairing 2007
CountryJapan
CityTokyo
Period07/7/207/7/4

Fingerprint

Random Oracle
Public Key Encryption
Security Model
Cryptography
Identity-based Encryption
Attack
Certificate
Model
Eliminate

Keywords

  • Bilinear maps
  • Certificateless public key encryption
  • Chosen ciphertext security

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Park, J. H., Choi, K. Y., Hwang, J. Y., & Lee, D. H. (2007). Certificateless public key encryption in the selective-ID security model (without random oracles). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4575 LNCS, pp. 60-82). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4575 LNCS). https://doi.org/10.1007/978-3-540-73489-5_5

Certificateless public key encryption in the selective-ID security model (without random oracles). / Park, Jong Hwan; Choi, Kyu Young; Hwang, Jung Yeon; Lee, Dong Hoon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4575 LNCS 2007. p. 60-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4575 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, JH, Choi, KY, Hwang, JY & Lee, DH 2007, Certificateless public key encryption in the selective-ID security model (without random oracles). in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4575 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4575 LNCS, pp. 60-82, 1st International Conference on Pairing-Based Cryptography, Pairing 2007, Tokyo, Japan, 07/7/2. https://doi.org/10.1007/978-3-540-73489-5_5
Park JH, Choi KY, Hwang JY, Lee DH. Certificateless public key encryption in the selective-ID security model (without random oracles). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4575 LNCS. 2007. p. 60-82. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-73489-5_5
Park, Jong Hwan ; Choi, Kyu Young ; Hwang, Jung Yeon ; Lee, Dong Hoon. / Certificateless public key encryption in the selective-ID security model (without random oracles). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4575 LNCS 2007. pp. 60-82 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fc00e94674d1469486ba2a7c2f8e4ca7,
title = "Certificateless public key encryption in the selective-ID security model (without random oracles)",
abstract = "The concept of Certificateless Public Key Encryption (CLPKE) eliminates the use of certificates in certified Public Key Encryption (PKE) scheme and the key-escrow problem in Identity Based Encryption (IBE) scheme. Al-Riyami and Paterson first proposed a CL-PKE scheme and proved its security in their security model (AP-model) using idealized random oracles. Several generic constructions were also proposed to construct a CL-PKE scheme by composing the standard PKE and IBE schemes. Recently, it was proved that some generic constructions are not secure against chosen ciphertext attacks in light of the security goals in the AP-model. In this paper, we show that all the known generic constructions are not secure against chosen ciphertext attacks, in the AP-model or a weaker security model than the AP-model. We also propose a CL-PKE scheme which is provably secure against chosen ciphertext attacks without random oracles. Our construction is proven secure in the selective-ID security model, reflecting the feature of CL-PKE scheme.",
keywords = "Bilinear maps, Certificateless public key encryption, Chosen ciphertext security",
author = "Park, {Jong Hwan} and Choi, {Kyu Young} and Hwang, {Jung Yeon} and Lee, {Dong Hoon}",
year = "2007",
month = "12",
day = "1",
doi = "10.1007/978-3-540-73489-5_5",
language = "English",
isbn = "3540734880",
volume = "4575 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "60--82",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Certificateless public key encryption in the selective-ID security model (without random oracles)

AU - Park, Jong Hwan

AU - Choi, Kyu Young

AU - Hwang, Jung Yeon

AU - Lee, Dong Hoon

PY - 2007/12/1

Y1 - 2007/12/1

N2 - The concept of Certificateless Public Key Encryption (CLPKE) eliminates the use of certificates in certified Public Key Encryption (PKE) scheme and the key-escrow problem in Identity Based Encryption (IBE) scheme. Al-Riyami and Paterson first proposed a CL-PKE scheme and proved its security in their security model (AP-model) using idealized random oracles. Several generic constructions were also proposed to construct a CL-PKE scheme by composing the standard PKE and IBE schemes. Recently, it was proved that some generic constructions are not secure against chosen ciphertext attacks in light of the security goals in the AP-model. In this paper, we show that all the known generic constructions are not secure against chosen ciphertext attacks, in the AP-model or a weaker security model than the AP-model. We also propose a CL-PKE scheme which is provably secure against chosen ciphertext attacks without random oracles. Our construction is proven secure in the selective-ID security model, reflecting the feature of CL-PKE scheme.

AB - The concept of Certificateless Public Key Encryption (CLPKE) eliminates the use of certificates in certified Public Key Encryption (PKE) scheme and the key-escrow problem in Identity Based Encryption (IBE) scheme. Al-Riyami and Paterson first proposed a CL-PKE scheme and proved its security in their security model (AP-model) using idealized random oracles. Several generic constructions were also proposed to construct a CL-PKE scheme by composing the standard PKE and IBE schemes. Recently, it was proved that some generic constructions are not secure against chosen ciphertext attacks in light of the security goals in the AP-model. In this paper, we show that all the known generic constructions are not secure against chosen ciphertext attacks, in the AP-model or a weaker security model than the AP-model. We also propose a CL-PKE scheme which is provably secure against chosen ciphertext attacks without random oracles. Our construction is proven secure in the selective-ID security model, reflecting the feature of CL-PKE scheme.

KW - Bilinear maps

KW - Certificateless public key encryption

KW - Chosen ciphertext security

UR - http://www.scopus.com/inward/record.url?scp=50049104871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50049104871&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73489-5_5

DO - 10.1007/978-3-540-73489-5_5

M3 - Conference contribution

SN - 3540734880

SN - 9783540734888

VL - 4575 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 60

EP - 82

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -