Pages that link to "Item:Q2796119"

The following pages link to Indistinguishability Obfuscation: From Approximate to Exact (Q2796119):

Displaying 25 items.

• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• Combiners for functional encryption, unconditionally (Q2055605) (← links)
• A note on perfect correctness by derandomization (Q2146431) (← links)
• From FE combiners to secure MPC and back (Q2175912) (← links)
• Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
• Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
• Functional Encryption for Turing Machines (Q2796122) (← links)
• Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
• Obfuscation Combiners (Q2829229) (← links)
• On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
• Verifiable Functional Encryption (Q2953789) (← links)
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
• Semi-adaptive Security and Bundling Functionalities Made Generic and Easy (Q3181033) (← links)
• A Note on Perfect Correctness by Derandomization (Q5267419) (← links)
• Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
• Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
• On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
• On the complexity of compressing obfuscation (Q5918748) (← links)