Predicate Encryption for Multi-dimensional Range Queries from Lattices

Abstract. We construct a lattice-based predicate encryption scheme for multi-dimensional range and multidimensional subset queries. Our scheme is selectively secure and weakly attribute-hiding, and its security is based on the standard learning with errors (LWE) assumption. Multi-dimensional range and subset queries capture many interesting applications pertaining to searching on encrypted data. To the best of our knowledge, these are the first lattice-based predicate encryption schemes for functionalities beyond IBE and inner product.

• Type: Journal
• Year: 2015
• Where: PKC
• Authors: Romain Gay, Pierrick Méaux, Hoeteck Wee
• Keywords: Cryptology, PKC 2015