Revocable Identity-Based Encryption from Lattices

Jie Chen; Hoon Wei Lim; San Ling; Huaxiong Wang; Khoa Nguyen

Paper 2011/583

Revocable Identity-Based Encryption from Lattices

Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, and Khoa Nguyen

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.

Note: This work is concurrent but independent from the very recent proposal of lattice-based FIBE. http://eprint.iacr.org/2011/414.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Extended Version for the camera-ready version that will be published at ACISP 2012
Keywords: Lattice-based Cryptography Key Revocation Identity-based Encryption Functional Encryption
Contact author(s): s080001 @ e ntu edu sg
History: 2012-04-25: last of 3 revisions; 2011-11-02: received; See all versions
Short URL: https://ia.cr/2011/583
License: CC BY

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}
}