Paper 2013/495
Revocable IBE Systems with Almost Constant-size Key Update
Le Su, Hoon Wei Lim, San Ling, and Huaxiong Wang
Abstract
Identity-based encryption (IBE) has been regarded as an attractive alternative to more conventional certificate-based public key systems. It has recently attracted not only considerable research from the academic community, but also interest from the industry and standardization bodies. However, while key revocation is a fundamental requirement to any public key systems, not much work has been done in the identity-based setting. In this paper, we continue the study of revocable IBE (RIBE) initiated by Boldyreva, Goyal, and Kumar. Their proposal of a selective secure RIBE scheme, and a subsequent construction by Libert and Vergnaud in a stronger adaptive security model are based on a binary tree approach, such that their key update size is logarithmic in the number of users. We ask the question of whether or not the key update size could be further reduced by using a cryptographic accumulator. We show that, indeed, the key update material can be made constant with some small amount of auxiliary information, through a novel combination of the Lewko and Waters IBE scheme and the Camenisch, Kohlweiss, and Soriente pairing-based dynamic accumulator.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. Pairing 2013
- Keywords
- identity-based encryptionrevocationaccumulatoradaptive security
- Contact author(s)
- lsu1 @ e ntu edu sg
- History
- 2013-11-20: revised
- 2013-08-15: received
- See all versions
- Short URL
- https://ia.cr/2013/495
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/495,
author = {Le Su and Hoon Wei Lim and San Ling and Huaxiong Wang},
title = {Revocable {IBE} Systems with Almost Constant-size Key Update},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/495},
year = {2013},
url = {https://eprint.iacr.org/2013/495}
}
