Pages that link to "Item:Q4571930"
From MaRDI portal
The following pages link to Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930):
Displaying 12 items.
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization (Q1680213) (← links)
- Gradual GRAM and secure computation for RAM programs (Q2106643) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Fully succinct garbled RAM (Q2800563) (← links)
- Bootstrapping Obfuscators via Fast Pseudorandom Functions (Q2936606) (← links)
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (Q2941534) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Bounded Collusion ABE for TMs from IBE (Q6041291) (← 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)