Revocable identity-based encryption from lattices

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

73 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication17th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9-11, 2012. Proceedings
EditorsWilly Susilo, Yi Mu, Jennifer Seberry
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages14
ISBN (Electronic)9783642314483
ISBN (Print)9783642314476
Publication statusPublished - 2012
Externally publishedYes
Event17th Australasian Conference on Information Security and Privacy, ACISP 2012 - Wollongong, NSW, Australia
Duration: 9 Jul 201211 Jul 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other17th Australasian Conference on Information Security and Privacy, ACISP 2012
CityWollongong, NSW


  • Identity-based Encryption
  • Key Revocation
  • Lattice-based Cryptography


Dive into the research topics of 'Revocable identity-based encryption from lattices'. Together they form a unique fingerprint.

Cite this