Paper 2011/414

Fuzzy Identity Based Encryption from Lattices

Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, and Hoeteck Wee


Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the standard Learning With Errors (LWE) problem. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We discuss why further extensions are not as easy as they may seem. As such, ours is among the first examples of advanced-functionality cryptosystem from lattices that goes “beyond IBE”.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Functional EncryptionFuzzy IBELatticesLWE
Contact author(s)
shweta a @ gmail com
2011-08-05: received
Short URL
Creative Commons Attribution


      author = {Shweta Agrawal and Xavier Boyen and Vinod Vaikuntanathan and Panagiotis Voulgaris and Hoeteck Wee},
      title = {Fuzzy Identity Based Encryption from Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2011/414},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.