Practical Private Range Search in Depth
| Autor: | Charalampos Papamanthou, Stavros Papadopoulos, Ioannis Demertzis, Odysseas Papapetrou, Minos Garofalakis, Antonios Deligiannakis |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Management and querying of encrypted data
Provable security Theoretical computer science Computer science Data management Privacy preserving range queries 0102 computer and information sciences 02 engineering and technology 01 natural sciences Searchable Encryption Security and privacy Set (abstract data type) 020204 information systems 0202 electrical engineering electronic engineering information engineering Data management systems Structure (mathematical logic) Symmetric cryptography and hash functions Economic and social effects RSSE business.industry Private range search Construct (python library) Range (mathematics) Symmetric-key algorithm 010201 computation theory & mathematics Search engines Private Range Search Searchable encryption business Information Systems |
| Zdroj: | ACM Transactions on Database Systems |
| ISSN: | 1557-4644 0362-5915 |
| DOI: | 10.1145/3167971 |
| Popis: | We consider a data owner that outsources its dataset to an untrusted server . The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes on “practical” private range search (mainly in database venues) that attempt to strike a trade-off between efficiency and security. Nevertheless, these methods either lack provable security guarantees or permit unacceptable privacy leakages. In this article, we take an interdisciplinary approach, which combines the rigor of security formulations and proofs with efficient data management techniques. We construct a wide set of novel schemes with realistic security/performance trade-offs, adopting the notion of Searchable Symmetric Encryption (SSE), primarily proposed for keyword search. We reduce range search to multi-keyword search using range-covering techniques with tree-like indexes, and formalize the problem as Range Searchable Symmetric Encryption (RSSE). We demonstrate that, given any secure SSE scheme, the challenge boils down to (i) formulating leakages that arise from the index structure and (ii) minimizing false positives incurred by some schemes under heavy data skew . We also explain an important concept in the recent SSE bibliography, namely locality , and design generic and specialized ways to attribute locality to our RSSE schemes. Moreover, we are the first to devise secure schemes for answering range aggregate queries, such as range sums and range min/max. We analytically detail the superiority of our proposals over prior work and experimentally confirm their practicality. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|