Pages that link to "Item:Q2874522"
From MaRDI portal
The following pages link to Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings (Q2874522):
Displaying 47 items.
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← 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)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Reusable fuzzy extractors for low-entropy distributions (Q2032056) (← 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 from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Functional broadcast encryption with applications to data sharing for cloud storage (Q2224865) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings (Q2796115) (← 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)
- 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)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Shorter Circuit Obfuscation in Challenging Security Models (Q2827739) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← 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)
- Secure Obfuscation in a Weak Multilinear Map Model (Q3181029) (← links)
- Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents (Q3181030) (← links)
- Compactness vs Collusion Resistance in Functional Encryption (Q3181036) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 (Q5738782) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)