Pages that link to "Item:Q2796121"
From MaRDI portal
The following pages link to Output-Compressing Randomized Encodings and Applications (Q2796121):
Displaying 16 items.
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Cryptography with Updates (Q5738983) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
