Paper 2015/927

Rich Queries on Encrypted Data: Beyond Exact Matches

Sky Faber, Stanislaw Jarecki, Hugo Krawczyk, Quan Nguyen, Marcel Rosu, and Michael Steiner

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
Published elsewhere. Minor revision.ESORICS'2015 20th European Symposium on Research in Computer Security},ESORICS 2015, Part II, LNCS 9327, pp. 123-145, 2015.
Keywords
Search on Encrypted DataSearchable Symmetric EncryptionSSE
Contact author(s)
hugo @ ee technion ac il
History
2015-09-26: received
Short URL
https://ia.cr/2015/927
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2015/927}},
      url = {https://eprint.iacr.org/2015/927}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.