×

Functional encryption for inner product predicates from learning with errors. (English) Zbl 1227.94023

Lee, Dong Hoon (ed.) et al., Advances in cryptology – ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25384-3/pbk). Lecture Notes in Computer Science 7073, 21-40 (2011).
Summary: 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 S. Agrawal, D. Boneh and X. Boyen [“Efficient lattice (H)IBE in the standard model”, Lect. Notes Comput. Sci. 6110, 553–572 (2010; Zbl 1227.94022)]. Our scheme is weakly attribute hiding in the standard model.
For the entire collection see [Zbl 1227.94002].

MSC:

94A60 Cryptography

Citations:

Zbl 1227.94022
PDFBibTeX XMLCite
Full Text: DOI