Paper 2011/410 Original: eprint.iacr.org/2011/410 ↗
Functional Encryption for Inner Product Predicates from Learning with Errors
Abstract
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the "learning with errors" (LWE) problem. This construction allows us to achieve applications such as range and subset queries, polynomial evaluation, and CNF/DNF formulas on encrypted data. Our scheme supports inner products over small fields, in contrast to earlier works based on bilinear maps. Our construction is the first functional encryption scheme based on lattice techniques that goes beyond basic identity-based encryption. The main technique in our scheme is a novel twist to the identity-based encryption scheme of Agrawal, Boneh and Boyen (Eurocrypt 2010).
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2011-08-16: last updated
- 2011-08-01: published
- Short URL
- https://ia.cr/2011/410
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/410,
author = {Shweta Agrawal and David Mandell Freeman and Vinod Vaikuntanathan},
title = {Functional Encryption for Inner Product Predicates from Learning with Errors},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/410},
year = {2011},
url = {https://eprint.iacr.org/2011/410}
}