Compact Inner Product Encryption from LWE

Predicate encryption provides fine-grained access control and has attractive applications. In this paper, We construct an compact inner product encryption scheme from the standard Learning with Errors (LWE) assumption that has compact public-key and achieves weakly attribute-hiding in the standard model. In particular, our scheme only needs two public matrices to support inner product over vector space \(\mathbb {Z}_q^{\log \lambda }\), and \((\lambda / \log \lambda )\) public matrices to support vector space \(\mathbb {Z}_q^{\lambda }\).