Pith. sign in

REVIEW 3 cited by

ObliDB: Oblivious Query Processing for Secure Databases

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.00458 v6 pith:EQ56E4XF submitted 2017-10-02 cs.CR

classification cs.CR
keywords obliviousoblidbenclavesqueriesqueryaccessanalyticsdata
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Hardware enclaves such as Intel SGX are a promising technology for improving the security of databases outsourced to the cloud. These enclaves provide an execution environment isolated from the hypervisor/OS, and encrypt data in RAM. However, for applications that use large amounts of memory, including most databases, enclaves do not protect against access pattern leaks, which let attackers gain a large amount of information about the data. Moreover,the naive way to address this issue, using Oblivious RAM (ORAM) primitives from the security literature, adds substantial overhead. A number of recent works explore trusted hardware enclaves as a path toward secure, access-pattern oblivious outsourcing of data storage and analysis. While these works efficiently solve specific subproblems (e.g. building secure indexes or running analytics queries that always scan entire tables), no prior work has supported oblivious query processing for general query workloads on a DBMS engine with multiple access methods. Moreover, applying these techniques individually does not guarantee that an end-to-end workload, such as a complex SQL query over multiple tables, will be oblivious. In this paper, we introduce ObliDB, an oblivious database engine design that is the first system to provide obliviousness for general database read workloads over multiple access methods. ObliDB supports a broad range of queries, including aggregation, joins, insertions, deletions and point queries. We implement ObliDB and show that, on analytics work-loads, ObliDB ranges from 1.1-19x faster than Opaque,a previous oblivious, enclave-based system designed only for analytics, and comes within 2.6x of Spark SQL. ObliDB supports point queries with 3-10ms latency, which runs over 7x faster than HIRB, a previous encryption-based oblivious index system.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Pacer: Comprehensive Network Side-Channel Mitigation in the Cloud

    cs.CR 2019-08 conditional novelty 7.0 of 10

    Pacer is a hypervisor-and-guest defense that pads and paces all outgoing VM traffic to a secret-independent schedule, with a formal noninterference proof and measured moderate overheads.

  2. SGX-LKL: Securing the Host OS Interface for Trusted Execution

    cs.OS 2019-08 conditional novelty 6.0 of 10

    SGX-LKL runs unmodified Linux binaries in SGX enclaves behind a minimal 7-call (8 on SGX v1) host interface with encrypted and shuffled disk I/O.

  3. A Tale of Two Trees: One Writes, and Other Reads. Optimized Oblivious Accesses to Large-Scale Blockchains

    cs.CR 2019-09 reject novelty 5.0 of 10

    T3 combines SGX and a two-tree ORAM to give Bitcoin SPV clients privacy-preserving UTXO lookups with sub-millisecond to 2.4 ms reads in simulation, but its privacy argument has a multi-client linkability gap.

Pith tools