A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage

B. Frikken, Keith and Wang, Shumiao and J. Atallah, Mikhail (2014) A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage. EAI Endorsed Transactions on Collaborative Computing, 1 (2). e3. ISSN 2312-8623

[thumbnail of cc.1.2.e3.pdf]
Available under License Creative Commons Attribution No Derivatives.

Download (1MB) | Preview


Security concerns are a substantial impediment to the wider deployment of cloud storage. There are two main concerns on the confidentiality of outsourced data: i) protecting the data, and ii) protecting the access pattern (i.e., which data is being accessed). To mitigate these concerns, schemes for Oblivious Storage (OS) have been proposed. In OS, the data owner outsources a key-value store to a cloud server, and then can later execute get, put, and remove queries, by collaboration with the server; furthermore, both the data and the access pattern are hidden from the server. In this paper, we extend the semantics of OS by proposing an oblivious index that supports nearest neighbor queries. That is, finding the nearest keys to the query in the key-value store. Our proposed index structure for supporting nearest-neighbor has similar performance bounds to previous OS schemes that did not support nearest-neighbor, in terms of client storage, server storage and rounds of communication.

Item Type: Article
Uncontrolled Keywords: Collaborative Cloud Storage, Oblivious Storage, Collaboration in Cloud Computing
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor IV
Date Deposited: 01 Jul 2021 11:53
Last Modified: 01 Jul 2021 11:53
URI: https://eprints.eudl.eu/id/eprint/4296

Actions (login required)

View Item
View Item