Instantiating random oracles via UCEs

DOI10.1007/978-3-642-40084-1_23MaRDI QIDQ2849409zbMATHOpenAlexFDO

Authors M. Bellare, Viet Tung Hoang, Sriram Keelveedhi

Publication date 17 September 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_23

Mathematics Subject Classification ID

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

Recommendations

• Chosen ciphertext security via UCE
• Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
• Modeling random oracles under unpredictable queries
• Security definitions for hash functions: combining UCE and indifferentiability
• A random oracle for all of us

Cited in

(45)

• The magic of ELFs
• Big-key symmetric encryption: resisting key exfiltration
• Structure-preserving compilers from new notions of obfuscations
• Adaptive security of Yao's garbled circuits
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Toward RSA-OAEP without random oracles
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• The Magic of ELFs
• Signatures Resilient to Uninvertible Leakage
• Instantiability of RSA-OAEP under chosen-plaintext attack
• The random oracle model: a twenty-year retrospective
• Using indistinguishability obfuscation via UCEs
• Adaptively secure garbled circuits from one-way functions
• Point-function obfuscation: a framework and generic constructions
• Subversion-resilient signatures: definitions, constructions and applications
• Augmented random oracles
• Towards forward security properties for PEKS and IBE
• Extracting randomness from extractor-dependent sources
• Immunizing backdoored PRGs
• Searching for ELFs in the cryptographic forest
• Limits on the adaptive security of Yao's garbling
• Lossy key encapsulation mechanism and its applications
• Practical algorithm substitution attack on extractable signatures
• Selective-Opening Security in the Presence of Randomness Failures
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
• A unified approach to idealized model separations via indistinguishability obfuscation
• Approximate-deterministic public key encryption from hard learning problems
• Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
• Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
• Adaptive security of practical garbling schemes
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
• On the correlation intractability of obfuscated pseudorandom functions
• Modeling random oracles under unpredictable queries
• Another step towards realizing random oracles: non-malleable point obfuscation
• On treewidth, separators and Yao's garbling
• Security definitions for hash functions: combining UCE and indifferentiability
• How to Generate and Use Universal Samplers
• Chosen ciphertext security via UCE
• Contention in cryptoland: obfuscation, leakage and UCE
• Beyond Uber: instantiating generic groups via PGGs
• Public-seed pseudorandom permutations
• Cryptography from compression functions: the UCE bridge to the ROM
• Instantiability of classical random-oracle-model encryption transforms
• Efficient leakage-resilient MACs without idealized assumptions
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy

This page was built for publication: Instantiating random oracles via UCEs

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