Succinct garbling and indistinguishability obfuscation for RAM programs
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
(48)- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- FE and iO for Turing machines from minimal assumptions
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Fully deniable interactive encryption
- Gradual GRAM and secure computation for RAM programs
- SNARGs for P from sub-exponential DDH and QR
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Output-compressing randomized encodings and applications
- Functional Encryption for Turing Machines
- Oblivious parallel RAM and applications
- Fully succinct garbled RAM
- Obfuscation combiners
- On the existence of extractable one-way functions
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- Delegating RAM Computations
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Constant-round interactive proofs for delegating computation
- Garbled circuits as randomized encodings of functions: a primer
- Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper)
- Structure versus hardness through the obfuscation lens
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Better two-round adaptive multi-party computation
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Cryptography with updates
- No-signaling linear PCPs
- No-signaling linear PCPs
- Adaptively secure MPC with sublinear communication complexity
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Collusion-resistant functional encryption for RAMs
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Non-interactive anonymous router with quasi-linear router computation
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Time-lock puzzles from lattices
- \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman
- Succinct PPRFs via memory-tight reductions
- Key-homomorphic computations for RAM: fully succinct randomised encodings and more
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Homomorphic indistinguishability obfuscation and its applications
- Indistinguishability obfuscation from well-founded assumptions
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
This page was built for publication: Succinct garbling and indistinguishability obfuscation for RAM programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941535)
