Efficient revocable certificateless public key encryption with a delegated revocation authority

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)3713-3725
Number of pages13
JournalSecurity and Communication Networks
Volume8
Issue number18
DOIs
Publication statusPublished - 2015 Dec 1

Fingerprint

Cryptography
Hash functions
Costs

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

@article{392ab8f22a9345bd86d8ad64f4ba504e,
title = "Efficient revocable certificateless public key encryption with a delegated revocation authority",
abstract = "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.",
author = "Tsai, {Tung Tso} and Yuh-Min Tseng and Sen-Shan Huang",
year = "2015",
month = "12",
day = "1",
doi = "10.1002/sec.1294",
language = "English",
volume = "8",
pages = "3713--3725",
journal = "Security and Communication Networks",
issn = "1939-0114",
publisher = "John Wiley and Sons Inc.",
number = "18",

}

Efficient revocable certificateless public key encryption with a delegated revocation authority. / Tsai, Tung Tso; Tseng, Yuh-Min; Huang, Sen-Shan.

In: Security and Communication Networks, Vol. 8, No. 18, 01.12.2015, p. 3713-3725.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient revocable certificateless public key encryption with a delegated revocation authority

AU - Tsai, Tung Tso

AU - Tseng, Yuh-Min

AU - Huang, Sen-Shan

PY - 2015/12/1

Y1 - 2015/12/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1002/sec.1294

DO - 10.1002/sec.1294

M3 - Article

AN - SCOPUS:84930900942

VL - 8

SP - 3713

EP - 3725

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0114

IS - 18

ER -