Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext
In this paper, we present the notion of recipient-revocable identity-based broadcast encryption scheme. In this notion, a content provider will produce encrypted content and send them to a third party (which is a broadcaster). This third party will be able to revoke some identities from the cipherte...
محفوظ في:
المؤلفون الرئيسيون: | , , , , , |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2016
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/7366 https://ink.library.smu.edu.sg/context/sis_research/article/8369/viewcontent/2897845.2897848.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
id |
sg-smu-ink.sis_research-8369 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-83692022-10-13T07:49:13Z Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext SUSILO, Willy YANG, Guomin CHEN, Rongmao MU, Yi GUO, Fuchun CHOW, Yang-Wai In this paper, we present the notion of recipient-revocable identity-based broadcast encryption scheme. In this notion, a content provider will produce encrypted content and send them to a third party (which is a broadcaster). This third party will be able to revoke some identities from the ciphertext. We present a security model to capture these requirements, as well as a concrete construction. The ciphertext consists of k + 3 group elements, assuming that the maximum number of revocation identities is k. That is, the ciphertext size is linear in the maximal size of R, where R is the revocation identity set. However, we say that the additional elements compared to that from an IBBE scheme are only for the revocation but not for decryption. Therefore, the ciphertext sent to the users for decryption will be of constant size (i.e.,3 group elements). Finally, we present the proof of security of our construction. 2016-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7366 info:doi/10.1145/2897845.2897848 https://ink.library.smu.edu.sg/context/sis_research/article/8369/viewcontent/2897845.2897848.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Constant Size Identity-based Broadcast Encryption Recipients Revocation Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Constant Size Identity-based Broadcast Encryption Recipients Revocation Information Security |
spellingShingle |
Constant Size Identity-based Broadcast Encryption Recipients Revocation Information Security SUSILO, Willy YANG, Guomin CHEN, Rongmao MU, Yi GUO, Fuchun CHOW, Yang-Wai Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
description |
In this paper, we present the notion of recipient-revocable identity-based broadcast encryption scheme. In this notion, a content provider will produce encrypted content and send them to a third party (which is a broadcaster). This third party will be able to revoke some identities from the ciphertext. We present a security model to capture these requirements, as well as a concrete construction. The ciphertext consists of k + 3 group elements, assuming that the maximum number of revocation identities is k. That is, the ciphertext size is linear in the maximal size of R, where R is the revocation identity set. However, we say that the additional elements compared to that from an IBBE scheme are only for the revocation but not for decryption. Therefore, the ciphertext sent to the users for decryption will be of constant size (i.e.,3 group elements). Finally, we present the proof of security of our construction. |
format |
text |
author |
SUSILO, Willy YANG, Guomin CHEN, Rongmao MU, Yi GUO, Fuchun CHOW, Yang-Wai |
author_facet |
SUSILO, Willy YANG, Guomin CHEN, Rongmao MU, Yi GUO, Fuchun CHOW, Yang-Wai |
author_sort |
SUSILO, Willy |
title |
Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
title_short |
Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
title_full |
Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
title_fullStr |
Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
title_full_unstemmed |
Recipient revocable identity-based broadcast encryption: How to revoke some recipients in IBBE without knowledge of the plaintext |
title_sort |
recipient revocable identity-based broadcast encryption: how to revoke some recipients in ibbe without knowledge of the plaintext |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2016 |
url |
https://ink.library.smu.edu.sg/sis_research/7366 https://ink.library.smu.edu.sg/context/sis_research/article/8369/viewcontent/2897845.2897848.pdf |
_version_ |
1770576326653116416 |