Oblivious Query Processing
Guardat en:
| Publicat a: | arXiv.org (Dec 14, 2013), p. n/a |
|---|---|
| Autor principal: | |
| Altres autors: | |
| Publicat: |
Cornell University Library, arXiv.org
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full text outside of ProQuest |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2085798624 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2085798624 | ||
| 045 | 0 | |b d20131214 | |
| 100 | 1 | |a Arasu, Arvind | |
| 245 | 1 | |a Oblivious Query Processing | |
| 260 | |b Cornell University Library, arXiv.org |c Dec 14, 2013 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Motivated by cloud security concerns, there is an increasing interest in database systems that can store and support queries over encrypted data. A common architecture for such systems is to use a trusted component such as a cryptographic co-processor for query processing that is used to securely decrypt data and perform computations in plaintext. The trusted component has limited memory, so most of the (input and intermediate) data is kept encrypted in an untrusted storage and moved to the trusted component on ``demand.'' In this setting, even with strong encryption, the data access pattern from untrusted storage has the potential to reveal sensitive information; indeed, all existing systems that use a trusted component for query processing over encrypted data have this vulnerability. In this paper, we undertake the first formal study of secure query processing, where an adversary having full knowledge of the query (text) and observing the query execution learns nothing about the underlying database other than the result size of the query on the database. We introduce a simpler notion, oblivious query processing, and show formally that a query admits secure query processing iff it admits oblivious query processing. We present oblivious query processing algorithms for a rich class of database queries involving selections, joins, grouping and aggregation. For queries not handled by our algorithms, we provide some initial evidence that designing oblivious (and therefore secure) algorithms would be hard via reductions from two simple, well-studied problems that are generally believed to be hard. Our study of oblivious query processing also reveals interesting connections to database join theory. | |
| 653 | |a Algorithms | ||
| 653 | |a Queries | ||
| 653 | |a Servers | ||
| 653 | |a Encryption | ||
| 653 | |a Microprocessors | ||
| 653 | |a Cloud computing | ||
| 653 | |a Cryptography | ||
| 653 | |a Query processing | ||
| 653 | |a Computer memory | ||
| 653 | |a Databases | ||
| 700 | 1 | |a Kaushik, Raghav | |
| 773 | 0 | |t arXiv.org |g (Dec 14, 2013), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2085798624/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1312.4012 |