Visible to the public Poly-Logarithmic Range Queries on Encrypted Data with Small Leakage

TitlePoly-Logarithmic Range Queries on Encrypted Data with Small Leakage
Publication TypeConference Paper
Year of Publication2016
AuthorsHahn, Florian, Kerschbaum, Florian
Conference NameProceedings of the 2016 ACM on Cloud Computing Security Workshop
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4572-9
Keywordsandroid, android encryption, Collaboration, Encrypted database, Encryption, Human Behavior, iOS encryption, Metrics, outsourced database security, pubcrawl, Resiliency, Scalability, Searchable encryption, secure computation

Privacy-preserving range queries allow encrypting data while still enabling queries on ciphertexts if their corresponding plaintexts fall within a requested range. This provides a data owner the possibility to outsource data collections to a cloud service provider without sacrificing privacy nor losing functionality of filtering this data. However, existing methods for range queries either leak additional information (like the ordering of the complete data set) or slow down the search process tremendously by requiring to query each ciphertext in the data collection. We present a novel scheme that only leaks the access pattern while supporting amortized poly-logarithmic search time. Our construction is based on the novel idea of enabling the cloud service provider to compare requested range queries. By doing so, the cloud service provider can use the access pattern to speed-up search time for range queries in the future. On the one hand, values that have fallen within a queried range, are stored in an interactively built index for future requests. On the other hand, values that have not been queried do not leak any information to the cloud service provider and stay perfectly secure. In order to show its practicability we have implemented our scheme and give a detailed runtime evaluation.

Citation Keyhahn_poly-logarithmic_2016