How to garble RAM programs?
From MaRDI portal
Publication:4924441
Recommendations
Cited in
(49)- FE and iO for Turing machines from minimal assumptions
- An improved affine equivalence algorithm for random permutations
- Black-box parallel garbled RAM
- Constant-round maliciously secure two-party computation in the RAM model
- Stacked garbling for disjunctive zero-knowledge proofs
- Two-server distributed ORAM with sublinear computation and constant rounds
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- \textsc{EpiGRAM}: practical garbled RAM
- Garbled circuits with sublinear evaluator
- Adaptively secure computation for RAM programs
- Adaptively secure garbling schemes for parallel computations
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Fully succinct garbled RAM
- High-precision secure computation of satellite collision probabilities
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Garbled RAM from one-way functions
- Reactive garbling: foundation, instantiation, application
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Secure multiparty RAM computation in constant rounds
- Constant-round maliciously secure two-party computation in the RAM model
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Garbled circuits as randomized encodings of functions: a primer
- Garbled RAM revisited
- Asymptotically tight bounds for composing ORAM with PIR
- Cryptography with updates
- Bounded Collusion ABE for TMs from IBE
- Bounded functional encryption for Turing machines: adaptive security from general assumptions
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Tri-state circuits. A circuit model that captures RAM
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- R3PO: reach-restricted reactive program obfuscation and its applications
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Efficient arithmetic in garbled circuits
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- Privacy-preserving Dijkstra
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Multiparty garbling from OT with linear scaling and RAM support
- Efficient permutation correlations and batched random access for two-party computation
- Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-off
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
- Cut-and-choose for garbled RAM
This page was built for publication: How to garble RAM programs?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924441)
