oblivious ram
A Low-Latency, Low-Area Hardware Oblivious RAM Controller
... Oblivious RAM (ORAM), introduced by Goldreich and Os- trovsky [10], [11], is a cryptographic primitive that completely eliminates the information leakage from a program’s memory access trace, ...
8
Write-Only Oblivious RAM based Privacy-Preserved Access of Outsourced Data
... Since the database size in most experiments reported by the ORAM and PIR literatures is not more than 1TB, let’s assume the database size is 1TB in the performance estimation. To the best of our knowledge, ObliviStore ...
27
Is there an Oblivious RAM Lower Bound for Online Reads?
... An Oblivious RAM (ORAM), first introduced by Goldreich and Ostrovsky [Gol87, Ost90, GO96], is a scheme that allows a client to read and write to his data stored on untrusted storage, while entirely hiding ...
42
Yes, There is an Oblivious RAM Lower Bound!
... an oblivious RAM lower bound?”, there are two caveats with the lower bound of Goldreich and Ostrovsky: (1) it only applies to “balls in bins” algorithms, ...
21
Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
... be the experiment of first throwing N balls into N buckets once and then pick- ing up a random ball from a random bucket and moving it to a new random bucket t times. This experiment expresses the actual movement of data ...
26
PanORAMa: Oblivious RAM with Logarithmic Overhead
... of Oblivious RAM (ORAM) considers the question of how to enable a client to outsource its database to an untrusted server and to query it subsequently without any privacy leakage related to the queries and ...
36
A Simple Recursive Tree Oblivious RAM
... Oblivious RAM (ORAM) has received increasing attention in the past few ...ious RAM is to enable a client, that can locally store only a small (preferably constant) amount of data, to store remotely N ...
14
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
... an Oblivious RAM (ORAM) with constant worst-case bandwidth blowup that leverages poly-logarithmic server computation to circumvent the logarithmic lower bound on ORAM bandwidth ...
31
Dynamic Proofs of Retrievability via Oblivious RAM
... ORAM. Oblivious RAM (ORAM), initially defined by Goldreich and Ostrovsky [13], allows a client to outsource her memory to a remote server while allowing the client to perform random-access reads and writes ...
28
Constants Count: Practical Improvements to Oblivious RAM
... Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as seen by untrusted storage. This paper proposes Ring ORAM, the most bandwidth-efficient ORAM scheme for the small client ...
16
The Fallacy of Composition of Oblivious RAM and Searchable Encryption
... Oblivious RAM (ORAM) enables accessing the memory with- out leaking the access ...ous RAM” on the Google Scholar returns 671 articles, 565 of them published since ...
10
PRO-ORAM: Constant Latency Read-Only Oblivious RAM
... using Oblivious RAM (ORAM) ...guarantee oblivious- ness in a trusted client and an untrusted server ...perform oblivious shuffling and re-encryption of the encrypted ...
15
Is There an Oblivious RAM Lower Bound?
... An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (JACM 1996), is a (probabilistic) RAM that hides its access pattern, i.e. for every input the observed locations accessed are similarly ...
29
Resizable Tree-Based Oblivious RAM
... Oblivious RAM was introduced by Goldreich and Ostrovsky [7]. Much work [2– 11, 13–20] has been published to reduce the communication complexity between client and storage. Early schemes were able to ...
20
TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption
... Works with linear worst-case complexity. Williams and Sion [38] and Fletcher et al. [10] devise round-optimal ORAM schemes that are efficient in an amortized sense, yet their worst-case bandwidth overhead is at least ...
29
Toward Robust Hidden Volumes using Write-Only Oblivious RAM
... With sensitive data being increasingly stored on mobile devices and laptops, hard disk encryption is more important than ever. In partic- ular, being able to plausibly deny that a hard disk contains certain information ...
12
Octopus ORAM: An Oblivious RAM with Communication and Server Storage Efficiency
... Index-based ORAMs [3–6, 8, 9, 20–26, 29–31, 34– 39, 46] use index table for data lookup. They require the client to either store the index table locally, or outsource it to the server recursively in a way similar to ...
18
Multi-Client Oblivious RAM secure against Malicious Servers
... Finally, an interesting application comes from the release of Intel’s new SGX- enabled processors. SGX enables a trusted enclave to run protected code which cannot be examined from the outside, even by the operating ...
23
Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM
... On the other hand, the level-rebuild-style shuffling strategy of hierarchical ORAMs have certain desirable properties. In particular, Williams and Sion show a technique to construct a single online roundtrip ORAM [44], ...
33
OptORAMa: Optimal Oblivious RAM
... [12,31,33,40,41,53]. Oblivious simulation of a (non-reactive) ...as oblivious sorting, oblivious shuffling of memory contents, and more, and then define more complex primitives by composing the ...
75