Cryptography for parallel RAM from indistinguishability obfuscation
From MaRDI portal
Publication:2800564
Recommendations
Cited in
(16)- Delegating RAM computations with adaptive soundness and privacy
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Laconic function evaluation for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Collusion-resistant functional encryption for RAMs
- Memory checking for parallel RAMs
- Forward secret encrypted RAM: lower bounds and applications
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- No-signaling linear PCPs
- Adaptively secure garbling schemes for parallel computations
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- No-signaling linear PCPs
- Oblivious parallel RAM and applications
- Forward-secure searchable encryption on labeled bipartite graphs
- SNARGs for P from sub-exponential DDH and QR
This page was built for publication: Cryptography for parallel RAM from indistinguishability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800564)