Garbled RAM revisited
From MaRDI portal
Recommendations
Cited in
(43)- Adaptively secure garbling schemes for parallel computations
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- Two-server distributed ORAM with sublinear computation and constant rounds
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Adaptively secure computation for RAM programs
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Sublinear zero-knowledge arguments for RAM programs
- An improved affine equivalence algorithm for random permutations
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Constant-round maliciously secure two-party computation in the RAM model
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Reactive garbling: foundation, instantiation, application
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Bounded Collusion ABE for TMs from IBE
- Indistinguishability obfuscation from compact functional encryption
- Garbled RAM from one-way functions
- Oblivious parallel RAM and applications
- How to garble RAM programs?
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- Garbled circuits as randomized encodings of functions: a primer
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- High-precision secure computation of satellite collision probabilities
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Secure multiparty RAM computation in constant rounds
- Collusion-resistant functional encryption for RAMs
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Constant-round maliciously secure two-party computation in the RAM model
- Tri-state circuits. A circuit model that captures RAM
- Fully succinct garbled RAM
- \textsc{EpiGRAM}: practical garbled RAM
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Black-box parallel garbled RAM
- Multiparty garbling from OT with linear scaling and RAM support
- Cryptography with updates
- R3PO: reach-restricted reactive program obfuscation and its applications
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Advanced composition theorems for differential obliviousness
- Secret-shared shuffle
This page was built for publication: Garbled RAM revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418708)
