Cryptology ePrint Archive: Report 2011/414
Fuzzy Identity Based Encryption from Lattices
Shweta Agrawal and Xavier Boyen and Vinod Vaikuntanathan and Panagiotis Voulgaris and Hoeteck Wee
Abstract: 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”.
Category / Keywords: public-key cryptography / Functional Encryption, Fuzzy IBE, Lattices, LWE
Date: received 1 Aug 2011
Contact author: shweta a at gmail com
Available format(s): PDF | BibTeX Citation
Version: 20110805:134321 (All versions of this report)
Short URL: ia.cr/2011/414
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]