Software protection and simulation on oblivious RAMs

DOI10.1145/233551.233553zbMath0885.68041OpenAlexW1988374166WikidataQ56851226 ScholiaQ56851226MaRDI QIDQ4371676

Rafail Ostrovsky, Oded Goldreich

Publication date: 21 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/103684

zbMATH Keywords

oblivious Turing machinesoftware protection

Mathematics Subject Classification ID

Related Items (only showing first 100 items - show all)

Large message homomorphic secret sharing from DCR and applications ⋮ Perfectly secure oblivious parallel RAM ⋮ How to Compute in the Presence of Leakage ⋮ Practical attacks against the walnut digital signature scheme ⋮ SQL on structurally-encrypted databases ⋮ Parameter-hiding order revealing encryption ⋮ A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Oblivious RAM with \textit{worst-case} logarithmic overhead ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost ⋮ Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Secure Multi-party Shuffling ⋮ Encrypted key-value stores ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Performance improvement for the GGM-construction of pseudorandom functions ⋮ Secure multi-party computation in large networks ⋮ Single-server private information retrieval with sublinear amortized time ⋮ The function-inversion problem: barriers and opportunities ⋮ Stronger lower bounds for online ORAM ⋮ Data-Oblivious Graph Algorithms in Outsourced External Memory ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ PrORAM ⋮ A survey on design and implementation of protected searchable data in the cloud ⋮ The complexity of secure RAMs ⋮ A theory of composition for differential obliviousness ⋮ M-ORAM Revisited: Security and Construction Updates ⋮ Klee's measure problem made oblivious ⋮ Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts ⋮ Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks ⋮ 3-party distributed ORAM from oblivious set membership ⋮ Collusion-resistant functional encryption for RAMs ⋮ Efficient searchable symmetric encryption for join queries ⋮ Weighted oblivious RAM, with applications to searchable symmetric encryption ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Succinct arguments for RAM programs via projection codes ⋮ Efficient Boolean search over encrypted data with reduced leakage ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Unnamed Item ⋮ Random-index oblivious RAM ⋮ One-time programs from commodity hardware ⋮ Unnamed Item ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Improved hidden vector encryption with short ciphertexts and tokens ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Partitioned searchable encryption ⋮ Low-Leakage Secure Search for Boolean Expressions ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Simple and efficient two-server ORAM ⋮ More is less: perfectly secure oblivious algorithms in the multi-server setting ⋮ Effective error-tolerant keyword search for secure cloud computing ⋮ An Efficient PIR Construction Using Trusted Hardware ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority ⋮ A low-cost memory remapping scheme for address bus protection ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation ⋮ Searchable symmetric encryption over multiple servers ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Secure computation without computers ⋮ Publicly verifiable searchable symmetric encryption based on efficient cryptographic components ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Lower and upper bounds on obtaining history independence ⋮ Obfuscation for cryptographic purposes ⋮ Efficient cache attacks on AES, and countermeasures ⋮ One-Time Programs ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Is there an oblivious RAM lower bound for online reads? ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Oblivious Parallel RAM and Applications ⋮ Oblivious Parallel RAM: Improved Efficiency and Generic Constructions ⋮ Information-Theoretic Local Non-malleable Codes and Their Applications ⋮ Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud ⋮ Locally decodable and updatable non-malleable codes and their applications ⋮ Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database ⋮ Locality-preserving oblivious RAM ⋮ Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution ⋮ Structured encryption and dynamic leakage suppression ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Private Information Retrieval Using Trusted Hardware ⋮ Pseudorandom Functions: Three Decades Later ⋮ Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ OptORAMa: optimal oblivious RAM ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity

This page was built for publication: Software protection and simulation on oblivious RAMs