Efficient revocable multi-receiver ID-based encryption

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Quite recently, Tseng and Tsai proposed a revocable identity (ID)-based encryption (RIBE) with a public channel, in which the private key generator (PKG) can efficiently revoke misbehaving/compromised users by using a public channel. Considering the problem where a sender would like to encrypt an identical message for n receivers, the sender must re-encrypt the message n times using Tseng and Tsai's RIBE scheme. In such a case, n expensive pairing operations are required for the re-encrypting procedure. In this paper, for reducing the pairing operations, we extend Tseng and Tsai's RIBE to propose an efficient revocable multi-receiver ID-based encryption (RMIBE) scheme. Our scheme only needs one pairing operation to encrypt an identical message for n receivers while remaining the merit of user revocability in Tseng and Tsai's RIBE scheme. We demonstrate that the RMIBE scheme is semantically secure against adaptive chosen ciphertext attacks (CCA) in the random oracle model.

Original languageEnglish
Pages (from-to)159-169
Number of pages11
JournalInformation Technology and Control
Volume42
Issue number2
DOIs
Publication statusPublished - 2013 Jun 19

Fingerprint

Cryptography

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Tsai, Tung Tso ; Tseng, Yuh-Min ; Wu, Tsu Yang. / Efficient revocable multi-receiver ID-based encryption. In: Information Technology and Control. 2013 ; Vol. 42, No. 2. pp. 159-169.
@article{fe661aa82ec740d286b5d8c4043e08f3,
title = "Efficient revocable multi-receiver ID-based encryption",
abstract = "Quite recently, Tseng and Tsai proposed a revocable identity (ID)-based encryption (RIBE) with a public channel, in which the private key generator (PKG) can efficiently revoke misbehaving/compromised users by using a public channel. Considering the problem where a sender would like to encrypt an identical message for n receivers, the sender must re-encrypt the message n times using Tseng and Tsai's RIBE scheme. In such a case, n expensive pairing operations are required for the re-encrypting procedure. In this paper, for reducing the pairing operations, we extend Tseng and Tsai's RIBE to propose an efficient revocable multi-receiver ID-based encryption (RMIBE) scheme. Our scheme only needs one pairing operation to encrypt an identical message for n receivers while remaining the merit of user revocability in Tseng and Tsai's RIBE scheme. We demonstrate that the RMIBE scheme is semantically secure against adaptive chosen ciphertext attacks (CCA) in the random oracle model.",
author = "Tsai, {Tung Tso} and Yuh-Min Tseng and Wu, {Tsu Yang}",
year = "2013",
month = "6",
day = "19",
doi = "10.5755/j01.itc.42.2.2244",
language = "English",
volume = "42",
pages = "159--169",
journal = "Information Technology and Control",
issn = "1392-124X",
publisher = "Kauno Technologijos Universitetas",
number = "2",

}

Efficient revocable multi-receiver ID-based encryption. / Tsai, Tung Tso; Tseng, Yuh-Min; Wu, Tsu Yang.

In: Information Technology and Control, Vol. 42, No. 2, 19.06.2013, p. 159-169.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient revocable multi-receiver ID-based encryption

AU - Tsai, Tung Tso

AU - Tseng, Yuh-Min

AU - Wu, Tsu Yang

PY - 2013/6/19

Y1 - 2013/6/19

N2 - Quite recently, Tseng and Tsai proposed a revocable identity (ID)-based encryption (RIBE) with a public channel, in which the private key generator (PKG) can efficiently revoke misbehaving/compromised users by using a public channel. Considering the problem where a sender would like to encrypt an identical message for n receivers, the sender must re-encrypt the message n times using Tseng and Tsai's RIBE scheme. In such a case, n expensive pairing operations are required for the re-encrypting procedure. In this paper, for reducing the pairing operations, we extend Tseng and Tsai's RIBE to propose an efficient revocable multi-receiver ID-based encryption (RMIBE) scheme. Our scheme only needs one pairing operation to encrypt an identical message for n receivers while remaining the merit of user revocability in Tseng and Tsai's RIBE scheme. We demonstrate that the RMIBE scheme is semantically secure against adaptive chosen ciphertext attacks (CCA) in the random oracle model.

AB - Quite recently, Tseng and Tsai proposed a revocable identity (ID)-based encryption (RIBE) with a public channel, in which the private key generator (PKG) can efficiently revoke misbehaving/compromised users by using a public channel. Considering the problem where a sender would like to encrypt an identical message for n receivers, the sender must re-encrypt the message n times using Tseng and Tsai's RIBE scheme. In such a case, n expensive pairing operations are required for the re-encrypting procedure. In this paper, for reducing the pairing operations, we extend Tseng and Tsai's RIBE to propose an efficient revocable multi-receiver ID-based encryption (RMIBE) scheme. Our scheme only needs one pairing operation to encrypt an identical message for n receivers while remaining the merit of user revocability in Tseng and Tsai's RIBE scheme. We demonstrate that the RMIBE scheme is semantically secure against adaptive chosen ciphertext attacks (CCA) in the random oracle model.

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

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

U2 - 10.5755/j01.itc.42.2.2244

DO - 10.5755/j01.itc.42.2.2244

M3 - Article

AN - SCOPUS:84878976411

VL - 42

SP - 159

EP - 169

JO - Information Technology and Control

JF - Information Technology and Control

SN - 1392-124X

IS - 2

ER -