Paper 2011/583 Original: eprint.iacr.org/2011/583 ↗
Revocable Identity-Based Encryption from Lattices
Abstract
In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices. Moreover, our key revocation techniques from lattices can be applied to obtain revocable functional encryption schemes in the similar setting.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2012-04-25: last updated
- 2011-11-02: published
- Short URL
- https://ia.cr/2011/583
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/583,
author = {Jie Chen and Hoon Wei Lim and San Ling and Huaxiong Wang and Khoa Nguyen},
title = {Revocable Identity-Based Encryption from Lattices},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/583},
year = {2011},
url = {https://eprint.iacr.org/2011/583}
}