On Best-Possible Obfuscation

DOI10.1007/978-3-540-70936-7_11zbMath1129.94023OpenAlexW2152144666MaRDI QIDQ3596381

Guy N. Rothblum

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_11

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (33)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Best possible information-theoretic MPC ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Proofs of Work from worst-case assumptions ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On virtual grey box obfuscation for general circuits ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation ⋮ How to Generate and Use Universal Samplers ⋮ 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 ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Obfuscating conjunctions ⋮ On the complexity of compressing obfuscation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Obfuscation for cryptographic purposes ⋮ On strong simulation and composable point obfuscation ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Unnamed Item ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ Towards Security Notions for White-Box Cryptography ⋮ Leakage resilience from program obfuscation ⋮ How to Use Indistinguishability Obfuscation: Deniable Encryption, and More ⋮ Obfuscation of Hyperplane Membership ⋮ A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination

This page was built for publication: On Best-Possible Obfuscation