Outsourcing Private RAM Computation

No abstract is available for this paper.

• Publication year

  2014

• Venue

  IEEE Annual Symposium on Foundations of Computer Science

• Publication date

  2014-10-18

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/FOCS.2014.50
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Advances in Cryptology

  2016cited by this paper
• On Extractability Obfuscation

  2014cited by this paper
• Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

  2014cited by this paper
• Garbled RAM Revisited, Part I

  2014cited by this paper
• Garbled RAM Revisited, Part II

  2014cited by this paper
• Protecting Obfuscation against Algebraic Attacks

  2014cited by this paper
• Non-Interactive Cryptography in the RAM Model of Computation

  2014cited by this paper
• Garbled RAM Revisited

  2014cited by this paper
• Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013

  2013cited by this paper
• How to Garble RAM Programs

  2013cited by this paper
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

  2013cited by this paper
• Candidate Multilinear Maps from Ideal Lattices

  2013cited by this paper
• Recursive composition and bootstrapping for SNARKS and proof-carrying data

  2013cited by this paper
• How to Run Turing Machines on Encrypted Data

  2013cited by this paper
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

  2013cited by this paper
• Verifying computations with state

  2013cited by this paper
• Reusable garbled circuits and succinct functional encryption

  2013cited by this paper
• On the Achievability of Simulation-Based Security for Functional Encryption

  2013cited by this paper
• Differing-Inputs Obfuscation and Applications

  2013cited by this paper
• Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

  2013cited by this paper
• Obfuscation from Semantically-Secure Multi-linear Encodings

  2013cited by this paper
• Secure two-party computation in sublinear (amortized) time

  2012cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency

  2008cited by this paper
• On the (im)possibility of obfuscating programs

  2001cited by this paper
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

  1999cited by this paper
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• Private information storage (extended abstract)

  1997cited by this paper
• Private Information Storage

  1996cited by this paper
• Software protection and simulation on oblivious RAMs

  1996cited by this paper
• Private information retrieval

  1995cited by this paper
• Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

  1986cited by this paper
• Protocols for Secure Computations (Extended Abstract)

  1982cited by this paper
• Relations Among Complexity Measures

  1979cited by this paper
• ON DATA BANKS AND PRIVACY HOMOMORPHISMS

  1978cited by this paper
• Time-bounded random access machines

  1972cited by this paper

• MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM

  2025cites this paper
• A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)

  2025cites this paper
• Laconic Function Evaluation, Functional Encryption and Obfuscation for RAMs with Sublinear Computation

  2024cites this paper
• Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE

  2023cites this paper
• On Low-End Obfuscation and Learning

  2023cites this paper
• Functional Encryption Against Probabilistic Queries: Definition, Construction and Applications

  2023cites this paper
• White-Box Cryptography with Global Device Binding from Message-Recoverable Signatures and Token-Based Obfuscation

  2023cites this paper
• Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions

  2022cites this paper
• Collusion-Resistant Functional Encryption for RAMs

  2022cites this paper
• Random-Index Oblivious RAM

  2022cites this paper
• Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC

  2022cites this paper
• White-box Cryptography with Device Binding from Token-based Obfuscation and more

  2021cites this paper
• Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms

  2021cites this paper
• Bounded Collusion ABE for TMs from IBE

  2021cites this paper
• MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

  2020cites this paper
• Lower Bound for Oblivious RAM with Large Cells

  2020cites this paper
• Constant-round Blind Classical Verification of Quantum Sampling

  2020cites this paper
• Cryptographic Obfuscation: A Survey

  2020cites this paper
• Privacy Changes Everything

  2019cites this paper
• Heterogeneous Data Management, Polystores, and Analytics for Healthcare: VLDB 2019 Workshops, Poly and DMAH, Los Angeles, CA, USA, August 30, 2019, Revised Selected Papers

  2019influential citation
• On the Plausibility of Fully Homomorphic Encryption for RAMs

  2019cites this paper
• Fully Homomorphic Encryption for RAMs

  2019cites this paper
• Towards Secure Computation with Optimal Complexity

  2019cites this paper
• Making Public Key Functional Encryption Function Private, Distributively

  2018cites this paper
• Adaptive Garbled RAM from Laconic Oblivious Transfer

  2018cites this paper
• FE and iO for Turing Machines from Minimal Assumptions

  2018cites this paper
• Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization

  2017cites this paper
• Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs

  2017cites this paper
• Industrial Feasibility of Private Information Retrieval

  2017cites this paper
• Homomorphic Encryption

  2017cites this paper
• Black-Box Parallel Garbled RAM

  2017cites this paper
• Laconic Oblivious Transfer and Its Applications

  2017cites this paper
• Short Paper: Industrial Feasibility of Private Information Retrieval

  2017cites this paper
• Patchable Indistinguishability Obfuscation: iO for Evolving Software

  2017cites this paper
• Private Functional Encryption - Hiding What Cannot Be Learned Through Function Evaluation

  2017cites this paper
• Updatable Functional Encryption

  2016cites this paper
• Output-Compressing Randomized Encodings and Applications

  2016cites this paper
• Oblivious RAM: from theory to practice

  2016influential citation
• On Program Obfuscation

  2016influential citation
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM

  2016cites this paper
• Adaptive Succinct Garbled RAM or: How to Delegate Your Database

  2016cites this paper
• Is There an Oblivious RAM Lower Bound?

  2016cites this paper
• Program Obfuscation: Applications and Optimizations

  2016cites this paper
• Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings

  2016cites this paper
• Cryptography for Parallel RAM from Indistinguishability Obfuscation

  2016cites this paper
• Interactive Oracle Proofs

  2016cites this paper
• Oblivious Parallel RAM and Applications

  2016cites this paper
• Delegating RAM Computations with Adaptive Soundness and Privacy

  2016cites this paper
• Secure Multiparty RAM Computation in Constant Rounds

  2016cites this paper
• Indistinguishability Obfuscation with Non-trivial Efficiency

  2016cites this paper
• New Negative Results on Differing-Inputs Obfuscation

  2016cites this paper
• Delegating RAM Computations

  2016cites this paper
• Verifiable Computation for Randomized Algorithm

  2016cites this paper
• Succinct Adaptive Garbled RAM

  2015cites this paper
• Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM

  2015cites this paper
• Oblivious Network RAM

  2015cites this paper
• The general model of secure computation system

  2015cites this paper
• Computation-Trace Indistinguishability Obfuscation and its Applications

  2015cites this paper
• Garbled RAM From One-Way Functions

  2015cites this paper
• From Selective to Adaptive Security in Functional Encryption

  2015cites this paper
• Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness

  2015cites this paper
• Hosting Services on an Untrusted Cloud

  2015influential citation
• Patchable Obfuscation

  2015cites this paper
• Constructing secure MapReduce framework in cloud-based environment

  2015cites this paper
• Succinct garbled RAM from indistinguishablity obfuscation

  2015cites this paper
• Survey on cyberspace security

  2015cites this paper
• Black-Box Garbled RAM

  2015cites this paper
• Indistinguishability Obfuscation from Compact Functional Encryption

  2015cites this paper
• Succinct Randomized Encodings and their Applications

  2015cites this paper
• Succinct Garbling and Indistinguishability Obfuscation for RAM Programs

  2015cites this paper
• On the Communication Complexity of Secure Function Evaluation with Long Output

  2015cites this paper
• Optimizing Obfuscation: Avoiding Barrington's Theorem

  2014cites this paper
• Applicability of Indistinguishability Obfuscation

  2014cites this paper
• A Framework for Outsourcing of Secure Computation

  2014cites this paper
• SCORAM: Oblivious RAM for Secure Computation

  2014cites this paper
• Succinct Garbling Schemes and Applications

  2014cites this paper
• The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically

  2014cites this paper
• Computing on the edge of chaos: Structure and randomness in encrypted computation

  2014cites this paper
• Indistinguishability Obfuscation of Iterated Circuits and RAM Programs

  2014cites this paper
• Oblivious Parallel RAM

  2014cites this paper