Pages that link to "Item:Q2936606"
From MaRDI portal
The following pages link to Bootstrapping Obfuscators via Fast Pseudorandom Functions (Q2936606):
Displaying 16 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
