Garbled RAM from one-way functions
From MaRDI portal
Recommendations
Cites work
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast C-K-R partitions of sparse graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- On approximate distance labels and routing schemes with affine stretch
- On sparse spanners of weighted graphs
- Ramsey partitions and proximity data structures
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- Shortest-path queries in static networks
Cited in
(32)- Succinct garbling schemes from functional encryption through a local simulation paradigm
- An improved affine equivalence algorithm for random permutations
- Black-box parallel garbled RAM
- Constant-round maliciously secure two-party computation in the RAM model
- Two-server distributed ORAM with sublinear computation and constant rounds
- \textsc{EpiGRAM}: practical garbled RAM
- Adaptively secure computation for RAM programs
- Adaptively secure garbling schemes for parallel computations
- On the plausibility of fully homomorphic encryption for RAMs
- Oblivious parallel RAM and applications
- Fully succinct garbled RAM
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Succinct garbling and indistinguishability obfuscation for RAM programs
- 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
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- How to garble RAM programs?
- Garbled circuits as randomized encodings of functions: a primer
- Garbled RAM revisited
- Sublinear zero-knowledge arguments for RAM programs
- Collusion-resistant functional encryption for RAMs
- 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
- Privacy-preserving Dijkstra
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Multiparty garbling from OT with linear scaling and RAM support
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
- Cut-and-choose for garbled RAM
This page was built for publication: Garbled RAM from one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941537)
