Cryptology ePrint Archive: Report 2011/583

Revocable Identity-Based Encryption from Lattices

Jie Chen and Hoon Wei Lim and San Ling and 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.

Category / Keywords: public-key cryptography / Lattice-based Cryptography, Key Revocation, Identity-based Encryption, Functional Encryption

Publication Info: Extended Version for the camera-ready version that will be published at ACISP 2012

Date: received 27 Oct 2011, last revised 25 Apr 2012

Contact author: s080001 at e ntu edu sg

Available format(s): PDF | BibTeX Citation

Note: This work is concurrent but independent from the very recent proposal of lattice-based FIBE.

Version: 20120425:171652 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]