Recommendations
Cites work
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- A complete problem for statistical zero knowledge
- Advances in Cryptology - EUROCRYPT 2004
- Correcting errors without leaking partial information
- Does co-NP have short interactive proofs ?
- Graph-Based Algorithms for Boolean Function Manipulation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Obfuscation for Cryptographic Purposes
- On obfuscating point functions
- On relationships between statistical zero-knowledge proofs
- Securely Obfuscating Re-encryption
- Statistical zero-knowledge languages can be recognized in two rounds
- The random oracle methodology, revisited.
Cited in
(23)- On the impossibility of approximate obfuscation and applications to resettable cryptography
- The pseudorandom oracle model and ideal obfuscation
- Obfuscating simple functionalities from knowledge assumptions
- Obfuscation for evasive functions
- The final nail in the coffin of statistically-secure obfuscator
- Limits on the power of indistinguishability obfuscation and functional encryption
- Compactness vs collusion resistance in functional encryption
- On obfuscation with random oracles
- On Best-Possible Obfuscation
- Non-malleable Obfuscation
- The power of natural properties as oracles
- On statistically secure obfuscation with approximate correctness
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Structure vs. hardness through the obfuscation lens
- Constructions for quantum indistinguishability obfuscation
- Bad directions in cryptographic hash functions
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- The impossibility of obfuscation with auxiliary input or a universal simulator
- On the (im)possibility of obfuscating programs
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- One-Way Functions and (Im)perfect Obfuscation
- Obfuscation of probabilistic circuits and applications
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 Q744349)
