![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/8A687BA0-5CBB-414F-82E5-1D290D5060F1 | - |
| Αναγνωριστικό | https://dl.acm.org/citation.cfm?doid=2882903.2882911 | - |
| Αναγνωριστικό | https://doi.org/10.1145/2882903.2882911 | - |
| Γλώσσα | en | - |
| Μέγεθος | 14 pages | en |
| Τίτλος | Practical private range search revisited | en |
| Δημιουργός | Demertzis Ioannis | en |
| Δημιουργός | Δεμερτζης Ιωαννης | el |
| Δημιουργός | Papadopoulos Stavros | en |
| Δημιουργός | Papapetrou, Odysseas 1978- | en |
| Δημιουργός | Deligiannakis Antonios | en |
| Δημιουργός | Δεληγιαννακης Αντωνιος | el |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Εκδότης | Association for Computing Machinery | en |
| Περίληψη | 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 Databases 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 paper, 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 treelike indexes. 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 analytically detail the superiority of our proposals over prior work and experimentally confirm their practicality. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2018-10-11 | - |
| Ημερομηνία Δημοσίευσης | 2016 | - |
| Θεματική Κατηγορία | Information systems | en |
| Θεματική Κατηγορία | Security and privacy | en |
| Θεματική Κατηγορία | Database and storage security | en |
| Θεματική Κατηγορία | Data management systems | en |
| Θεματική Κατηγορία | Security services | en |
| Θεματική Κατηγορία | Database and storage security | en |
| Βιβλιογραφική Αναφορά | I. Demertzis, S. Papadopoulos, O. Papapetrou, A. Deligiannakis and M. Garofalakis, "Practical private range search revisited," in ACM SIGMOD International Conference on Management of Data, 2016, pp. 185-198. doi: 10.1145/2882903.2882911 | en |
Copyright © DIAS 2013
