Software protection and simulation on oblivious RAMs

By Rafail M. Ostrovsky. 1996

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Building castles out of mud: practical access pattern privacy and correctness on untrusted storage (2008, methodology): “Oblivious RAM [14] provides access pattern privacy to clients (or software processes) accessing a remote database (or RAM), requiring only logarithmic storage at the client.”
Secure Ranked Keyword Search over Encrypted Cloud Data (2010, background): “In this section, we start from the review of existing searchable symmetric encryption (SSE) schemes and provide the deﬁnitions and framework for our proposed ranked search-able symmetric encryption (RSSE).”
Enabling Security in Cloud Storage SLAs with CloudProof (2011, background): “The chain hash thus depends not only on the current attestation but also on the history of all the attestations for that block so far (because it includes the previous chain hash).”
Inference Attacks on Property-Preserving Encrypted Databases (2015, unknown): “There are various approaches to search on encrypted data including searchable symmetric encryption (SSE) [20, 37], fully-homomorphic encryption (FHE) [23], oblivious RAMs (ORAM) [24], functional encryption [15], and property-preserving encryption (PPE) [11,12].”
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits (2015, methodology): “One alternative approach for hiding memory access patterns is the use of Oblivious Random-Access Machine (ORAM) protocols [27] which allows oblivious load/store operations with amortized polylogarithmic overhead [25], [28], [51], [52].”
Security and Privacy in the Internet of Things (2017, methodology): “Note that hiding search and access patterns in a general SSE setting can be achieved using the oblivious RAM (ORAM) [75].”
Generic Attacks on Secure Outsourced Databases (2016, methodology): “…be applied to this problem, ranging from solutions based on tools such as fully homomorphic encryption (FHE) [20, 46] or oblivious RAM (ORAM) [23, 25] to more practical solutions based on weaker primitives such as structural encryption [33] or deterministic and order-preserving encryption [42,…”
Opaque: An Oblivious and Encrypted Distributed Analytics Platform (2017, background): “Oblivious RAM [13, 37, 38, 36] is a cryptographic construct for protecting against access pattern leakage.”
Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute (2017, background): “Oblivious-RAM [23] enables secure and oblivious computation by hiding data access patterns during program execution.”
Fairplay - Secure Two-Party Computation System (2004, background): “Non-oblivious com putations would seem to leak information from the very identity of the operation being simulated (existing solutions f or running RAM based computations obliviously are quite complex [22]).”
Aegis: A Single-Chip Secure Processor (2007, methodology): “However, as discussed in Section 2, we assume that the address bus is protected with appropriate schemes such as oblivious RAMs [43] or HIDE [159].”
Function Secret Sharing (2015, background): “Oblivious RAM (ORAM) [31] allows a client to eﬃ-ciently access data stored on a remote server while hiding the contents of the data and the locations being accessed.”
Efficient Similarity Search over Encrypted Data (2012, methodology): “Optimal security is achieved by the oblivous RAM model [18] of Goldreich et. al. which does not leak any information to the server.”