IACR News item: 26 November 2014
Romain Gay, Pierrick Méaux, Hoeteck Wee
ePrint Report
We construct a lattice-based predicate encryption scheme for
multi-dimensional range and multi-dimensional 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.
Additional news items may be found on the IACR news page.