Pages that link to "Item:Q2948392"

The following pages link to How to Obfuscate Programs Directly (Q2948392):

Displaying 43 items.

• The random oracle model: a twenty-year retrospective (Q887442) (← links)
• Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
• On the bit security of cryptographic primitives (Q1648779) (← links)
• Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
• Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• On virtual grey box obfuscation for general circuits (Q1688397) (← links)
• How to build time-lock encryption (Q1791669) (← links)
• Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
• Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
• Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications (Q2179397) (← links)
• Multilinear maps from obfuscation (Q2188963) (← links)
• Efficient and scalable universal circuits (Q2188968) (← links)
• Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
• Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
• Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
• On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
• Multilinear Maps from Obfuscation (Q2796137) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
• Shorter Circuit Obfuscation in Challenging Security Models (Q2827739) (← links)
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
• Efficient and Provable White-Box Primitives (Q2958118) (← links)
• Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
• Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
• Constraining Pseudorandom Functions Privately (Q5738766) (← links)
• Universal Samplers with Fast Verification (Q5738767) (← links)
• Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 (Q5738782) (← links)
• Separating IND-CPA and Circular Security for Unbounded Length Key Cycles (Q5738789) (← 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)
• Obfustopia built on secret-key functional encryption (Q5925547) (← links)
• Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)