Revocable certificateless public key encryption

Tung Tso Tsai, Yuh-Min Tseng

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

The concept of a certificateless public-key system (CL-PKS) was first introduced by Al-Riyami and Paterson. The CL-PKS not only solves the key escrow problem but also retains the merit of eliminating the required certificates in the identity-based PKS. Up to now, there was little work on studying the revocation problem in existing CL-PKS constructions. In this paper, we address the revocation problem and propose the first revocable certificateless public-key encryption (RCL-PKE). We define the new syntax and security notions of the RCL-PKE and propose a concrete RCL-PKE scheme. Compared with the previously proposed CL-PKE schemes, the proposed RCL-PKE scheme retains efficiency for encryption and decryption procedures while providing an efficient revocation alternative using a public channel. Under the computational and the bilinear Diffie-Hellman assumptions, we demonstrate that our RCL-PKE scheme is semantically secure against adaptive chosen-ciphertext attacks.

Original languageEnglish
Article number6671357
Pages (from-to)824-833
Number of pages10
JournalIEEE Systems Journal
Volume9
Issue number3
DOIs
Publication statusPublished - 2015 Sep 1

Fingerprint

Cryptography
Concretes

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Tsai, Tung Tso ; Tseng, Yuh-Min. / Revocable certificateless public key encryption. In: IEEE Systems Journal. 2015 ; Vol. 9, No. 3. pp. 824-833.
@article{46c50dd752cd4154988cb26d18630388,
title = "Revocable certificateless public key encryption",
abstract = "The concept of a certificateless public-key system (CL-PKS) was first introduced by Al-Riyami and Paterson. The CL-PKS not only solves the key escrow problem but also retains the merit of eliminating the required certificates in the identity-based PKS. Up to now, there was little work on studying the revocation problem in existing CL-PKS constructions. In this paper, we address the revocation problem and propose the first revocable certificateless public-key encryption (RCL-PKE). We define the new syntax and security notions of the RCL-PKE and propose a concrete RCL-PKE scheme. Compared with the previously proposed CL-PKE schemes, the proposed RCL-PKE scheme retains efficiency for encryption and decryption procedures while providing an efficient revocation alternative using a public channel. Under the computational and the bilinear Diffie-Hellman assumptions, we demonstrate that our RCL-PKE scheme is semantically secure against adaptive chosen-ciphertext attacks.",
author = "Tsai, {Tung Tso} and Yuh-Min Tseng",
year = "2015",
month = "9",
day = "1",
doi = "10.1109/JSYST.2013.2289271",
language = "English",
volume = "9",
pages = "824--833",
journal = "IEEE Systems Journal",
issn = "1932-8184",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

Revocable certificateless public key encryption. / Tsai, Tung Tso; Tseng, Yuh-Min.

In: IEEE Systems Journal, Vol. 9, No. 3, 6671357, 01.09.2015, p. 824-833.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Revocable certificateless public key encryption

AU - Tsai, Tung Tso

AU - Tseng, Yuh-Min

PY - 2015/9/1

Y1 - 2015/9/1

N2 - The concept of a certificateless public-key system (CL-PKS) was first introduced by Al-Riyami and Paterson. The CL-PKS not only solves the key escrow problem but also retains the merit of eliminating the required certificates in the identity-based PKS. Up to now, there was little work on studying the revocation problem in existing CL-PKS constructions. In this paper, we address the revocation problem and propose the first revocable certificateless public-key encryption (RCL-PKE). We define the new syntax and security notions of the RCL-PKE and propose a concrete RCL-PKE scheme. Compared with the previously proposed CL-PKE schemes, the proposed RCL-PKE scheme retains efficiency for encryption and decryption procedures while providing an efficient revocation alternative using a public channel. Under the computational and the bilinear Diffie-Hellman assumptions, we demonstrate that our RCL-PKE scheme is semantically secure against adaptive chosen-ciphertext attacks.

AB - The concept of a certificateless public-key system (CL-PKS) was first introduced by Al-Riyami and Paterson. The CL-PKS not only solves the key escrow problem but also retains the merit of eliminating the required certificates in the identity-based PKS. Up to now, there was little work on studying the revocation problem in existing CL-PKS constructions. In this paper, we address the revocation problem and propose the first revocable certificateless public-key encryption (RCL-PKE). We define the new syntax and security notions of the RCL-PKE and propose a concrete RCL-PKE scheme. Compared with the previously proposed CL-PKE schemes, the proposed RCL-PKE scheme retains efficiency for encryption and decryption procedures while providing an efficient revocation alternative using a public channel. Under the computational and the bilinear Diffie-Hellman assumptions, we demonstrate that our RCL-PKE scheme is semantically secure against adaptive chosen-ciphertext attacks.

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

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

U2 - 10.1109/JSYST.2013.2289271

DO - 10.1109/JSYST.2013.2289271

M3 - Article

AN - SCOPUS:85027946805

VL - 9

SP - 824

EP - 833

JO - IEEE Systems Journal

JF - IEEE Systems Journal

SN - 1932-8184

IS - 3

M1 - 6671357

ER -