Pages that link to "Item:Q1675746"
From MaRDI portal
The following pages link to Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs (Q1675746):
Displaying 44 items.
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← 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 without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- Functional encryption for attribute-weighted sums from \(k\)-Lin (Q2096503) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin (Q2139632) (← links)
- Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Inner-product functional encryption with fine-grained access control (Q2691594) (← links)
- Adaptive Simulation Security for Inner Product Functional Encryption (Q5041151) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions (Q5896157) (← links)
- Unbounded inner product functional encryption from bilinear maps (Q5915907) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Unbounded inner product functional encryption from bilinear maps (Q5919081) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Unbounded predicate inner product functional encryption from pairings (Q6109084) (← links)
- A survey on functional encryption (Q6163797) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Fine-grained polynomial functional encryption (Q6593672) (← links)
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
- Lower bounds for lattice-based compact functional encryption (Q6636507) (← links)
