Efficient revocable identity-based encryption via subset difference methods

Kwangsu Lee, Dong Hoon Lee, Jong Hwan Park

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user’s credential (or private key) can be expired or revealed. revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme of Naor, Naor and Lotspiech (CRYPTO 2001) for key revocation. In this paper, we present a new technique for RIBE that uses the efficient subset difference (SD) scheme of Naor et al. instead of using the CS scheme to improve the size of update keys. Following our new technique, we first propose an efficient RIBE scheme in prime-order bilinear groups by combining the IBE scheme of Boneh and Boyen and the SD scheme and prove its selective security under the standard assumption. Our RIBE scheme is the first RIBE scheme in bilinear groups that has O(r) number of group elements in an update key where r is the number of revoked users. Next, we also propose another RIBE scheme in composite-order bilinear groups and prove its full security under static assumptions. Our RIBE schemes also can be integrated with the layered subset difference scheme of Halevy and Shamir (CRYPTO 2002) to reduce the size of a private key.

Original languageEnglish
Pages (from-to)1-38
Number of pages38
JournalDesigns, Codes, and Cryptography
DOIs
Publication statusAccepted/In press - 2016 Oct 17

Fingerprint

Identity-based Encryption
Difference Method
Cryptography
Subset
Revocation
Difference Scheme
Update
Composite materials
Composite

Keywords

  • Bilinear maps
  • Identity-based encryption
  • Key revocation
  • Revocable identity-based encryption
  • Subset difference method

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics

Cite this

Efficient revocable identity-based encryption via subset difference methods. / Lee, Kwangsu; Lee, Dong Hoon; Park, Jong Hwan.

In: Designs, Codes, and Cryptography, 17.10.2016, p. 1-38.

Research output: Contribution to journalArticle

@article{4753c265f8dc4633951462788225f5db,
title = "Efficient revocable identity-based encryption via subset difference methods",
abstract = "Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user’s credential (or private key) can be expired or revealed. revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme of Naor, Naor and Lotspiech (CRYPTO 2001) for key revocation. In this paper, we present a new technique for RIBE that uses the efficient subset difference (SD) scheme of Naor et al. instead of using the CS scheme to improve the size of update keys. Following our new technique, we first propose an efficient RIBE scheme in prime-order bilinear groups by combining the IBE scheme of Boneh and Boyen and the SD scheme and prove its selective security under the standard assumption. Our RIBE scheme is the first RIBE scheme in bilinear groups that has O(r) number of group elements in an update key where r is the number of revoked users. Next, we also propose another RIBE scheme in composite-order bilinear groups and prove its full security under static assumptions. Our RIBE schemes also can be integrated with the layered subset difference scheme of Halevy and Shamir (CRYPTO 2002) to reduce the size of a private key.",
keywords = "Bilinear maps, Identity-based encryption, Key revocation, Revocable identity-based encryption, Subset difference method",
author = "Kwangsu Lee and Lee, {Dong Hoon} and Park, {Jong Hwan}",
year = "2016",
month = "10",
day = "17",
doi = "10.1007/s10623-016-0287-3",
language = "English",
pages = "1--38",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Efficient revocable identity-based encryption via subset difference methods

AU - Lee, Kwangsu

AU - Lee, Dong Hoon

AU - Park, Jong Hwan

PY - 2016/10/17

Y1 - 2016/10/17

N2 - Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user’s credential (or private key) can be expired or revealed. revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme of Naor, Naor and Lotspiech (CRYPTO 2001) for key revocation. In this paper, we present a new technique for RIBE that uses the efficient subset difference (SD) scheme of Naor et al. instead of using the CS scheme to improve the size of update keys. Following our new technique, we first propose an efficient RIBE scheme in prime-order bilinear groups by combining the IBE scheme of Boneh and Boyen and the SD scheme and prove its selective security under the standard assumption. Our RIBE scheme is the first RIBE scheme in bilinear groups that has O(r) number of group elements in an update key where r is the number of revoked users. Next, we also propose another RIBE scheme in composite-order bilinear groups and prove its full security under static assumptions. Our RIBE schemes also can be integrated with the layered subset difference scheme of Halevy and Shamir (CRYPTO 2002) to reduce the size of a private key.

AB - Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user’s credential (or private key) can be expired or revealed. revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme of Naor, Naor and Lotspiech (CRYPTO 2001) for key revocation. In this paper, we present a new technique for RIBE that uses the efficient subset difference (SD) scheme of Naor et al. instead of using the CS scheme to improve the size of update keys. Following our new technique, we first propose an efficient RIBE scheme in prime-order bilinear groups by combining the IBE scheme of Boneh and Boyen and the SD scheme and prove its selective security under the standard assumption. Our RIBE scheme is the first RIBE scheme in bilinear groups that has O(r) number of group elements in an update key where r is the number of revoked users. Next, we also propose another RIBE scheme in composite-order bilinear groups and prove its full security under static assumptions. Our RIBE schemes also can be integrated with the layered subset difference scheme of Halevy and Shamir (CRYPTO 2002) to reduce the size of a private key.

KW - Bilinear maps

KW - Identity-based encryption

KW - Key revocation

KW - Revocable identity-based encryption

KW - Subset difference method

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

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

U2 - 10.1007/s10623-016-0287-3

DO - 10.1007/s10623-016-0287-3

M3 - Article

AN - SCOPUS:84991728199

SP - 1

EP - 38

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

ER -