Laconic function evaluation for Turing machines
From MaRDI portal
Publication:6067382
DOI10.1007/978-3-031-31371-4_21OpenAlexW4367593009MaRDI QIDQ6067382
Giulio Malavolta, Phillip Gajland, Nico Döttling
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_21
Cites Work
- Unnamed Item
- A simple construction of iO for Turing machines
- Laconic oblivious transfer and its applications
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Multi-input laconic function evaluation
- Candidate obfuscation via oblivious LWE sampling
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more
- Output compression, MPC, and iO for Turing machines
- Exploring constructions of compact NIZKs from various assumptions
- Limits of Extractability Assumptions with Distributional Auxiliary Input
- Fully Succinct Garbled RAM
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- How to Run Turing Machines on Encrypted Data
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Randomized Encodings and their Applications
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Relations Among Complexity Measures
- Breaking the Sub-Exponential Barrier in Obfustopia
- Witness encryption and its applications
- New Negative Results on Differing-Inputs Obfuscation
This page was built for publication: Laconic function evaluation for Turing machines
