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

doi:10.1007/978-3-540-73489-5_5

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

School of Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

21 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 language	English
Title of host publication	Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings
Pages	60-82
Number of pages	23
DOIs	https://doi.org/10.1007/978-3-540-73489-5_5
Publication status	Published - 2007
Event	1st International Conference on Pairing-Based Cryptography, Pairing 2007 - Tokyo, Japan Duration: 2007 Jul 2 → 2007 Jul 4

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4575 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st International Conference on Pairing-Based Cryptography, Pairing 2007
Country/Territory	Japan
City	Tokyo
Period	07/7/2 → 07/7/4

Keywords

Bilinear maps
Certificateless public key encryption
Chosen ciphertext security

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

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 Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings (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 et al.

Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings. 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 proceeding › Conference contribution

Park, JH, Choi, KY, Hwang, JY & Lee, DH 2007, Certificateless public key encryption in the selective-ID security model (without random oracles). in Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings. 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 Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings. 2007. p. 60-82. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73489-5_5

Park, Jong Hwan ; Choi, Kyu Young ; Hwang, Jung Yeon et al. / Certificateless public key encryption in the selective-ID security model (without random oracles). Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings. 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",

doi = "10.1007/978-3-540-73489-5_5",

language = "English",

isbn = "3540734880",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "60--82",

booktitle = "Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings",

note = "1st International Conference on Pairing-Based Cryptography, Pairing 2007 ; Conference date: 02-07-2007 Through 04-07-2007",

}

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

Y1 - 2007

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

AN - SCOPUS:50049104871

SN - 3540734880

SN - 9783540734888

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

SP - 60

EP - 82

BT - Pairing-Based Cryptography - Pairing 2007 - First International Conference, Proceedings

T2 - 1st International Conference on Pairing-Based Cryptography, Pairing 2007

Y2 - 2 July 2007 through 4 July 2007

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this