Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation

DOI10.1007/978-3-642-55220-5_12zbMath1332.94068OpenAlexW1558353365MaRDI QIDQ5418697

Brent Waters, Amit Sahai, Susan Hohenberger

Publication date: 27 May 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_12

Mathematics Subject Classification ID

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

Related Items (28)

Practical algorithm substitution attack on extractable signatures ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Toward RSA-OAEP Without Random Oracles ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Survey of information security ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ The random oracle model: a twenty-year retrospective ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Augmented random oracles ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation ⋮ Obfustopia built on secret-key functional encryption ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Constrained pseudorandom functions from functional encryption ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ On instantiating the algebraic group model from falsifiable assumptions

This page was built for publication: Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation