Revocable Identity-based encryption from the Computational Diffie-Hellman problem

Ziyuan Hu, Shengli Liu, Kefei Chen, Joseph K. Liu

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Abstract

An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme was inspired by the IBE scheme proposed by Döttling and Garg in Crypto2017. Like Döttling and Garg’s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We proved that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings
EditorsWilly Susilo, Guomin Yang
Place of PublicationCham Switzerland
PublisherSpringer
Pages265-283
Number of pages19
ISBN (Electronic)9783319936383
ISBN (Print)9783319936376
DOIs
Publication statusPublished - 2018
EventAustralasian Conference on Information Security and Privacy 2018 - Wollongong, Australia
Duration: 11 Jul 201813 Jul 2018
Conference number: 23rd
https://ssl.informatics.uow.edu.au/acisp2018/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10946
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceAustralasian Conference on Information Security and Privacy 2018
Abbreviated titleACISP 2018
CountryAustralia
CityWollongong
Period11/07/1813/07/18
Internet address

Keywords

  • CDH assumption
  • Revocable identity-based encryption

Cite this

Hu, Z., Liu, S., Chen, K., & Liu, J. K. (2018). Revocable Identity-based encryption from the Computational Diffie-Hellman problem. In W. Susilo, & G. Yang (Eds.), Information Security and Privacy : 23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings (pp. 265-283). (Lecture Notes in Computer Science ; Vol. 10946). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-93638-3_16
Hu, Ziyuan ; Liu, Shengli ; Chen, Kefei ; Liu, Joseph K. / Revocable Identity-based encryption from the Computational Diffie-Hellman problem. Information Security and Privacy : 23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings. editor / Willy Susilo ; Guomin Yang. Cham Switzerland : Springer, 2018. pp. 265-283 (Lecture Notes in Computer Science ).
@inproceedings{ef358a61eeaf443993cad0feab673c91,
title = "Revocable Identity-based encryption from the Computational Diffie-Hellman problem",
abstract = "An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme was inspired by the IBE scheme proposed by D{\"o}ttling and Garg in Crypto2017. Like D{\"o}ttling and Garg’s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We proved that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.",
keywords = "CDH assumption, Revocable identity-based encryption",
author = "Ziyuan Hu and Shengli Liu and Kefei Chen and Liu, {Joseph K.}",
year = "2018",
doi = "10.1007/978-3-319-93638-3_16",
language = "English",
isbn = "9783319936376",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "265--283",
editor = "Willy Susilo and Guomin Yang",
booktitle = "Information Security and Privacy",

}

Hu, Z, Liu, S, Chen, K & Liu, JK 2018, Revocable Identity-based encryption from the Computational Diffie-Hellman problem. in W Susilo & G Yang (eds), Information Security and Privacy : 23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings. Lecture Notes in Computer Science , vol. 10946, Springer, Cham Switzerland, pp. 265-283, Australasian Conference on Information Security and Privacy 2018, Wollongong, Australia, 11/07/18. https://doi.org/10.1007/978-3-319-93638-3_16

Revocable Identity-based encryption from the Computational Diffie-Hellman problem. / Hu, Ziyuan; Liu, Shengli; Chen, Kefei; Liu, Joseph K.

Information Security and Privacy : 23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings. ed. / Willy Susilo; Guomin Yang. Cham Switzerland : Springer, 2018. p. 265-283 (Lecture Notes in Computer Science ; Vol. 10946).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Revocable Identity-based encryption from the Computational Diffie-Hellman problem

AU - Hu, Ziyuan

AU - Liu, Shengli

AU - Chen, Kefei

AU - Liu, Joseph K.

PY - 2018

Y1 - 2018

N2 - An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme was inspired by the IBE scheme proposed by Döttling and Garg in Crypto2017. Like Döttling and Garg’s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We proved that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.

AB - An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme was inspired by the IBE scheme proposed by Döttling and Garg in Crypto2017. Like Döttling and Garg’s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We proved that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.

KW - CDH assumption

KW - Revocable identity-based encryption

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

U2 - 10.1007/978-3-319-93638-3_16

DO - 10.1007/978-3-319-93638-3_16

M3 - Conference Paper

SN - 9783319936376

T3 - Lecture Notes in Computer Science

SP - 265

EP - 283

BT - Information Security and Privacy

A2 - Susilo, Willy

A2 - Yang, Guomin

PB - Springer

CY - Cham Switzerland

ER -

Hu Z, Liu S, Chen K, Liu JK. Revocable Identity-based encryption from the Computational Diffie-Hellman problem. In Susilo W, Yang G, editors, Information Security and Privacy : 23rd Australasian Conference, ACISP 2018 Wollongong, NSW, Australia, July 11–13, 2018 Proceedings. Cham Switzerland: Springer. 2018. p. 265-283. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-93638-3_16