Pages that link to "Item:Q5261687"

The following pages link to On Obfuscation with Random Oracles (Q5261687):

Displaying 17 items.

• Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
• Impossibility of order-revealing encryption in idealized models (Q1631321) (← links)
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
• Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings (Q2796115) (← links)
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models (Q2796117) (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
• On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
• Bootstrapping Obfuscators via Fast Pseudorandom Functions (Q2936606) (← links)
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
• On Best-Possible Obfuscation (Q3596381) (← links)
• (Q4373607) (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
• Combining Encryption and Proof of Knowledge in the Random Oracle Model (Q4828447) (← links)
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes (Q5451039) (← links)
• On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
• On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)