Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources

DOI10.1007/978-3-662-44371-2_11zbMath1317.94091OpenAlexW2115221574MaRDI QIDQ2874504

Arno Mittelbach, Christina Brzuska, Pooya Farshim

Publication date: 7 August 2014

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

Full work available at URL: https://eprints.whiterose.ac.uk/153478/1/2014_099.pdf

zbMATH Keywords

random oracleindistinguishability obfuscation (iO)randomized encodingsuniversal computational extractors (UCEs)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Toward RSA-OAEP Without Random Oracles ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Lossy Key Encapsulation Mechanism and Its Applications ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Public-Seed Pseudorandom Permutations ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ The magic of ELFs ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration ⋮ The Magic of ELFs

This page was built for publication: Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources