We present the idea of externally verifiable oblivious RAM (ORAM). Our goal is to allow a client and server carrying out an ORAM protocol to have disputes adjudicated by a third party, allowing for the enforcement of penalties against an unreliable or malicious server. We give a security definition that guarantees protection not only against a malicious server but also against a client making f...

State-of-the-art mechanisms for oblivious RAM (ORAM) suffer from significant bandwidth overheads (greater than 100x) that impact the throughput and latency of memory accesses. This renders their deployment in high-performance and bandwidth-constrained applications difficult, motivating the design of lowoverhead approaches for memory access obfuscation. We introduce and formalize the notion of a...

We show that the programs of any classical (as opposed to parallel or interactive) computation model or programming language that satisfies natural postulates of effectiveness (which specialize Gurevich’s Sequential Postulates) can be simulated by a random access machine (RAM) with only constant overhead. In essence, the effectiveness postulates assert the following: states can be represented a...

Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design and secure multi-party computation for big data. Unfortunately, due to a well-known logarithmic lower bound by Goldreich and Ostrovsky (Journal of th...

We introduce WORM-ORAM, a first mechanism that combines Oblivious RAM (ORAM) access privacy and data confidentiality with Write Once Read Many (WORM) regulatory data retention guarantees. Clients can outsource their database to a server with full confidentiality and data access privacy, and, for data retention, the server ensures client access WORM semantics. In general simple confidentiality a...

There have been several attempts recently at using homomorphic encryption to increase the efficiency of Oblivious RAM protocols. One of the most successful has been Onion ORAM, which achieves O(1) communication overhead with polylogarithmic server computation. However, it has a number of drawbacks. It requires a very large block size of B = Ω(log N), with large constants. Although it needs only...

In the setting of cloud computing a user wishes to delegate its data, as well as computations over this data, to a cloud provider. Each computation may read and modify the data, and these modifications should persist between computations. Minding the computational resources of the cloud, delegated computations are modeled as RAM programs. In particular, the delegated computations’ running time ...

T ypical enterprise IT environments consist of numerous independent and distributed servers, networks, and storage devices. To improve efficiency, customers increasingly seek to bring these disparate systems under one umbrella of control. Utility computing facilitates this effort by aggregating such systems into a single, centrally managed pool of resources. To adequately address user expectati...

We investigate the role of ram pressure stripping in the Virgo cluster using N-body simulations. Radial orbits within the Virgo cluster's gravitational potential are modeled and analyzed with respect to ram pressure stripping. The N-body model consists of 10 000 gas cloud complexes which can have inelastic collisions. Ram pressure is modeled as an additional acceleration on the clouds located a...

High capacity Last Level Cache (LLC) architectures have been proposed to mitigate the widening processor-memory speed gap. These LLC architectures have been realized using DRAM or SpinTransfer-Torque Random Access Memory (STT-RAM) memory technologies. It has been shown that STT-RAM LLC provides improved energy efficiency compared to DRAM LLC. However, existing STT-RAM LLC suffers from increased...