Functional encryption for threshold functions (or fuzzy IBE) from lattices

Agrawal, Shweta, Boyen, Xavier, Vaikuntanathan, Vinod, Voulgaris, Panagiotis, & Wee, Hoeteck (2012) Functional encryption for threshold functions (or fuzzy IBE) from lattices. Lecture Notes in Computer Science : Public Key Cryptography – PKC 2012, 7293, pp. 280-297.

View at publisher


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 Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions 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 also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE).

Impact and interest:

37 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

147 since deposited on 26 Mar 2014
26 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 69167
Item Type: Journal Article
Refereed: Yes
Additional Information: Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012.
Keywords: Data encryption, Computer communication network, Management of computing and information systems, Algorithm analysis and problem complexity, Systems and data security
DOI: 10.1007/978-3-642-30057-8_17
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2012 International Association for Cryptologic Research 2012
Deposited On: 26 Mar 2014 02:08
Last Modified: 02 Jul 2017 22:09

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page