Abstract
Up to now, there was very little work on studying the revocation problem in existing hierarchical ID-based encryption (HIBE) systems. Certainly, all existing HIBE systems may inherit the revocation method suggested by Boneh and Franklin to revoke illegal or expired users, in which non-revoked users must periodically update their private keys using secure channels by contacting their ancestors in hierarchical structures. In this paper, we propose the first HIBE scheme with public revocation mechanism, called revocable HIBE (RHIBE), which is extended from Lewko and Waters's unbounded HIBE scheme presented in Eurocrypt 2011. We demonstrate that the proposed RHIBE scheme is fully secure while removing the requirement of secure channels for private key updating in Boneh and Franklin's revocation method. The public revocation mechanism is an exciting alternative to the existing revocation methods. Finally, we discuss the transformation technique from a HIBE scheme to a RHIBE scheme and employ it to another well-known HIBE scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 299-326 |
| Number of pages | 28 |
| Journal | Informatica (Netherlands) |
| Volume | 25 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2014 Jan 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Applied Mathematics
Cite this
}
RHIBE : Constructing revocable hierarchical ID-based encryption from HIBE. / Tsai, Tung Tso; Tseng, Yuh-Min; Wu, Tsu Yang.
In: Informatica (Netherlands), Vol. 25, No. 2, 01.01.2014, p. 299-326.Research output: Contribution to journal › Article
TY - JOUR
T1 - RHIBE
T2 - Constructing revocable hierarchical ID-based encryption from HIBE
AU - Tsai, Tung Tso
AU - Tseng, Yuh-Min
AU - Wu, Tsu Yang
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Up to now, there was very little work on studying the revocation problem in existing hierarchical ID-based encryption (HIBE) systems. Certainly, all existing HIBE systems may inherit the revocation method suggested by Boneh and Franklin to revoke illegal or expired users, in which non-revoked users must periodically update their private keys using secure channels by contacting their ancestors in hierarchical structures. In this paper, we propose the first HIBE scheme with public revocation mechanism, called revocable HIBE (RHIBE), which is extended from Lewko and Waters's unbounded HIBE scheme presented in Eurocrypt 2011. We demonstrate that the proposed RHIBE scheme is fully secure while removing the requirement of secure channels for private key updating in Boneh and Franklin's revocation method. The public revocation mechanism is an exciting alternative to the existing revocation methods. Finally, we discuss the transformation technique from a HIBE scheme to a RHIBE scheme and employ it to another well-known HIBE scheme.
AB - Up to now, there was very little work on studying the revocation problem in existing hierarchical ID-based encryption (HIBE) systems. Certainly, all existing HIBE systems may inherit the revocation method suggested by Boneh and Franklin to revoke illegal or expired users, in which non-revoked users must periodically update their private keys using secure channels by contacting their ancestors in hierarchical structures. In this paper, we propose the first HIBE scheme with public revocation mechanism, called revocable HIBE (RHIBE), which is extended from Lewko and Waters's unbounded HIBE scheme presented in Eurocrypt 2011. We demonstrate that the proposed RHIBE scheme is fully secure while removing the requirement of secure channels for private key updating in Boneh and Franklin's revocation method. The public revocation mechanism is an exciting alternative to the existing revocation methods. Finally, we discuss the transformation technique from a HIBE scheme to a RHIBE scheme and employ it to another well-known HIBE scheme.
UR - http://www.scopus.com/inward/record.url?scp=84919399256&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84919399256&partnerID=8YFLogxK
U2 - 10.15388/Informatica.2014.16
DO - 10.15388/Informatica.2014.16
M3 - Article
AN - SCOPUS:84919399256
VL - 25
SP - 299
EP - 326
JO - Informatica
JF - Informatica
SN - 0868-4952
IS - 2
ER -