On obfuscation with random oracles
From MaRDI portal
Publication:5261687
DOI10.1007/978-3-662-46497-7_18zbMATH Open1355.94049OpenAlexW336511203MaRDI QIDQ5261687FDOQ5261687
Authors: Ran Canetti, Yael Tauman Kalai, Omer Paneth 
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_18
Recommendations
Cited In (19)
- On Removing Graded Encodings from Functional Encryption
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Structure-preserving compilers from new notions of obfuscations
- The pseudorandom oracle model and ideal obfuscation
- On constructing one-way permutations from indistinguishability obfuscation
- Impossibility of simulation secure functional encryption even with random oracles
- Impossibility of order-revealing encryption in idealized models
- Impossibility of VBB obfuscation with ideal constant-degree graded encodings
- Limits on the power of indistinguishability obfuscation and functional encryption
- On constructing one-way permutations from indistinguishability obfuscation
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
- On Best-Possible Obfuscation
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- On statistically secure obfuscation with approximate correctness
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Title not available (Why is that?)
This page was built for publication: On obfuscation with random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261687)
