Abstract
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.
Cite
CITATION STYLE
Gay, R., Méaux, P., & Wee, H. (2015). Predicate encryption for multi-dimensional range queries from lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9020, pp. 752–776). Springer Verlag. https://doi.org/10.1007/978-3-662-46447-2_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
