On Best-Possible Obfuscation
From MaRDI portal
Recommendations
- On best-possible obfuscation
- On the (im)possibility of obfuscating programs
- On the possibility of provably secure obfuscating programs
- On extractability obfuscation
- On obfuscation with random oracles
- On the complexity of compressing obfuscation
- On the complexity of compressing obfuscation
- Indistinguishability obfuscation with non-trivial efficiency
- Indistinguishability obfuscation: from approximate to exact
- scientific article; zbMATH DE number 1842483
Cited in
(49)- Best possible information-theoretic MPC
- Proofs of Work from worst-case assumptions
- Structure vs. hardness through the obfuscation lens
- On virtual grey box obfuscation for general circuits
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Candidate obfuscation via oblivious LWE sampling
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Obfuscation for cryptographic purposes
- Obfuscating simple functionalities from knowledge assumptions
- Leakage resilience from program obfuscation
- Succinct LWE sampling, random polynomials, and obfuscation
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- On statistically secure obfuscation with approximate correctness
- How to Generate and Use Universal Samplers
- Circuit obfuscation using braids
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Towards Security Notions for White-Box Cryptography
- Obfuscation of hyperplane membership
- Non-malleable Obfuscation
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- How to use indistinguishability obfuscation: deniable encryption, and more
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- scientific article; zbMATH DE number 7250147 (Why is no real title available?)
- Obfuscating conjunctions
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Ad hoc PSM protocols: secure computation without coordination
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Hiding Circuit Topology from Unbounded Reverse Engineers
- One-Way Functions and (Im)perfect Obfuscation
- On the complexity of compressing obfuscation
- Structure-preserving compilers from new notions of obfuscations
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
- The pseudorandom oracle model and ideal obfuscation
- The final nail in the coffin of statistically-secure obfuscator
- Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
- Pseudorandom obfuscation and applications
- Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
- Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- Lower bounds on the overhead of indistinguishability obfuscation
- On the possibility of malicious obfuscation
- On best-possible obfuscation
- On strong simulation and composable point obfuscation
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation
This page was built for publication: On Best-Possible Obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596381)
