Fully Succinct Garbled RAM
From MaRDI portal
Publication:2800563
DOI10.1145/2840728.2840765zbMath1334.68064OpenAlexW2294460196MaRDI QIDQ2800563
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (20)
Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Adaptive Succinct Garbled RAM or: How to Delegate Your Database ⋮ Delegating RAM Computations ⋮ \textsc{EpiGRAM}: practical garbled RAM ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Adaptively secure garbling schemes for parallel computations ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ Collusion-resistant functional encryption for RAMs ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ No-signaling linear PCPs ⋮ Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE ⋮ No-signaling linear PCPs ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
This page was built for publication: Fully Succinct Garbled RAM
