On best-possible obfuscation

DOI10.1007/s00145-013-9151-zzbMath1302.94048OpenAlexW1995720451MaRDI QIDQ744349

Guy N. Rothblum

Publication date: 25 September 2014

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1721.1/129413

zbMATH Keywords

obfuscation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

One-Way Functions and (Im)perfect Obfuscation ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Bad Directions in Cryptographic Hash Functions ⋮ The power of natural properties as oracles ⋮ The final nail in the coffin of statistically-secure obfuscator ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers ⋮ On Statistically Secure Obfuscation with Approximate Correctness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical zero-knowledge languages can be recognized in two rounds
• Does co-NP have short interactive proofs ?
• On relationships between statistical zero-knowledge proofs
• The random oracle methodology, revisited
• A complete problem for statistical zero knowledge
• On obfuscating point functions
• Correcting errors without leaking partial information
• Obfuscation for Cryptographic Purposes
• Securely Obfuscating Re-encryption
• Graph-Based Algorithms for Boolean Function Manipulation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: On best-possible obfuscation