Paper 2014/965

Predicate Encryption for Multi-Dimensional Range Queries from Lattices

Romain Gay, Pierrick Méaux, and Hoeteck Wee

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.

Metadata
Available format(s)
PDF
Publication info
A minor revision of an IACR publication in PKC 2015
Keywords
public-key cryptography
Contact author(s)
rgay @ di ens fr
History
2015-01-11: last of 5 revisions
2014-11-25: received
See all versions
Short URL
https://ia.cr/2014/965
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/965,
      author = {Romain Gay and Pierrick Méaux and Hoeteck Wee},
      title = {Predicate Encryption for Multi-Dimensional Range Queries from Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2014/965},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/965}},
      url = {https://eprint.iacr.org/2014/965}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.