Fully succinct garbled RAM
DOI10.1145/2840728.2840765zbMATH Open1334.68064OpenAlexW2294460196MaRDI QIDQ2800563FDOQ2800563
Authors: Ran Canetti, Justin Holmgren 
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2840728.2840765
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cited In (29)
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Succinct arguments for RAM programs via projection codes
- No-signaling linear PCPs
- Delegating RAM Computations
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- How to garble RAM programs?
- Garbled RAM revisited
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Garbled RAM from one-way functions
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- Better two-round adaptive multi-party computation
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Laconic function evaluation for Turing machines
- Collusion-resistant functional encryption for RAMs
- Tri-state circuits. A circuit model that captures RAM
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- No-signaling linear PCPs
- \textsc{EpiGRAM}: practical garbled RAM
- SNARGs for P from sub-exponential DDH and QR
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Laconic function evaluation and ABE for RAMs from (Ring-)LWE
- Time-lock puzzles from lattices
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Title not available (Why is that?)
- Adaptively secure garbling schemes for parallel computations
This page was built for publication: Fully succinct garbled RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800563)
