Pages that link to "Item:Q5746330"

The following pages link to Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding (Q5746330):

Displaying 50 items.

• Obfuscating conjunctions (Q514475) (← links)
• Obfuscating finite automata (Q832331) (← links)
• Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
• Impossibility of order-revealing encryption in idealized models (Q1631321) (← links)
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• On virtual grey box obfuscation for general circuits (Q1688397) (← links)
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
• How to build time-lock encryption (Q1791669) (← links)
• Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
• White-box cryptography: don't forget about grey-box attacks (Q2010584) (← 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)
• Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
• Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
• Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
• Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications (Q2179397) (← links)
• Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
• Secret-sharing for NP (Q2397445) (← 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)
• Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
• Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
• On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
• Perfect Structure on the Edge of Chaos (Q2796138) (← links)
• Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
• How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
• Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
• Functional Encryption Without Obfuscation (Q2799106) (← links)
• On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
• Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
• Shorter Circuit Obfuscation in Challenging Security Models (Q2827739) (← links)
• A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
• Obfuscation Combiners (Q2829229) (← links)
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Q2829233) (← links)
• Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation (Q3179487) (← links)
• Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
• Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
• Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113) (← links)
• Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
• Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
• On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
• One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)