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