Cryptology ePrint Archive: Report 2015/927

Rich Queries on Encrypted Data: Beyond Exact Matches

Sky Faber and Stanislaw Jarecki and Hugo Krawczyk and Quan Nguyen and 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.

Category / Keywords: cryptographic protocols / Search on Encrypted Data, Searchable Symmetric Encryption, SSE

Original Publication (with minor differences): ESORICS'2015 20th European Symposium on Research in Computer Security},ESORICS 2015, Part II, LNCS 9327, pp. 123-145, 2015.

Date: received 22 Sep 2015, last revised 26 Sep 2015

Contact author: hugo at ee technion ac il

Available format(s): PDF | BibTeX Citation

Version: 20150926:160926 (All versions of this report)

Short URL: ia.cr/2015/927