Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list

Joseph K. Liu, Tsz Hon Yuen, Peng Zhang, Kaitai Liang

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

7 Citations (Scopus)

Abstract

In this paper, we propose an efficient revocable Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme. We base on the direct revocation approach, by embedding the revocation list into ciphertext. However, since the revocation list will grow longer as time goes by, we further leverage this by proposing a secret key time validation technique so that users will have their keys expired on a date and the revocation list only needs to include those user keys revoked before their intended expired date (e.g. those user keys which have been stolen before expiry). These keys can be removed from the revocation list after their expiry date in order to keep the revocation list short, as these keys can no longer be used to decrypt ciphertext generated after their expiry time. This technique is derived from Hierarchical Identity-based Encryption (HIBE) mechanism and thus time periods are in hierarchical structure: year, month, day. Users with validity of the whole year can decrypt any ciphertext associated with time period of any month or any day within the year. By using this technique, the size of public parameters and user secret key can be greatly reduced. A bonus advantage of this technique is the support of discontinuity of user validity (e.g. taking no-paid leave).

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security
Subtitle of host publication16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings
EditorsBart Preneel, Frederik Vercauteren
Place of PublicationCham Switzerland
PublisherSpringer
Pages516-534
Number of pages19
ISBN (Electronic)9783319933870
ISBN (Print)9783319933863
DOIs
Publication statusPublished - 2018
EventInternational Conference on Applied Cryptography and Network Security 2018 - Leuven, Belgium
Duration: 2 Jul 20184 Jul 2018
Conference number: 16th
https://www.cosic.esat.kuleuven.be/events/acns2018/

Publication series

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

Conference

ConferenceInternational Conference on Applied Cryptography and Network Security 2018
Abbreviated titleACNS 2018
CountryBelgium
CityLeuven
Period2/07/184/07/18
Internet address

Cite this

Liu, J. K., Yuen, T. H., Zhang, P., & Liang, K. (2018). Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list. In B. Preneel, & F. Vercauteren (Eds.), Applied Cryptography and Network Security: 16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings (pp. 516-534). (Lecture Notes in Computer Science ; Vol. 10892 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-93387-0_27
Liu, Joseph K. ; Yuen, Tsz Hon ; Zhang, Peng ; Liang, Kaitai. / Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list. Applied Cryptography and Network Security: 16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings. editor / Bart Preneel ; Frederik Vercauteren. Cham Switzerland : Springer, 2018. pp. 516-534 (Lecture Notes in Computer Science ).
@inproceedings{c75294ed6cea459faf914e0c5fa0913e,
title = "Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list",
abstract = "In this paper, we propose an efficient revocable Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme. We base on the direct revocation approach, by embedding the revocation list into ciphertext. However, since the revocation list will grow longer as time goes by, we further leverage this by proposing a secret key time validation technique so that users will have their keys expired on a date and the revocation list only needs to include those user keys revoked before their intended expired date (e.g. those user keys which have been stolen before expiry). These keys can be removed from the revocation list after their expiry date in order to keep the revocation list short, as these keys can no longer be used to decrypt ciphertext generated after their expiry time. This technique is derived from Hierarchical Identity-based Encryption (HIBE) mechanism and thus time periods are in hierarchical structure: year, month, day. Users with validity of the whole year can decrypt any ciphertext associated with time period of any month or any day within the year. By using this technique, the size of public parameters and user secret key can be greatly reduced. A bonus advantage of this technique is the support of discontinuity of user validity (e.g. taking no-paid leave).",
author = "Liu, {Joseph K.} and Yuen, {Tsz Hon} and Peng Zhang and Kaitai Liang",
year = "2018",
doi = "10.1007/978-3-319-93387-0_27",
language = "English",
isbn = "9783319933863",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "516--534",
editor = "Bart Preneel and Frederik Vercauteren",
booktitle = "Applied Cryptography and Network Security",

}

Liu, JK, Yuen, TH, Zhang, P & Liang, K 2018, Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list. in B Preneel & F Vercauteren (eds), Applied Cryptography and Network Security: 16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings. Lecture Notes in Computer Science , vol. 10892 , Springer, Cham Switzerland, pp. 516-534, International Conference on Applied Cryptography and Network Security 2018, Leuven, Belgium, 2/07/18. https://doi.org/10.1007/978-3-319-93387-0_27

Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list. / Liu, Joseph K.; Yuen, Tsz Hon; Zhang, Peng; Liang, Kaitai.

Applied Cryptography and Network Security: 16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings. ed. / Bart Preneel; Frederik Vercauteren. Cham Switzerland : Springer, 2018. p. 516-534 (Lecture Notes in Computer Science ; Vol. 10892 ).

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

TY - GEN

T1 - Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list

AU - Liu, Joseph K.

AU - Yuen, Tsz Hon

AU - Zhang, Peng

AU - Liang, Kaitai

PY - 2018

Y1 - 2018

N2 - In this paper, we propose an efficient revocable Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme. We base on the direct revocation approach, by embedding the revocation list into ciphertext. However, since the revocation list will grow longer as time goes by, we further leverage this by proposing a secret key time validation technique so that users will have their keys expired on a date and the revocation list only needs to include those user keys revoked before their intended expired date (e.g. those user keys which have been stolen before expiry). These keys can be removed from the revocation list after their expiry date in order to keep the revocation list short, as these keys can no longer be used to decrypt ciphertext generated after their expiry time. This technique is derived from Hierarchical Identity-based Encryption (HIBE) mechanism and thus time periods are in hierarchical structure: year, month, day. Users with validity of the whole year can decrypt any ciphertext associated with time period of any month or any day within the year. By using this technique, the size of public parameters and user secret key can be greatly reduced. A bonus advantage of this technique is the support of discontinuity of user validity (e.g. taking no-paid leave).

AB - In this paper, we propose an efficient revocable Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme. We base on the direct revocation approach, by embedding the revocation list into ciphertext. However, since the revocation list will grow longer as time goes by, we further leverage this by proposing a secret key time validation technique so that users will have their keys expired on a date and the revocation list only needs to include those user keys revoked before their intended expired date (e.g. those user keys which have been stolen before expiry). These keys can be removed from the revocation list after their expiry date in order to keep the revocation list short, as these keys can no longer be used to decrypt ciphertext generated after their expiry time. This technique is derived from Hierarchical Identity-based Encryption (HIBE) mechanism and thus time periods are in hierarchical structure: year, month, day. Users with validity of the whole year can decrypt any ciphertext associated with time period of any month or any day within the year. By using this technique, the size of public parameters and user secret key can be greatly reduced. A bonus advantage of this technique is the support of discontinuity of user validity (e.g. taking no-paid leave).

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

U2 - 10.1007/978-3-319-93387-0_27

DO - 10.1007/978-3-319-93387-0_27

M3 - Conference Paper

SN - 9783319933863

T3 - Lecture Notes in Computer Science

SP - 516

EP - 534

BT - Applied Cryptography and Network Security

A2 - Preneel, Bart

A2 - Vercauteren, Frederik

PB - Springer

CY - Cham Switzerland

ER -

Liu JK, Yuen TH, Zhang P, Liang K. Time-based direct revocable Ciphertext-Policy Attribute-Based Encryption with short revocation list. In Preneel B, Vercauteren F, editors, Applied Cryptography and Network Security: 16th International Conference, ACNS 2018 Leuven, Belgium, July 2–4, 2018 Proceedings. Cham Switzerland: Springer. 2018. p. 516-534. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-93387-0_27