A fully secure revocable ID-based encryption in the standard model

Tung Tso Tsai, Yuh-Min Tseng, Tsu Yang Wu

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Revocation problem is a critical issue for key management of public key systems. Any certificate-based or identity (ID)-based public key systems must provide a revocation method to revoke misbehaving/compromised users from the public key systems. In the past, there was little work on studying the revocation problem of ID-based public key systems. Most recently, Tseng and Tsai presented a novel ID-based public key system with efficient revocation using a public channel, and proposed a practical revocable ID-based encryption (called RIBE). They proved that the proposed RIBE is semantically secure in the random oracle model. Although the ID-based encryption schemes based on the random oracle model can offer better performance, the resulting schemes could be insecure when random oracles are instantiated with concrete hash functions. In this paper, we employ Tseng and Tsai's revocable concept to propose a new RIBE without random oracles to provide full security. We demonstrate that the proposed RIBE is semantically secure against adaptive-ID attacks in the standard model.

Original languageEnglish
Pages (from-to)487-505
Number of pages19
JournalInformatica (Netherlands)
Volume23
Issue number3
Publication statusPublished - 2012 Jan 1

Fingerprint

Identity-based Encryption
Public key
Revocation
Cryptography
Standard Model
Identity-based
Random Oracle
Random Oracle Model
Hash functions
Key Management
Concretes
Hash Function
Certificate
Attack
Demonstrate

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

Tsai, Tung Tso ; Tseng, Yuh-Min ; Wu, Tsu Yang. / A fully secure revocable ID-based encryption in the standard model. In: Informatica (Netherlands). 2012 ; Vol. 23, No. 3. pp. 487-505.
@article{d2973234671b4147b7487b0d76cf1210,
title = "A fully secure revocable ID-based encryption in the standard model",
abstract = "Revocation problem is a critical issue for key management of public key systems. Any certificate-based or identity (ID)-based public key systems must provide a revocation method to revoke misbehaving/compromised users from the public key systems. In the past, there was little work on studying the revocation problem of ID-based public key systems. Most recently, Tseng and Tsai presented a novel ID-based public key system with efficient revocation using a public channel, and proposed a practical revocable ID-based encryption (called RIBE). They proved that the proposed RIBE is semantically secure in the random oracle model. Although the ID-based encryption schemes based on the random oracle model can offer better performance, the resulting schemes could be insecure when random oracles are instantiated with concrete hash functions. In this paper, we employ Tseng and Tsai's revocable concept to propose a new RIBE without random oracles to provide full security. We demonstrate that the proposed RIBE is semantically secure against adaptive-ID attacks in the standard model.",
author = "Tsai, {Tung Tso} and Yuh-Min Tseng and Wu, {Tsu Yang}",
year = "2012",
month = "1",
day = "1",
language = "English",
volume = "23",
pages = "487--505",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "3",

}

A fully secure revocable ID-based encryption in the standard model. / Tsai, Tung Tso; Tseng, Yuh-Min; Wu, Tsu Yang.

In: Informatica (Netherlands), Vol. 23, No. 3, 01.01.2012, p. 487-505.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fully secure revocable ID-based encryption in the standard model

AU - Tsai, Tung Tso

AU - Tseng, Yuh-Min

AU - Wu, Tsu Yang

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Revocation problem is a critical issue for key management of public key systems. Any certificate-based or identity (ID)-based public key systems must provide a revocation method to revoke misbehaving/compromised users from the public key systems. In the past, there was little work on studying the revocation problem of ID-based public key systems. Most recently, Tseng and Tsai presented a novel ID-based public key system with efficient revocation using a public channel, and proposed a practical revocable ID-based encryption (called RIBE). They proved that the proposed RIBE is semantically secure in the random oracle model. Although the ID-based encryption schemes based on the random oracle model can offer better performance, the resulting schemes could be insecure when random oracles are instantiated with concrete hash functions. In this paper, we employ Tseng and Tsai's revocable concept to propose a new RIBE without random oracles to provide full security. We demonstrate that the proposed RIBE is semantically secure against adaptive-ID attacks in the standard model.

AB - Revocation problem is a critical issue for key management of public key systems. Any certificate-based or identity (ID)-based public key systems must provide a revocation method to revoke misbehaving/compromised users from the public key systems. In the past, there was little work on studying the revocation problem of ID-based public key systems. Most recently, Tseng and Tsai presented a novel ID-based public key system with efficient revocation using a public channel, and proposed a practical revocable ID-based encryption (called RIBE). They proved that the proposed RIBE is semantically secure in the random oracle model. Although the ID-based encryption schemes based on the random oracle model can offer better performance, the resulting schemes could be insecure when random oracles are instantiated with concrete hash functions. In this paper, we employ Tseng and Tsai's revocable concept to propose a new RIBE without random oracles to provide full security. We demonstrate that the proposed RIBE is semantically secure against adaptive-ID attacks in the standard model.

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

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

M3 - Article

AN - SCOPUS:84867559270

VL - 23

SP - 487

EP - 505

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 3

ER -