Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources

DOI10.1007/978-3-662-44371-2_11MaRDI QIDQ2874504zbMATH OpenOpenAlexFDO

Authors Christina Brzuska, Pooya Farshim, Arno Mittelbach

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

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

Recommendations

• Using indistinguishability obfuscation via UCEs
• Instantiating random oracles via UCEs
• Modeling random oracles under unpredictable queries
• Chosen ciphertext security via UCE
• Security definitions for hash functions: combining UCE and indifferentiability

Cited in

(21)

• Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
• Lossy key encapsulation mechanism and its applications
• Point-function obfuscation: a framework and generic constructions
• The magic of ELFs
• Searching for ELFs in the cryptographic forest
• Strong hardness of privacy from weak traitor tracing
• Big-key symmetric encryption: resisting key exfiltration
• Chosen ciphertext security via UCE
• Nonmalleable digital lockers and robust fuzzy extractors in the plain model
• Beyond Uber: instantiating generic groups via PGGs
• Public-seed pseudorandom permutations
• Using indistinguishability obfuscation via UCEs
• Contention in cryptoland: obfuscation, leakage and UCE
• The Magic of ELFs
• Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
• Security definitions for hash functions: combining UCE and indifferentiability
• Instantiating random oracles via UCEs
• Toward RSA-OAEP without random oracles
• Modeling random oracles under unpredictable queries
• Compact key storage. A modern approach to key backup and delegation
• Upgrading fuzzy extractors

This page was built for publication: Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874504)