The following pages link to Fully succinct garbled RAM (Q2800563):
Displaying 20 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- (Q3429551) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- How to Garble RAM Programs? (Q4924441) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation (Q6636505) (← links)
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE (Q6652894) (← links)
- Time-lock puzzles from lattices (Q6652906) (← links)
