Replacing a random oracle: full domain hash from indistinguishability obfuscation

DOI10.1007/978-3-642-55220-5_12zbMATH Open1332.94068OpenAlexW1558353365MaRDI QIDQ5418697FDOQ5418697

Authors: Susan Hohenberger, Amit Sahai, Brent Waters 

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

Recommendations

• Random-oracle uninstantiability from indistinguishability obfuscation
• On the Generic Insecurity of the Full Domain Hash
• scientific article; zbMATH DE number 1088253
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
• Instantiability of classical random-oracle-model encryption transforms

Mathematics Subject Classification ID

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

Cited In (34)

• Random-oracle uninstantiability from indistinguishability obfuscation
• Practical algorithm substitution attack on extractable signatures
• Another step towards realizing random oracles: non-malleable point obfuscation
• Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
• On constructing one-way permutations from indistinguishability obfuscation
• The magic of ELFs
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
• Strong hardness of privacy from weak traitor tracing
• Survey of information security
• Fiat-Shamir for highly sound protocols is instantiable
• Limits on the power of indistinguishability obfuscation and functional encryption
• Fiat-Shamir for highly sound protocols is instantiable
• Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
• Title not available (Why is that?)
• On constructing one-way permutations from indistinguishability obfuscation
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• On the correlation intractability of obfuscated pseudorandom functions
• Augmented random oracles
• Instantiability of classical random-oracle-model encryption transforms
• The random oracle model: a twenty-year retrospective
• Simpler constructions of asymmetric primitives from obfuscation
• Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
• Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper)
• On the Generic Insecurity of the Full Domain Hash
• Obfustopia built on secret-key functional encryption
• The Magic of ELFs
• Toward RSA-OAEP without random oracles
• Cocks’ Identity-Based Encryption in the Standard Model, via Obfuscation Techniques (Short Paper)
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
• Constrained pseudorandom functions from functional encryption
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• 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

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