How to Garble RAM Programs?
From MaRDI portal
Publication:4924441
DOI10.1007/978-3-642-38348-9_42zbMath1300.68027OpenAlexW195811623MaRDI QIDQ4924441
Publication date: 31 May 2013
Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_42
Related Items (31)
FE and iO for Turing machines from minimal assumptions ⋮ 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 ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ An improved affine equivalence algorithm for random permutations ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ Garbled circuits with sublinear evaluator ⋮ Adaptively secure computation for RAM programs ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ Cryptography with Updates ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication: How to Garble RAM Programs?
