Fully succinct garbled RAM

DOI10.1145/2840728.2840765MaRDI QIDQ2800563zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

garblingdelegationobfuscationrandomized encodings

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Succinct garbling and indistinguishability obfuscation for RAM programs
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Garbled RAM from one-way functions
• How to garble RAM programs?
• Garbled RAM revisited

Cited in

(29)

• Delegating RAM computations with adaptive soundness and privacy
• Adaptive succinct garbled RAM or: how to delegate your database
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
• Better two-round adaptive multi-party computation
• Laconic function evaluation and ABE for RAMs from (Ring-)LWE
• Time-lock puzzles from lattices
• Laconic function evaluation for Turing machines
• FE and iO for Turing machines from minimal assumptions
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Collusion-resistant functional encryption for RAMs
• Succinct arguments for RAM programs via projection codes
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• How to garble RAM programs?
• Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
• NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
• No-signaling linear PCPs
• scientific article; zbMATH DE number 5139494 (Why is no real title available?)
• Adaptively secure garbling schemes for parallel computations
• Garbled RAM revisited
• Delegating RAM Computations
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Garbled RAM from one-way functions
• No-signaling linear PCPs
• Tri-state circuits. A circuit model that captures RAM
• \textsc{EpiGRAM}: practical garbled RAM
• SNARGs for P from sub-exponential DDH and QR

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)