Delegating RAM Computations with Adaptive Soundness and Privacy
From MaRDI portal
Publication:3181020
DOI10.1007/978-3-662-53644-5_1zbMath1397.94045OpenAlexW2403527116MaRDI QIDQ3181020
Kai-Min Chung, Yu-Chi Chen, Wei-Kai Lin, Huijia Lin, Prabhanjan V. Ananth
Publication date: 22 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53644-5_1
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (15)
Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ 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 ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
Cites Work
- Functional Encryption for Turing Machines
- Oblivious Parallel RAM and Applications
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Adaptively Secure Garbled Circuits from One-Way Functions
- Practical Multilinear Maps over the Integers
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Garbled RAM From One-Way Functions
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Indistinguishability Obfuscation from Compact Functional Encryption
- Candidate Multilinear Maps from Ideal Lattices
- How to Garble RAM Programs?
- How to delegate computations
- Obfuscation of Probabilistic Circuits and Applications
- Graph-Induced Multilinear Maps from Lattices
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
- Protecting Obfuscation against Algebraic Attacks
- Garbled RAM Revisited
- Advances in Cryptology - CRYPTO 2003
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
This page was built for publication: Delegating RAM Computations with Adaptive Soundness and Privacy
