Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
From MaRDI portal
Publication:6636505
DOI10.1007/978-3-031-58723-8_7MaRDI QIDQ6636505
Ethan Mook, Daniel Wichs, Zihan Hao, Fangqi Dong
Publication date: 12 November 2024
Cites Work
- Adaptive garbled RAM from laconic oblivious transfer
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Adaptively secure garbling with near optimal online complexity
- Laconic oblivious transfer and its applications
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- On the plausibility of fully homomorphic encryption for RAMs
- Fully succinct garbled RAM
- Functional Encryption: New Perspectives and Lower Bounds
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Software protection and simulation on oblivious RAMs
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- How to Garble RAM Programs?
- Garbled RAM Revisited
- Reusable garbled circuits and succinct functional encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Indistinguishability obfuscation from well-founded assumptions
- Laconic function evaluation for Turing machines
- Collusion-resistant functional encryption for RAMs
Related Items (2)
Laconic function evaluation and ABE for RAMs from (Ring-)LWE ⋮ Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
This page was built for publication: Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636505)
