Paper 2014/132
Efficient Revocable Identity-Based Encryption via Subset Difference Methods
Kwangsu Lee, Dong Hoon Lee, and Jong Hwan Park
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
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Designs, Codes and Cryptography
- DOI
- 10.1007/s10623-016-0287-3
- Keywords
- Identity-based encryptionRevocable identity-based encryptionKey revocationSubset difference methodBilinear maps
- Contact author(s)
- kwangsu @ sejong ac kr
- History
- 2016-09-30: revised
- 2014-02-24: received
- See all versions
- Short URL
- https://ia.cr/2014/132
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/132, author = {Kwangsu Lee and Dong Hoon Lee and Jong Hwan Park}, title = {Efficient Revocable Identity-Based Encryption via Subset Difference Methods}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/132}, year = {2014}, doi = {10.1007/s10623-016-0287-3}, url = {https://eprint.iacr.org/2014/132} }