The following pages link to On Best-Possible Obfuscation (Q3596381):
Displaying 30 items.
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Obfuscating conjunctions (Q514475) (← links)
- On strong simulation and composable point obfuscation (Q744605) (← links)
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation (Q780319) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents (Q3181030) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- Towards Security Notions for White-Box Cryptography (Q3399199) (← links)
- Obfuscation of Hyperplane Membership (Q3408188) (← links)
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More (Q4989921) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- (Q5121895) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Ad Hoc PSM Protocols: Secure Computation Without Coordination (Q5270377) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation (Q6070448) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
