Pages that link to "Item:Q2796118"

The following pages link to Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118):

Displaying 8 items.

• Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models (Q2796117) (← links)
• On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
• On the complexity of compressing obfuscation (Q5918748) (← links)
• Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)