Paper 2015/927 Original: eprint.iacr.org/2015/927 ↗
Rich Queries on Encrypted Data: Beyond Exact Matches
Abstract
We extend the searchable symmetric encryption (SSE) protocol of [Cash et al., Crypto'13] adding support for range, substring, wildcard, and phrase queries, in addition to the Boolean queries supported in the original protocol. Our techniques apply to the basic single-client scenario underlying the common SSE setting as well as to the more complex Multi-Client and Outsourced Symmetric PIR extensions of [Jarecki et al., CCS'13]. We provide performance information based on our prototype implementation, showing the practicality and scalability of our techniques to very large databases, thus extending the performance results of [Cash et al., NDSS'14] to these rich and comprehensive query types.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2015-09-26: last updated
- 2015-09-26: published
- Short URL
- https://ia.cr/2015/927
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/927,
author = {Sky Faber and Stanislaw Jarecki and Hugo Krawczyk and Quan Nguyen and Marcel Rosu and Michael Steiner},
title = {Rich Queries on Encrypted Data: Beyond Exact Matches},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/927},
year = {2015},
url = {https://eprint.iacr.org/2015/927}
}