On Strong Simulation and Composable Point Obfuscation

DOI10.1007/978-3-642-14623-7_28zbMath1283.94052OpenAlexW2160693197MaRDI QIDQ3582775

Ran Canetti, Nir Bitansky

Publication date: 24 August 2010

Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_28

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Unclonable polymers and their cryptographic applications ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On virtual grey box obfuscation for general circuits ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Obfuscating conjunctions ⋮ Reusable fuzzy extractors for low-entropy distributions ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Reusable fuzzy extractor from the decisional Diffie-Hellman assumption ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Secure Obfuscation of Encrypted Verifiable Encrypted Signatures ⋮ Obfuscation Combiners ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software

This page was built for publication: On Strong Simulation and Composable Point Obfuscation