Paper 2011/410

Functional Encryption for Inner Product Predicates from Learning with Errors

Shweta Agrawal, David Mandell Freeman, and Vinod Vaikuntanathan


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).

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Extended abstract to appear in Asiacrypt 2011
predicate encryptionfunctional encryptionlatticeslearning with errors
Contact author(s)
vinodv @ cs toronto edu
2011-08-16: last of 2 revisions
2011-08-01: received
See all versions
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.